{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04512671,0.0063534123,0.9464144,0.00059057004,0.00017239028,0.0004144262,0.000005015696,0.00019744383,0.0007256323],"genre_scores_gemma":[0.99447155,0.0008086667,0.0026231587,0.0005870904,0.00017495437,0.00012514298,0.000034725468,0.00005030127,0.0011244231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971921,0.00021829802,0.00049323536,0.00064828416,0.00021394218,0.0012341304],"domain_scores_gemma":[0.9983915,0.0002647663,0.00027929604,0.00067458866,0.0002548949,0.00013496228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009770286,0.00033815976,0.0004135588,0.000102632526,0.00081144494,0.00044772628,0.00071462896,0.00013461862,0.000005653329],"category_scores_gemma":[0.000021736481,0.00031759124,0.00012520612,0.00029494124,0.000055849214,0.00013005678,0.00013830993,0.0003545203,0.000010455838],"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.00028281263,0.0002555454,0.000012948659,0.000097362245,0.0001217464,0.0000013270925,0.0010336181,0.105993405,0.002577519,0.57269436,0.009610083,0.30731928],"study_design_scores_gemma":[0.0006766982,0.00091246306,0.000004759667,0.00006387749,0.000011873829,0.000020948595,0.000009783241,0.8337401,0.0020965596,0.0075881095,0.15454566,0.00032913708],"about_ca_topic_score_codex":0.000018598814,"about_ca_topic_score_gemma":0.00027989384,"teacher_disagreement_score":0.9493448,"about_ca_system_score_codex":0.00025059318,"about_ca_system_score_gemma":0.000227238,"threshold_uncertainty_score":0.99992764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024850704,0.0005229476,0.9772214,0.0002668462,0.002503719,0.0008233475,0.0000014776491,0.00018020804,0.018231489],"genre_scores_gemma":[0.13108589,0.00009614346,0.83267576,0.00226635,0.0037014675,0.0001604903,0.000009638076,0.00012939244,0.029874869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672705,0.000031181266,0.0006602131,0.0014211609,0.00048349166,0.0006769204],"domain_scores_gemma":[0.99792933,0.00023414155,0.0004120599,0.000949343,0.00029338998,0.00018173314],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014889092,0.00041182022,0.00047550237,0.00037249541,0.00041762588,0.0012137609,0.0019091559,0.0002478453,0.000009043845],"category_scores_gemma":[0.000013194763,0.0004132269,0.000100037854,0.00026020766,0.00028832455,0.0009500274,0.0011673919,0.0003215013,0.000028984248],"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.000010196049,0.00004830549,0.000094597905,0.00035552803,0.0000335986,0.000017856863,0.0016786937,0.01335938,0.00028941903,0.6669065,0.00074220495,0.31646374],"study_design_scores_gemma":[0.00033527665,0.00013247074,0.00012773725,0.00095381495,0.0000058451033,0.00005026092,0.000004773391,0.9256983,0.00007188313,0.0054880767,0.06657464,0.0005569706],"about_ca_topic_score_codex":0.00005435486,"about_ca_topic_score_gemma":0.00009374631,"teacher_disagreement_score":0.91233885,"about_ca_system_score_codex":0.00021253162,"about_ca_system_score_gemma":0.000103907114,"threshold_uncertainty_score":0.999832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069471344,0.0000067411493,0.8646619,0.0005227621,0.0020072951,0.0005613256,0.00002132534,0.00014414045,0.06260319],"genre_scores_gemma":[0.99681926,0.0000057475027,0.00080865633,0.0010745241,0.0002324458,0.00011762309,0.000021724238,0.000009187691,0.000910855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840605,0.00002286482,0.00044025586,0.0002914161,0.00052830897,0.00031112658],"domain_scores_gemma":[0.9984883,0.00014825343,0.00027617396,0.00023437891,0.00077129796,0.000081569204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060942787,0.00019144047,0.00021042874,0.00018958688,0.00011744489,0.0003682112,0.00076141424,0.000100083555,0.0000812045],"category_scores_gemma":[0.000033549924,0.00015227907,0.0000561934,0.00016691486,0.00004073648,0.0011377846,0.000036739664,0.00016367469,0.00018509376],"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.00021984956,0.00007083256,0.00027258619,0.000023886916,0.00010283171,0.0000033740978,0.0011883667,0.0019422906,0.00048715877,0.92143387,0.0014295309,0.07282541],"study_design_scores_gemma":[0.012138691,0.002900745,0.010348976,0.0013112217,0.000026313484,0.000154746,0.0010055056,0.83996946,0.015628034,0.01149886,0.103093706,0.001923724],"about_ca_topic_score_codex":0.000018922648,"about_ca_topic_score_gemma":0.000028961695,"teacher_disagreement_score":0.9273479,"about_ca_system_score_codex":0.00009896316,"about_ca_system_score_gemma":0.000078173405,"threshold_uncertainty_score":0.62097603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99322957,0.00028808933,0.0020180948,0.00009809633,0.0027302129,0.00017636605,0.0000021505016,0.000116312316,0.0013411277],"genre_scores_gemma":[0.99898833,0.00007508054,0.00075515336,0.00008358002,0.000010365693,0.000011874641,0.0000016844149,0.000012569666,0.00006135867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984602,0.00015418662,0.00036571934,0.0004206724,0.00028445304,0.00031480528],"domain_scores_gemma":[0.9988807,0.00023519262,0.00015771759,0.00047719092,0.00013997772,0.00010924845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006515918,0.0001764918,0.00030563906,0.0001522524,0.00015663973,0.00011130455,0.00045222734,0.0000834464,0.000014183093],"category_scores_gemma":[0.00004745574,0.0001681612,0.00009964017,0.0004662858,0.00007468099,0.0005176751,0.00019100771,0.00017063596,0.000004928937],"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.000009895683,0.00008203344,0.031576358,0.000019088377,0.00003680229,0.000018257168,0.00054393965,0.00000962883,0.0005822725,0.9651698,0.00032147503,0.0016304508],"study_design_scores_gemma":[0.001797055,0.0005449432,0.038546246,0.00013982457,0.00001617714,0.0001367257,0.00031124716,0.039539378,0.00077708025,0.91554636,0.0021326696,0.0005122765],"about_ca_topic_score_codex":0.00047148016,"about_ca_topic_score_gemma":0.00006718131,"teacher_disagreement_score":0.049623426,"about_ca_system_score_codex":0.0000296341,"about_ca_system_score_gemma":0.000016696536,"threshold_uncertainty_score":0.68574154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030967228,0.0013287684,0.9642467,0.0013508137,0.000019989002,0.0003580334,0.00000482644,0.0003234554,0.0014002213],"genre_scores_gemma":[0.96278393,0.00065664155,0.035593394,0.00018772781,0.00024814656,0.00040985722,0.00002079199,0.0000061117325,0.00009337097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990844,0.000017054941,0.00026652656,0.00030683167,0.00008114416,0.00024401692],"domain_scores_gemma":[0.9995762,0.0000198266,0.000091695234,0.00019462281,0.000054632877,0.00006298273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002190672,0.00012828682,0.00015133207,0.000049492493,0.00032754886,0.00017905723,0.00022566055,0.00008536939,0.0000015820744],"category_scores_gemma":[0.0000015020754,0.00011394821,0.000013326205,0.00035386937,0.000052497635,0.00043066245,0.00011541341,0.0001478591,0.0000029468654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018746287,0.00008292767,0.008968472,0.00015896249,0.0000051686748,0.0000010997346,0.00018877127,0.0072910483,0.000012202436,0.02941077,0.0011803693,0.9526815],"study_design_scores_gemma":[0.00037418865,0.00009150223,0.007977078,0.00022683166,0.0000064997357,0.0001015634,0.000026722564,0.80618554,0.00011665859,0.00278598,0.18174575,0.00036166236],"about_ca_topic_score_codex":0.000012524887,"about_ca_topic_score_gemma":0.000007710743,"teacher_disagreement_score":0.9523198,"about_ca_system_score_codex":0.000027453516,"about_ca_system_score_gemma":0.000022358106,"threshold_uncertainty_score":0.46466735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049550766,0.000015118429,0.84683603,0.0039462335,0.0014001782,0.00022063304,1.6494883e-7,0.00038607453,0.14224051],"genre_scores_gemma":[0.9654234,0.000014744663,0.0030829927,0.0045254743,0.00062841555,0.000029045359,0.0000010837472,0.000013134976,0.026281707],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983074,0.000093307484,0.0003238553,0.00054154923,0.00030000726,0.00043387874],"domain_scores_gemma":[0.99872243,0.000081974205,0.00007030934,0.0008232551,0.000109378656,0.0001926275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045985726,0.0001508639,0.00021145534,0.00015532122,0.00015135697,0.00027423087,0.000752516,0.00008644334,0.00013293857],"category_scores_gemma":[0.00002827897,0.00013531861,0.00010735307,0.00071700074,0.000013874452,0.0002515701,0.00021622448,0.00016370135,0.00076004036],"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.00008045674,0.00030139848,0.0025161651,0.000012276946,0.00014014768,0.00009545579,0.00073429756,0.07282244,0.00021079922,0.39597836,0.42945498,0.09765321],"study_design_scores_gemma":[0.00033868835,0.00024473967,0.0038826044,0.00009047129,0.0000031276697,0.00004774608,0.00005425785,0.7447361,0.00011907763,0.00080594886,0.24934815,0.0003291404],"about_ca_topic_score_codex":0.00014988276,"about_ca_topic_score_gemma":0.00004618242,"teacher_disagreement_score":0.96046835,"about_ca_system_score_codex":0.00005748831,"about_ca_system_score_gemma":0.000012110288,"threshold_uncertainty_score":0.97690344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6154806,0.000036151603,0.36171728,0.000058763686,0.00095622207,0.00016073413,0.0000045728807,0.00008420928,0.021501493],"genre_scores_gemma":[0.9842885,0.0000012312365,0.01494129,0.00015444437,0.000023452876,0.000012650747,0.0000016751884,0.0000065140903,0.00057022105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991244,0.00008885457,0.0003347999,0.0001959057,0.00013747315,0.00011854964],"domain_scores_gemma":[0.99912673,0.00009728559,0.00013996194,0.00043116123,0.00015416744,0.000050709805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021384499,0.00009396029,0.00016664814,0.00016614607,0.000042599862,0.000007926355,0.00028695844,0.000058240745,0.00017835395],"category_scores_gemma":[0.00001744999,0.00007926836,0.000089359986,0.00013508133,0.000057360136,0.00016628116,0.000035790104,0.00007228378,0.000014940284],"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.000065491535,0.0011426387,0.007838402,0.00006435621,0.000047585556,0.00018344777,0.0091106305,0.00023015606,0.0034283027,0.9666321,0.005835839,0.0054210387],"study_design_scores_gemma":[0.00865368,0.013164008,0.117868654,0.0018818945,0.0003651179,0.0024796622,0.009934738,0.38060218,0.4227955,0.018261304,0.019528773,0.0044645024],"about_ca_topic_score_codex":0.0018216126,"about_ca_topic_score_gemma":0.0003052276,"teacher_disagreement_score":0.9483708,"about_ca_system_score_codex":0.00006977313,"about_ca_system_score_gemma":0.00006786452,"threshold_uncertainty_score":0.323247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31266913,0.00056730624,0.64602333,0.0038956292,0.031664558,0.0011618295,0.000012754035,0.0003879208,0.0036175647],"genre_scores_gemma":[0.99818075,0.0000025568188,0.0011183799,0.00031049867,0.000036673377,0.00006067863,0.000005556629,0.0000068753525,0.0002780526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917924,0.00006349419,0.00016531826,0.0001851285,0.00023543162,0.00017137041],"domain_scores_gemma":[0.99909043,0.0002805616,0.00007322204,0.00030082488,0.00018416798,0.00007077556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068276346,0.000082507926,0.0000950872,0.00003605506,0.00027615513,0.00014957067,0.000514993,0.000043712378,0.000005372666],"category_scores_gemma":[0.00003535169,0.000057315985,0.000069652,0.00015083578,0.000022279291,0.00027558213,0.00012955713,0.00008698767,0.000024947276],"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.00000623579,0.000020090813,0.000059434155,0.000003123151,0.000014104792,9.1709853e-7,0.0006705665,0.00031730346,0.000023081273,0.9746296,0.023918675,0.00033689244],"study_design_scores_gemma":[0.0005345544,0.00009508063,0.00017902526,0.0000124525195,0.000003676491,0.000012706898,0.00015068943,0.05938524,0.000079993864,0.9210973,0.018362159,0.00008714611],"about_ca_topic_score_codex":0.000034777488,"about_ca_topic_score_gemma":0.0000069558423,"teacher_disagreement_score":0.6855116,"about_ca_system_score_codex":0.000044107983,"about_ca_system_score_gemma":0.00005139316,"threshold_uncertainty_score":0.23372781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807373,0.00019801996,0.0017885127,0.00017268519,0.0099144345,0.00025750732,0.0000015335416,0.00014364708,0.006786359],"genre_scores_gemma":[0.99964637,0.0000030563328,0.00011913722,0.00006232008,0.000035733225,0.000017892906,0.0000013165626,0.000009776817,0.00010440686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986879,0.00018847283,0.00025902397,0.00026899477,0.00025256156,0.0003430359],"domain_scores_gemma":[0.9987318,0.00019382859,0.00015384764,0.0006589165,0.00014154652,0.000120056204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040846376,0.00014327759,0.0002400229,0.00013437716,0.000101583566,0.000039733713,0.00044205977,0.000064132764,0.000010475182],"category_scores_gemma":[0.00011508277,0.00012699918,0.0000937191,0.0006180646,0.000036237085,0.00038596155,0.00008428317,0.00015606414,0.000039429528],"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.0000068418117,0.00022656698,0.0075136214,0.000011303905,0.000021535825,0.0000014188113,0.00037576642,0.000012282623,0.00040634337,0.98470324,0.0055579864,0.0011630681],"study_design_scores_gemma":[0.0032268213,0.0016323779,0.20540267,0.0002532593,0.000042713826,0.00009415583,0.00013355364,0.009137256,0.04233384,0.72603947,0.010388145,0.0013157334],"about_ca_topic_score_codex":0.000085376254,"about_ca_topic_score_gemma":0.0000040173736,"teacher_disagreement_score":0.25866377,"about_ca_system_score_codex":0.000045108325,"about_ca_system_score_gemma":0.00003321651,"threshold_uncertainty_score":0.5178876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003769422,0.0015647152,0.94435894,0.00009077595,0.00702705,0.0020628374,0.000021887141,0.00011312172,0.04472296],"genre_scores_gemma":[0.9714832,0.000029907289,0.00084651995,0.000046521425,0.0029193456,0.00048311224,0.00003915906,0.000067984656,0.024084304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708474,0.00023585164,0.0012077817,0.0005369351,0.00053287944,0.00040181697],"domain_scores_gemma":[0.99684083,0.0010764175,0.00076492893,0.0009833899,0.00024809357,0.00008634664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021294553,0.00044963136,0.00079740986,0.00030140762,0.00015753377,0.00021815636,0.00081345986,0.000555971,0.000005408841],"category_scores_gemma":[0.000054586217,0.0003011866,0.00028709654,0.00010764488,0.000058901307,0.00018334719,0.00008895649,0.00057423447,0.000025461526],"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.00007149047,0.000021277268,0.0000019683898,0.0002503858,0.00008936804,0.0000025972631,0.0014364669,0.0998846,0.0000214762,0.8799296,0.0014660142,0.016824745],"study_design_scores_gemma":[0.0004336771,0.00032939186,0.000018281065,0.0028440286,0.00004107095,0.00005629662,0.00042157955,0.98516953,0.000049349004,0.00068013585,0.009531342,0.00042530647],"about_ca_topic_score_codex":0.0000801291,"about_ca_topic_score_gemma":0.00017589213,"teacher_disagreement_score":0.97144544,"about_ca_system_score_codex":0.00024842063,"about_ca_system_score_gemma":0.00006303457,"threshold_uncertainty_score":0.99994403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95653594,0.00017287029,0.015352728,0.000447116,0.007682161,0.00019586566,0.000002065135,0.00020275533,0.019408524],"genre_scores_gemma":[0.9992532,0.000017408545,0.00024852031,0.00010178378,0.000013082577,0.000011229126,6.8498076e-7,0.00000857034,0.0003455026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988473,0.00010161476,0.000281621,0.00027745223,0.0002476126,0.0002444192],"domain_scores_gemma":[0.9985686,0.00015104085,0.0001370464,0.0009051744,0.0001619288,0.00007618848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037289405,0.000122053694,0.00023279763,0.00011652806,0.00008643492,0.000059800044,0.000959488,0.00007684369,0.000027298982],"category_scores_gemma":[0.0000756173,0.00011585908,0.00011161027,0.0005819011,0.00004238414,0.00033047365,0.0002111437,0.000115415176,0.000024425002],"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.0000062011336,0.000095196025,0.0035958798,0.0000108352015,0.000020190639,0.000015463813,0.00018893144,0.000030711322,0.00023108102,0.9882073,0.006324807,0.0012734317],"study_design_scores_gemma":[0.0012248924,0.00025389795,0.003809842,0.00007341943,0.0000048652087,0.000077334735,0.000045323435,0.013032168,0.002066691,0.97367394,0.0054840385,0.00025355886],"about_ca_topic_score_codex":0.00008994428,"about_ca_topic_score_gemma":0.000021778838,"teacher_disagreement_score":0.042717304,"about_ca_system_score_codex":0.000028589997,"about_ca_system_score_gemma":0.000030239042,"threshold_uncertainty_score":0.4724596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755393,0.00017052688,0.0043429523,0.00019368881,0.002875231,0.00020145558,8.330328e-7,0.00008739428,0.016588567],"genre_scores_gemma":[0.9985371,0.000015568721,0.00026511305,0.00007494503,0.000012297707,0.000010414769,0.0000012110241,0.000008472328,0.0010748687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873984,0.000115427334,0.0003713464,0.0002776811,0.00022101843,0.00027470491],"domain_scores_gemma":[0.9991677,0.000091912865,0.00012219149,0.00046519915,0.00008707423,0.00006595625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038259802,0.00012582431,0.00025204572,0.00018635383,0.000055376397,0.000071802504,0.0005643901,0.000086016735,0.000044899934],"category_scores_gemma":[0.000023372853,0.00012353883,0.00008949092,0.00073121366,0.00003540753,0.0002772857,0.00011449253,0.00012938834,0.00009105526],"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.000040773866,0.0003772798,0.008618458,0.000022849868,0.00004114876,0.00015153353,0.0016566324,0.00016987382,0.0013786468,0.9733562,0.0069361734,0.007250464],"study_design_scores_gemma":[0.005356,0.0008227617,0.013288823,0.00036236562,0.000011144952,0.00029183007,0.00011755116,0.17272078,0.0018687461,0.7819106,0.022322988,0.00092642126],"about_ca_topic_score_codex":0.0001424206,"about_ca_topic_score_gemma":0.000028522827,"teacher_disagreement_score":0.19144557,"about_ca_system_score_codex":0.000048168036,"about_ca_system_score_gemma":0.000038149297,"threshold_uncertainty_score":0.5037767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75536555,0.0010505295,0.14883257,0.009461492,0.00642896,0.0033048247,0.000006710687,0.000416135,0.07513325],"genre_scores_gemma":[0.9970475,0.000022315611,0.001648421,0.00015411108,0.00018967467,0.0000543605,1.313168e-7,0.00000543724,0.00087808224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937576,0.00002298309,0.00020056029,0.00015603293,0.00011414995,0.0001305423],"domain_scores_gemma":[0.99901116,0.00022591416,0.00011857726,0.0005076605,0.000108898676,0.000027771013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022457367,0.00007616912,0.00012433251,0.00003891628,0.0003418055,0.000065085245,0.0010385747,0.0000387013,2.1890506e-7],"category_scores_gemma":[0.000014055418,0.000046196536,0.000053317344,0.00015409579,0.000071871524,0.000038877835,0.00020479507,0.000086160704,4.9164356e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044380184,0.00017340014,0.012801488,0.0002852604,0.0001464261,5.504206e-7,0.011007472,0.014418223,0.0056908177,0.8887442,0.06340422,0.0032836027],"study_design_scores_gemma":[0.00053082523,0.00033400953,0.0022897702,0.00044855627,0.000012394226,0.00025550683,0.0002954141,0.95454216,0.0019647318,0.0019288283,0.03711364,0.00028418616],"about_ca_topic_score_codex":0.00004927633,"about_ca_topic_score_gemma":0.000012040423,"teacher_disagreement_score":0.9401239,"about_ca_system_score_codex":0.000013914157,"about_ca_system_score_gemma":0.000013453201,"threshold_uncertainty_score":0.26289263},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008936372,0.000120124365,0.4995774,0.0002075979,0.00166475,0.00020879463,0.0000016084421,0.000568707,0.49764207],"genre_scores_gemma":[0.011148335,0.00010781638,0.00488674,0.00080326013,0.0012824114,0.000042263775,0.000008040124,0.0002318907,0.98148924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834335,0.00010007669,0.00027234288,0.0006681423,0.00029116316,0.0003249535],"domain_scores_gemma":[0.9987762,0.00004827126,0.00022364351,0.0007868514,0.000073895986,0.000091145856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011957421,0.0003577087,0.00039450338,0.00034609853,0.00008357707,0.0001936132,0.0006254991,0.00030908769,0.0007729894],"category_scores_gemma":[0.000006570813,0.00025250815,0.0001234346,0.00023647053,0.00005180766,0.00019252063,0.00014565894,0.00024981212,0.00071320916],"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.000006234206,0.00002328471,0.000040908748,0.00002255656,0.000079964215,0.000027085951,0.00020296362,0.000044021126,0.000001733644,0.0057263155,0.99091756,0.0029073562],"study_design_scores_gemma":[0.00040252408,0.00021000918,0.000022731814,0.00034071563,0.000008707426,0.00066788186,0.000049247974,0.018021015,0.000054181222,0.00003361363,0.9797165,0.00047287586],"about_ca_topic_score_codex":0.0010791839,"about_ca_topic_score_gemma":0.0021735514,"teacher_disagreement_score":0.49469066,"about_ca_system_score_codex":0.00007706381,"about_ca_system_score_gemma":0.00005125563,"threshold_uncertainty_score":0.9999927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.423691,0.000070085705,0.18067546,0.0007038309,0.0011666896,0.00014652587,3.3412178e-7,0.00018023481,0.39336586],"genre_scores_gemma":[0.9889611,0.000008790794,0.0010110689,0.00024201382,0.00007899817,0.0000062001855,9.164126e-8,0.000002747892,0.009688998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942464,0.00001285732,0.00015346451,0.00014212613,0.00014583186,0.00012109706],"domain_scores_gemma":[0.9995989,0.000019706138,0.000052924177,0.0002396694,0.00006137914,0.000027399432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010620994,0.000057683512,0.00008847928,0.00004542042,0.000055851237,0.000045434423,0.00030071117,0.000028170396,0.00012796345],"category_scores_gemma":[0.0000053721405,0.0000423466,0.000031306445,0.00018245785,0.000013831984,0.00020881968,0.000025496125,0.000051797593,0.00015682631],"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.00003606403,0.0007748088,0.006159299,0.00036453793,0.00008064013,0.00001020225,0.0075279293,0.010612409,0.0021791847,0.66414976,0.14255875,0.16554643],"study_design_scores_gemma":[0.0001375482,0.00034275372,0.00027356006,0.000042877975,7.4369024e-7,0.000011985901,0.00001857582,0.9796304,0.004640879,0.00008206544,0.014726575,0.000092036455],"about_ca_topic_score_codex":0.0000055883793,"about_ca_topic_score_gemma":0.0000030781318,"teacher_disagreement_score":0.969018,"about_ca_system_score_codex":0.000011669565,"about_ca_system_score_gemma":0.0000048899233,"threshold_uncertainty_score":0.20157373},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3223753e-7,0.00070944085,0.5646411,0.000022116325,0.0003490872,0.0012500387,0.000008877528,0.00023205996,0.43278694],"genre_scores_gemma":[0.0011207196,0.000012026815,0.030054016,0.0001070983,0.0015008018,0.0019942783,0.000048073318,0.00007199235,0.965091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99755144,0.0000675505,0.0006130128,0.00094312703,0.00035902258,0.00046585998],"domain_scores_gemma":[0.9977749,0.00009213473,0.00065336475,0.0009819153,0.0003675754,0.00013009198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027984453,0.00043656488,0.0005846917,0.00013786386,0.00028896975,0.0005617109,0.0013523966,0.0004853065,0.000002125482],"category_scores_gemma":[0.000011647151,0.00039695413,0.00025555436,0.000029938408,0.00006409684,0.00018500931,0.00022354734,0.0003459646,0.000013611073],"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.00007468435,0.00008323684,0.0000012134886,0.0025489538,0.00025153326,0.000025473022,0.0031460845,0.0044033914,0.000016038057,0.770083,0.16393387,0.055432513],"study_design_scores_gemma":[0.00046388325,0.00005233805,4.3005116e-7,0.00041603422,0.000034434262,0.000107011656,0.0000126521745,0.31276357,0.000008730075,0.0028938437,0.6828157,0.00043141548],"about_ca_topic_score_codex":0.000030626787,"about_ca_topic_score_gemma":0.0000051659213,"teacher_disagreement_score":0.76718915,"about_ca_system_score_codex":0.00019747087,"about_ca_system_score_gemma":0.00029374548,"threshold_uncertainty_score":0.99984825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012761212,0.0046425886,0.6830324,0.00003840992,0.00024698672,0.00047013006,0.0000017491237,0.0001127274,0.31144223],"genre_scores_gemma":[0.7822615,0.0020068015,0.0013357943,0.000493455,0.0062635895,0.00035468716,0.000020540072,0.00009968046,0.20716396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842334,0.0000861736,0.000553278,0.00048438666,0.00015616349,0.00029665537],"domain_scores_gemma":[0.99843353,0.00022687328,0.00044840015,0.0006807448,0.00013050668,0.000079925674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009105737,0.00028214534,0.00041394017,0.00006499734,0.0003913839,0.00010806109,0.00055121485,0.00030091818,0.00003236571],"category_scores_gemma":[0.0000058649844,0.00024947582,0.00013684662,0.00011778082,0.00014234423,0.00011467029,0.00025355266,0.00038150983,0.000014240254],"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.000009381012,0.000008105645,0.000008902305,0.000024522973,0.000056215853,0.0000010149021,0.00008057437,0.0063345646,0.0000047302105,0.9509555,0.00056554185,0.04195091],"study_design_scores_gemma":[0.0002111476,0.00006560405,0.000006097818,0.0014386848,0.000085530744,0.00009547095,0.000038273283,0.07473121,0.000018794655,0.3868297,0.5358154,0.0006640881],"about_ca_topic_score_codex":0.000004113717,"about_ca_topic_score_gemma":0.0000072625917,"teacher_disagreement_score":0.78224874,"about_ca_system_score_codex":0.000024781782,"about_ca_system_score_gemma":0.000031757143,"threshold_uncertainty_score":0.99999577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042857882,0.0003665802,0.9863685,0.00037791362,0.0045842165,0.00035127602,0.0000042342176,0.00013031681,0.0073883934],"genre_scores_gemma":[0.95515597,0.000026263595,0.043419186,0.0007151502,0.0003884104,0.000006873354,0.0000019211916,0.000029237784,0.00025699564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964,0.000056524106,0.00069560326,0.0013675436,0.0008906932,0.0005896261],"domain_scores_gemma":[0.99707735,0.00047647356,0.00045636142,0.0014476212,0.00038939415,0.0001528222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010996973,0.00049748435,0.00073469494,0.0008865756,0.00020788284,0.00028327288,0.0026540456,0.00040646584,0.000039171642],"category_scores_gemma":[0.000050292347,0.00044501774,0.00026019925,0.00076152786,0.00072392815,0.000533382,0.0008486234,0.00075315085,0.000028024611],"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.000006654376,0.00004909598,0.00006063463,0.000068691326,0.000027386484,0.000038108446,0.0006727172,0.116324015,0.0001659143,0.76661056,0.000034392226,0.115941815],"study_design_scores_gemma":[0.00042895295,0.00029729816,0.00023560894,0.00082589505,0.000008768571,0.00012329519,4.1814374e-7,0.17456485,0.0018478791,0.82034487,0.0005914832,0.0007306595],"about_ca_topic_score_codex":0.00010279456,"about_ca_topic_score_gemma":0.0002104488,"teacher_disagreement_score":0.9547274,"about_ca_system_score_codex":0.00036473607,"about_ca_system_score_gemma":0.00064901484,"threshold_uncertainty_score":0.99980015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033443917,0.000030562947,0.95516485,0.0002126674,0.00095786556,0.0004563277,0.0000025439015,0.0003388855,0.009392388],"genre_scores_gemma":[0.9835695,0.000002901355,0.013784399,0.0006803708,0.00016317604,0.00012965592,0.0000016874917,0.000015641734,0.0016526908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867725,0.000009661673,0.00034565546,0.00037840876,0.00021424095,0.00037480175],"domain_scores_gemma":[0.999132,0.000071500894,0.00009438849,0.00048781725,0.000115671784,0.00009861625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043956697,0.00018290484,0.00023369533,0.0000920435,0.00024252528,0.00017279506,0.00057746883,0.00009269518,0.000004909904],"category_scores_gemma":[0.000014227225,0.00013061399,0.00013070079,0.00014414168,0.000031848263,0.00040150448,0.000058981284,0.00011236365,0.00010434537],"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.00001959108,0.000017975284,0.000008221141,0.000060055823,0.000009288351,0.0000010638255,0.0005677825,0.25515038,0.0000054218353,0.7408966,0.00032773236,0.0029359027],"study_design_scores_gemma":[0.00083576114,0.000266351,0.0000045458787,0.00021378999,0.0000032087187,0.000049869977,0.00014016884,0.9895272,0.0005010001,0.008102973,0.00015964132,0.00019547722],"about_ca_topic_score_codex":0.000021379088,"about_ca_topic_score_gemma":0.00003028832,"teacher_disagreement_score":0.9501256,"about_ca_system_score_codex":0.00017069046,"about_ca_system_score_gemma":0.00007413456,"threshold_uncertainty_score":0.5326284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090021867,0.0004659244,0.9846892,0.00014768595,0.004013488,0.0004536519,0.0000024857645,0.00018558251,0.009141768],"genre_scores_gemma":[0.9172957,0.00018136876,0.07947992,0.001352436,0.00068112736,0.00003692073,0.000005325387,0.000066900866,0.0009003084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604625,0.00007791517,0.0007838988,0.0015780978,0.00075557886,0.0007582865],"domain_scores_gemma":[0.99756455,0.00031242595,0.00033669182,0.0013991613,0.00021505532,0.00017213008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007734988,0.0005347751,0.0006199698,0.001647294,0.00018170702,0.00044447853,0.0032204583,0.0004509426,0.000026935299],"category_scores_gemma":[0.000049386064,0.00048091388,0.00016460307,0.0011569372,0.00040400273,0.0006213492,0.00065717037,0.00097359973,0.000059927053],"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.000029929413,0.00011154306,0.00086307526,0.00008453854,0.000030713036,0.0005993863,0.0053307326,0.028408578,0.00019178735,0.2854313,0.0002467396,0.6786717],"study_design_scores_gemma":[0.00064671773,0.00038051678,0.00205243,0.0013870285,0.0000070127767,0.00020036372,5.366383e-7,0.528683,0.0006597259,0.45921588,0.0052897353,0.0014770678],"about_ca_topic_score_codex":0.00023763147,"about_ca_topic_score_gemma":0.0006742394,"teacher_disagreement_score":0.9163955,"about_ca_system_score_codex":0.00028988684,"about_ca_system_score_gemma":0.0003053405,"threshold_uncertainty_score":0.99976426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002050755,0.00027578443,0.97658753,0.00009703561,0.0020955263,0.0003289497,0.000001772465,0.0000708286,0.020337483],"genre_scores_gemma":[0.95857537,0.000009429489,0.03735551,0.0004545946,0.0019477513,0.000010733489,0.0000011402637,0.000041602405,0.0016038436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973269,0.00007416649,0.0005746915,0.00092897995,0.00051920995,0.0005760324],"domain_scores_gemma":[0.9976087,0.0004946758,0.00038964688,0.0012293359,0.00018316045,0.00009444675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007140959,0.00039440158,0.00051540957,0.00015373313,0.00032690424,0.00027905265,0.0027521157,0.0002114713,0.000047953326],"category_scores_gemma":[0.000028039498,0.00025597523,0.00014372256,0.00066968333,0.0006464362,0.00021955853,0.00072157866,0.0005763998,0.000038533366],"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.000019001136,0.000030349715,0.0001068762,0.00004095937,0.000024622024,0.000033936987,0.0012496515,0.39927393,0.000027898175,0.012844095,0.00010182647,0.58624685],"study_design_scores_gemma":[0.00018320173,0.00022579181,0.000052871783,0.0013476105,0.000011484917,0.00020748825,7.666308e-8,0.974153,0.00014786853,0.018134106,0.0051275254,0.00040899386],"about_ca_topic_score_codex":0.000014185938,"about_ca_topic_score_gemma":0.000070077476,"teacher_disagreement_score":0.9583703,"about_ca_system_score_codex":0.00011583231,"about_ca_system_score_gemma":0.00047449642,"threshold_uncertainty_score":0.9999893},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015145048,0.0032519295,0.9199227,0.00011925077,0.006559073,0.000265458,0.000003470617,0.0001614075,0.069715165],"genre_scores_gemma":[0.072017394,0.0049520326,0.67268085,0.0036902907,0.010691509,0.00020544788,0.00006802117,0.00030976048,0.23538472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975733,0.00003644024,0.000868081,0.0007362085,0.00038690833,0.00039905525],"domain_scores_gemma":[0.9981186,0.000653163,0.00029496188,0.00043930302,0.0004195751,0.00007439778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005073506,0.00045034406,0.0006228617,0.00025511993,0.0001254821,0.00007162795,0.0009107905,0.00021665306,0.00007372105],"category_scores_gemma":[0.000029544695,0.00045244416,0.00019267741,0.00016622254,0.00013717086,0.00021704534,0.00068777154,0.000554251,0.00033254642],"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.0000027243295,0.000006270453,0.0000043613827,0.000041507057,0.00010426829,0.00005881026,0.00048731532,0.4029158,1.6260364e-8,0.58109546,0.008990062,0.006293424],"study_design_scores_gemma":[0.00006582762,0.00011427147,0.000016510676,0.0014464612,0.000012089168,0.00009815337,0.000017395305,0.50764555,0.0000013856816,0.4006054,0.08932991,0.00064704166],"about_ca_topic_score_codex":0.000012656359,"about_ca_topic_score_gemma":0.000023827115,"teacher_disagreement_score":0.2472419,"about_ca_system_score_codex":0.00023823026,"about_ca_system_score_gemma":0.000067250534,"threshold_uncertainty_score":0.99979275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052175457,0.0009148967,0.90728,0.00042811272,0.08336925,0.00071936584,0.0000014635374,0.0003250573,0.0017442808],"genre_scores_gemma":[0.6764759,0.00026263215,0.06190371,0.0032482785,0.24960834,0.00045710208,0.00012488087,0.000091887116,0.007827306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969175,0.00040981325,0.0008623041,0.0008478813,0.0004112763,0.0005512394],"domain_scores_gemma":[0.9986616,0.000032881988,0.00014378584,0.0009030282,0.000113516806,0.00014522807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005279992,0.00036581414,0.00041880022,0.00025689902,0.00020700031,0.00094575516,0.00084979687,0.00023495867,0.000056426998],"category_scores_gemma":[5.560369e-7,0.00032777648,0.00013171697,0.00065428426,0.000015529626,0.0006118887,0.00014817281,0.0002698186,0.00017934098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012258928,0.00010366249,0.0001365684,0.000029761242,0.00008171595,0.00009355842,0.0007531568,0.5476898,0.000007410929,0.020483272,0.23451427,0.19609456],"study_design_scores_gemma":[0.00060112344,0.000047497146,0.0006269289,0.000055920962,0.000003784546,0.00006318761,0.000017677756,0.7169805,0.0000036469337,0.0000024516692,0.2813181,0.00027919037],"about_ca_topic_score_codex":0.000086411055,"about_ca_topic_score_gemma":0.00006652551,"teacher_disagreement_score":0.8453763,"about_ca_system_score_codex":0.00016893567,"about_ca_system_score_gemma":0.000018279532,"threshold_uncertainty_score":0.99991745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081156415,0.00019877343,0.96990865,0.0015288319,0.0015612998,0.00026720465,9.865015e-7,0.00028395496,0.025438756],"genre_scores_gemma":[0.95251197,0.000011628796,0.026112808,0.0022066487,0.00083275704,0.00009542195,7.9242716e-7,0.000016438384,0.018211534],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886096,0.00003794136,0.0002534896,0.00034351266,0.0001362024,0.00036788706],"domain_scores_gemma":[0.9989103,0.00011706281,0.000051251707,0.00074117735,0.00008779616,0.00009242855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021198229,0.00013091468,0.00016671026,0.000048834292,0.00015953551,0.000237237,0.00086618756,0.000094850395,0.00018946214],"category_scores_gemma":[0.00002150711,0.00010574603,0.00013235644,0.00018890858,0.000014644853,0.00033725146,0.00016909861,0.00008979024,0.0001229397],"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.000007753991,0.00009921248,0.00028680806,0.00001285292,0.000047634898,0.000008207246,0.00042161535,0.0077522113,0.00003217802,0.15723123,0.7794763,0.054624006],"study_design_scores_gemma":[0.00040642908,0.00008193722,0.000060140235,0.0000111336285,0.0000029268444,0.0000344716,0.000016817612,0.91153264,0.00003249325,0.001109144,0.08655622,0.00015565552],"about_ca_topic_score_codex":0.000032876287,"about_ca_topic_score_gemma":0.000059360173,"teacher_disagreement_score":0.9517004,"about_ca_system_score_codex":0.000032341,"about_ca_system_score_gemma":0.000004605167,"threshold_uncertainty_score":0.4312198},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034758598,0.00010267684,0.99076813,0.0004385712,0.003564209,0.0005369781,0.0000013065152,0.0004982708,0.0006139912],"genre_scores_gemma":[0.6938377,0.0000010362971,0.30212313,0.0020594567,0.0017355635,0.000019045041,0.000007888421,0.000031914537,0.00018425428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736565,0.00016146616,0.0006678608,0.0007419864,0.00023981553,0.00082322437],"domain_scores_gemma":[0.99797535,0.0007480803,0.00024459726,0.000616124,0.00024914954,0.00016667272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009317493,0.0003146659,0.00039689118,0.00014498134,0.0005671788,0.00058337714,0.0008823774,0.00015516835,0.0000057807533],"category_scores_gemma":[0.000044263787,0.00029850422,0.00024734103,0.00044023324,0.0000366705,0.00028038328,0.00036841538,0.0002815187,0.000025792333],"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.000014295917,0.00009819967,0.00064958475,0.00002354946,0.000042161737,0.000035557037,0.00052579626,0.3872621,0.00001169828,0.001579364,0.0029457733,0.60681194],"study_design_scores_gemma":[0.0012209398,0.000097100776,0.00020473245,0.00016558557,0.000009794255,0.000119489414,0.000035831916,0.98964643,0.000017288676,0.00010518832,0.008002935,0.00037466217],"about_ca_topic_score_codex":0.000028194348,"about_ca_topic_score_gemma":0.000007054786,"teacher_disagreement_score":0.69036186,"about_ca_system_score_codex":0.000109205175,"about_ca_system_score_gemma":0.000043193246,"threshold_uncertainty_score":0.9999467},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21685535,0.000027893966,0.7784699,0.00026983224,0.00015049143,0.000067209025,7.181843e-7,0.000028799554,0.0041298056],"genre_scores_gemma":[0.9985313,0.000005071611,0.0002764685,0.000091275055,0.000027259837,0.0000015660789,2.9567582e-7,0.0000016933392,0.0010650672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994184,0.000055737215,0.00016988257,0.00014427377,0.000129636,0.00008210381],"domain_scores_gemma":[0.99945307,0.00007146581,0.0000710987,0.000312081,0.00006814976,0.000024111141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000125668,0.00005393768,0.00011755728,0.000065483364,0.00006900656,0.00006069778,0.00020436979,0.00003278131,0.00007154946],"category_scores_gemma":[0.000011613939,0.000032030704,0.00007553625,0.0005861912,0.000015186224,0.00012621858,0.00007304166,0.000036908277,0.000003639092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012259989,0.00021244466,0.280476,0.000041221454,0.0009957715,0.0000025758675,0.007918702,0.49090016,0.0008382411,0.035901893,0.0039886134,0.1787121],"study_design_scores_gemma":[0.00008802341,0.00001488589,0.012624247,0.0000041727003,0.0000195925,0.0000015343338,0.000034775698,0.98657566,0.00020782683,0.00016024493,0.00022559639,0.000043450345],"about_ca_topic_score_codex":0.00010128627,"about_ca_topic_score_gemma":0.00023614807,"teacher_disagreement_score":0.78167593,"about_ca_system_score_codex":0.000007978701,"about_ca_system_score_gemma":0.000002239186,"threshold_uncertainty_score":0.13061742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593073,0.00036637453,0.004000911,0.00046550776,0.010909784,0.00040034662,0.0000011023103,0.00036621664,0.02418244],"genre_scores_gemma":[0.99874294,0.00003999215,0.00026987915,0.00025647882,0.0000531143,0.00005221168,0.000004600389,0.000022305827,0.00055847474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763745,0.00022768842,0.0005654632,0.0006612368,0.00029349138,0.0006146692],"domain_scores_gemma":[0.99846447,0.00021998433,0.00016635288,0.00082197745,0.00016855069,0.00015869025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007711574,0.00025364914,0.0004026286,0.00033725915,0.0001753567,0.0002619946,0.0009002996,0.0001597087,0.000054282984],"category_scores_gemma":[0.00009758094,0.00025508925,0.00012549726,0.001442799,0.00004363213,0.0005504118,0.0001951611,0.00034218843,0.00013639746],"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.00003918079,0.00016110163,0.007525999,0.000008185904,0.000024282406,0.00016442622,0.0014383083,0.000058127123,0.0003153402,0.9824718,0.00460679,0.0031864077],"study_design_scores_gemma":[0.008202746,0.0011081297,0.032406755,0.00051076786,0.000018785508,0.00041299014,0.0013001584,0.073726706,0.0019109302,0.82650155,0.052159872,0.0017406213],"about_ca_topic_score_codex":0.00032125297,"about_ca_topic_score_gemma":0.00012778946,"teacher_disagreement_score":0.1559703,"about_ca_system_score_codex":0.00013935102,"about_ca_system_score_gemma":0.000083693216,"threshold_uncertainty_score":0.9999901},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044740213,0.0007774293,0.97223663,0.0012196414,0.0010547015,0.00026739188,4.5684652e-7,0.00019930948,0.023797035],"genre_scores_gemma":[0.95831734,0.00006868408,0.021321353,0.0017633517,0.0008248037,0.000060695,0.0000013403904,0.000015071007,0.017627362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989842,0.00003623995,0.00021868417,0.00032171703,0.00011392854,0.00032519925],"domain_scores_gemma":[0.99928856,0.00012435798,0.000052971984,0.00038417912,0.00006585314,0.000084060375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018734079,0.00012597088,0.00015456969,0.000057305126,0.0001328405,0.00022465587,0.00042738425,0.00008678266,0.000085291766],"category_scores_gemma":[0.000009700264,0.00009531477,0.00011695637,0.00022192168,0.000013956262,0.00014561256,0.000058165948,0.000113036964,0.00003492715],"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.000017927712,0.0001356937,0.00031399317,0.000037996928,0.00007750949,0.0000119134675,0.0014661058,0.03835113,0.000098926714,0.12658514,0.1595355,0.67336816],"study_design_scores_gemma":[0.00027826094,0.00007318325,0.000037445338,0.0000145415315,0.0000019913844,0.000039153547,0.000009298543,0.7672225,0.000038855065,0.00069208036,0.23146288,0.000129784],"about_ca_topic_score_codex":0.000013126402,"about_ca_topic_score_gemma":0.00006483291,"teacher_disagreement_score":0.95786995,"about_ca_system_score_codex":0.000016746104,"about_ca_system_score_gemma":0.000003881696,"threshold_uncertainty_score":0.38868234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0928997,0.000019460605,0.83899665,0.011656174,0.0023066052,0.00023062053,0.0000052695395,0.0003414578,0.053544085],"genre_scores_gemma":[0.986683,0.0000062075915,0.0064369277,0.0019097608,0.0008634157,0.00003342371,0.000004542513,0.000024394605,0.0040383213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810255,0.000060714396,0.00038391334,0.00054975954,0.0005887783,0.00031429098],"domain_scores_gemma":[0.99897605,0.00013005934,0.00017668585,0.00045498947,0.0001491606,0.00011303985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032925422,0.0002395785,0.00018933616,0.0001461319,0.00016562526,0.00052920944,0.0010781585,0.000073752744,0.00011266902],"category_scores_gemma":[0.000016015321,0.00018821645,0.00010697793,0.00016225447,0.000016807919,0.0008693744,0.0001796575,0.00031083738,0.00029890274],"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.0006364442,0.0010819038,0.0070858984,0.000048052552,0.000815599,0.00044495697,0.017685505,0.06384076,0.044764888,0.7038962,0.010371853,0.1493279],"study_design_scores_gemma":[0.002000113,0.0004583148,0.0009359206,0.00042571683,0.000011267237,0.00038244657,0.0002243907,0.6527597,0.005921971,0.000340287,0.3357357,0.00080419483],"about_ca_topic_score_codex":0.00017518882,"about_ca_topic_score_gemma":0.00020045812,"teacher_disagreement_score":0.89378333,"about_ca_system_score_codex":0.000295423,"about_ca_system_score_gemma":0.000025718251,"threshold_uncertainty_score":0.7675244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6803996,0.000056777088,0.21015957,0.00008617702,0.0019337831,0.00027237288,0.000004802031,0.00031458752,0.10677233],"genre_scores_gemma":[0.9944492,0.000011196109,0.0009563215,0.00002964193,0.000033956178,3.2430987e-7,0.0000012455567,0.000005005427,0.00451311],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923575,0.00009143862,0.00013976602,0.00024069619,0.00012670613,0.00016563741],"domain_scores_gemma":[0.9993798,0.000030081796,0.000102855774,0.00030928646,0.00010912786,0.00006885626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012553546,0.00009431554,0.0001457476,0.00030118466,0.00010908417,0.000016729597,0.0005255899,0.00008415045,0.00010270288],"category_scores_gemma":[0.0000060900256,0.00010119434,0.00009266682,0.00084118516,0.000039298808,0.00037880221,0.00008253022,0.000091358124,0.000036764373],"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.00053580175,0.0012567785,0.36389557,0.00016539698,0.000515979,0.0005522883,0.0029947476,0.0052422183,0.00009110238,0.29733422,0.2888596,0.03855629],"study_design_scores_gemma":[0.0047892877,0.0020357275,0.009026884,0.00025965713,0.00012555468,3.3421836e-7,0.02657385,0.19776335,0.02237545,0.0013198485,0.73409116,0.0016388841],"about_ca_topic_score_codex":0.00023770382,"about_ca_topic_score_gemma":0.008426324,"teacher_disagreement_score":0.44523156,"about_ca_system_score_codex":0.0000608535,"about_ca_system_score_gemma":0.000042581785,"threshold_uncertainty_score":0.4702087},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067953006,0.010580896,0.0054813633,0.0014899097,0.0014650649,0.00058428705,0.000004550285,0.00019099769,0.98013496],"genre_scores_gemma":[0.043374866,0.0014063556,0.0035451076,0.0010974908,0.00038950148,0.00014186339,0.00002818046,0.00011824379,0.94989836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964172,0.0002460434,0.001290251,0.00092010247,0.0005470892,0.0005792673],"domain_scores_gemma":[0.9973473,0.00045246497,0.0008972447,0.001054739,0.0001177279,0.0001305358],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019277877,0.0005567732,0.0008195225,0.00061000494,0.00030361212,0.00060058315,0.002006126,0.0009579452,0.00010484703],"category_scores_gemma":[0.000113695314,0.00055321475,0.00019612757,0.00007731453,0.00022810893,0.0026850859,0.0004506939,0.0025295885,0.00010475754],"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.000019585856,0.000019185836,0.000037638358,0.00007578251,0.000416771,0.000026438234,0.010156837,0.00032181872,0.00014431152,0.8644945,0.07121578,0.053071376],"study_design_scores_gemma":[0.0006475584,0.00007259032,0.000016929353,0.0023918229,0.000045267792,0.00004109389,0.0009685742,0.0057106754,0.000096566844,0.09215807,0.8968147,0.0010361284],"about_ca_topic_score_codex":0.000045962588,"about_ca_topic_score_gemma":0.000060442173,"teacher_disagreement_score":0.82559896,"about_ca_system_score_codex":0.00095973536,"about_ca_system_score_gemma":0.000122032754,"threshold_uncertainty_score":0.9997716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019050322,0.00011051233,0.9435964,0.000012723804,0.00070084236,0.000086191125,2.61345e-7,0.00018547202,0.036257222],"genre_scores_gemma":[0.9932633,0.000002232961,0.006194057,0.000041704447,0.000039811624,0.000009595294,6.7728513e-7,0.000005564888,0.00044304132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986255,0.00021599817,0.00046917883,0.00029785148,0.00015681621,0.00023462558],"domain_scores_gemma":[0.9989401,0.00011786623,0.00015868628,0.00054620137,0.00016586535,0.0000712663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006129624,0.00011771694,0.00033931705,0.00028014596,0.000064985215,0.00008826821,0.00042403187,0.00006906224,0.000050571573],"category_scores_gemma":[0.000027138649,0.000095237905,0.00022700711,0.0017521452,0.000014663212,0.0002141306,0.00006208829,0.0000824945,0.000013053499],"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.0000031833383,0.00002804997,0.0027934387,0.000024192552,0.00058557687,0.000010837341,0.00031314732,0.08288831,0.00005918282,0.912233,0.00033575424,0.0007253469],"study_design_scores_gemma":[0.00015334265,0.0000374168,0.00021695544,0.00003998854,0.000056423232,0.000039141138,0.00028749905,0.9979897,0.00037173685,0.000048870967,0.00063377025,0.0001251364],"about_ca_topic_score_codex":0.00012869047,"about_ca_topic_score_gemma":0.00013135982,"teacher_disagreement_score":0.974213,"about_ca_system_score_codex":0.000053193617,"about_ca_system_score_gemma":0.00001726614,"threshold_uncertainty_score":0.3883689},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011591047,0.000064374806,0.9956487,0.0003151483,0.0014109424,0.00030649846,0.0000019694555,0.00020974263,0.0019267349],"genre_scores_gemma":[0.75114805,0.000012066018,0.20336574,0.00079990266,0.0005401017,0.00022567941,0.000002423424,0.000019582094,0.043886464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902123,0.000023745906,0.0002314424,0.0003086098,0.00014957348,0.00026540295],"domain_scores_gemma":[0.99953735,0.000033667784,0.000055361346,0.00022529284,0.000065064334,0.000083278304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020490398,0.00011124834,0.00013848243,0.00005465919,0.00011648082,0.00012772804,0.00029160458,0.000056016062,0.00010136101],"category_scores_gemma":[0.0000042246543,0.0000893743,0.00010696541,0.0001220689,0.000010639946,0.00018869645,0.000045165205,0.000054149197,0.00011285213],"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.0000011818415,0.00032255618,0.0000034465427,0.0000105247955,0.000045997713,0.000013054365,0.0012863162,0.00867805,0.000018923054,0.003855062,0.07839117,0.9073737],"study_design_scores_gemma":[0.00042058225,0.00011429751,0.0000071442096,0.000009040311,0.0000019402987,0.000027668244,0.00008446803,0.9798343,0.000083507955,0.000019961197,0.019267498,0.00012954805],"about_ca_topic_score_codex":0.000009093557,"about_ca_topic_score_gemma":0.000013436346,"teacher_disagreement_score":0.9711563,"about_ca_system_score_codex":0.00004035958,"about_ca_system_score_gemma":0.000006201973,"threshold_uncertainty_score":0.3644578},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016936719,0.0008577305,0.9410951,0.00068580825,0.0022157193,0.00012320527,1.2491357e-7,0.0004964637,0.052832186],"genre_scores_gemma":[0.9762097,0.000038816645,0.015918033,0.0014845345,0.0013221747,0.000017471755,6.598622e-7,0.00001698804,0.0049916385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980339,0.00009759736,0.00036475973,0.00044577202,0.00025531312,0.0008026989],"domain_scores_gemma":[0.9989938,0.00010527569,0.0001571013,0.00055497186,0.00006105041,0.00012778371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228017,0.0001882567,0.00023606292,0.000059084014,0.00041748493,0.0003542909,0.0006588312,0.00012153592,0.0004528442],"category_scores_gemma":[0.000016615988,0.00016163143,0.00014045156,0.00054212945,0.000014941248,0.0005265186,0.0002968748,0.00025982605,0.0001465738],"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.0000037623706,0.000103535305,0.014954593,0.0000165576,0.00010406969,0.000055331326,0.00096630544,0.07595698,0.00002763628,0.64238715,0.2464674,0.018956663],"study_design_scores_gemma":[0.00020116495,0.00002255971,0.00011919027,0.000046225214,0.0000018172868,0.000034643566,0.000054782297,0.9507793,0.000014805943,0.0004013203,0.048110444,0.00021372325],"about_ca_topic_score_codex":0.00002155732,"about_ca_topic_score_gemma":0.000037108923,"teacher_disagreement_score":0.97451603,"about_ca_system_score_codex":0.000037073132,"about_ca_system_score_gemma":0.0000057344173,"threshold_uncertainty_score":0.6591138},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05738777,0.000020061512,0.9399069,0.00013550301,0.0002917487,0.00019724232,1.342849e-7,0.000018554181,0.0020420856],"genre_scores_gemma":[0.9777892,0.0000026520433,0.02163292,0.00008933652,0.000010386662,0.000008481606,6.032996e-8,0.000002145883,0.00046481457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942666,0.00010792777,0.00014709539,0.000121371755,0.00009294149,0.00010399796],"domain_scores_gemma":[0.9996329,0.000056861474,0.000052985255,0.000184396,0.00005149734,0.000021374826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003260586,0.000046637877,0.0000674826,0.000016535627,0.00006808392,0.00004879776,0.00013873306,0.00001885145,0.000051156745],"category_scores_gemma":[0.000008342513,0.000028811002,0.000019028816,0.00013827751,0.0000131774295,0.00012329605,0.000031825508,0.000028762754,0.0000040393224],"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.00001390697,0.000105349856,0.032802638,0.00006048583,0.0000787491,0.0000024710075,0.0047256523,0.0041665356,0.051737092,0.8484902,0.013351539,0.044465415],"study_design_scores_gemma":[0.0017943671,0.00021248028,0.015916644,0.000051020303,0.000010717374,0.00008037652,0.0014006827,0.6823511,0.28775415,0.0039940677,0.0061255465,0.00030882584],"about_ca_topic_score_codex":0.000068906884,"about_ca_topic_score_gemma":0.000028082644,"teacher_disagreement_score":0.92040145,"about_ca_system_score_codex":0.0000104652145,"about_ca_system_score_gemma":0.000019429934,"threshold_uncertainty_score":0.11748786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040941196,0.000032765853,0.9867768,0.0008456994,0.0002006087,0.0004125294,1.0481069e-7,0.00019093792,0.007446397],"genre_scores_gemma":[0.9178913,0.0000022628972,0.07986086,0.0003752855,0.00014331259,0.00007258168,1.7601889e-7,0.000013176574,0.0016410415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898255,0.000032814896,0.00025002673,0.00031846928,0.00012333863,0.00029278183],"domain_scores_gemma":[0.9994524,0.000086109714,0.0000694884,0.00028582322,0.00003506696,0.00007109011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034591102,0.00012993175,0.00017370436,0.00014816284,0.0000945984,0.00024685817,0.00036597095,0.00006766962,0.0000190015],"category_scores_gemma":[0.000017439483,0.00010073755,0.000042975913,0.0003103106,0.0000055140504,0.0005141212,0.00007585043,0.00016023037,0.000006532452],"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.00007407191,0.00028954822,0.0089401705,0.00030425578,0.000107356085,0.00015556342,0.03552004,0.011610436,0.033803903,0.6560761,0.018823799,0.23429482],"study_design_scores_gemma":[0.0006685435,0.000226646,0.000116188654,0.0004029879,0.000002170992,0.00012788545,0.00022905294,0.9837103,0.0034468316,0.0018402532,0.008867158,0.00036200168],"about_ca_topic_score_codex":0.00056445727,"about_ca_topic_score_gemma":0.0007072248,"teacher_disagreement_score":0.97209984,"about_ca_system_score_codex":0.000071101626,"about_ca_system_score_gemma":0.000018987452,"threshold_uncertainty_score":0.4107958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001151753,0.00023779833,0.9938896,0.0019375719,0.00029248343,0.0020785693,0.0000014601244,0.000041414125,0.00036939644],"genre_scores_gemma":[0.98609793,0.000100585654,0.01195635,0.00008399564,0.00007437515,0.0014414799,2.7524447e-7,0.0000061649744,0.00023885803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999327,0.000040421797,0.0002669024,0.00018305483,0.000070886934,0.000111704714],"domain_scores_gemma":[0.9987751,0.00081609935,0.00013364124,0.00022471524,0.000029702498,0.000020698295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043978007,0.00007420213,0.00013699468,0.00004682985,0.00012986355,0.00006769376,0.00017610274,0.000031701507,0.00003600208],"category_scores_gemma":[0.00005230619,0.00004868836,0.00007979684,0.00004411613,0.000027187065,0.00016325184,0.000020266816,0.000023871127,0.000002693763],"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.000025093446,0.00004379163,0.000021805228,0.0000869238,0.00009131436,4.6595837e-8,0.0010944656,0.00043038954,0.0003807211,0.02541234,0.0019183434,0.97049475],"study_design_scores_gemma":[0.00036280026,0.00012302604,0.00013638889,0.00003348074,0.000013002301,0.0000040652735,0.0002683855,0.9772848,0.001353415,0.0001942604,0.020161254,0.0000651525],"about_ca_topic_score_codex":0.000008987079,"about_ca_topic_score_gemma":0.000003683762,"teacher_disagreement_score":0.9849462,"about_ca_system_score_codex":0.00003318143,"about_ca_system_score_gemma":0.0000023655093,"threshold_uncertainty_score":0.19854535},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000077758195,0.0006568554,0.79365486,0.000007988101,0.00082029286,0.000379554,0.0000057578523,0.0006662622,0.20380065],"genre_scores_gemma":[0.17486122,0.000014517629,0.053945333,0.00002998081,0.0013340744,0.00028156454,0.00003208052,0.00018633097,0.7693149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865854,0.000043676995,0.0003000773,0.00047390026,0.0001854393,0.00033837534],"domain_scores_gemma":[0.99891096,0.00003351781,0.00018947013,0.0007398207,0.000047975358,0.00007826295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034472346,0.0002443902,0.00048280376,0.00040585373,0.00008588171,0.00014479955,0.0006685966,0.0002767397,0.00008097791],"category_scores_gemma":[0.0000041632634,0.00019118731,0.00030000365,0.00035823917,0.000008313002,0.00016831802,0.00009920437,0.000093511946,0.0000543705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016829368,0.00011442156,0.0011054738,0.0043146843,0.0048630713,0.0000013236602,0.0007300265,0.39207074,8.329541e-7,0.1630994,0.38047093,0.053212255],"study_design_scores_gemma":[0.00007681869,0.000015740618,0.0000020563132,0.00011588389,0.00014793404,0.0000036979754,0.00003735849,0.9501891,0.0000026214068,0.0000043270516,0.04916671,0.00023771],"about_ca_topic_score_codex":0.00013545048,"about_ca_topic_score_gemma":0.00007216849,"teacher_disagreement_score":0.73970956,"about_ca_system_score_codex":0.00005724207,"about_ca_system_score_gemma":0.00002239165,"threshold_uncertainty_score":0.77963924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24126253,0.000022557058,0.7445757,0.00013839926,0.000929086,0.0001775467,2.7607799e-8,0.00021574809,0.012678412],"genre_scores_gemma":[0.9966867,0.000004008429,0.0016318512,0.0002815356,0.00020140244,0.000019215511,1.7469868e-7,0.0000041323747,0.001170956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992557,0.000024993073,0.00017101066,0.00022054453,0.00013352568,0.00019422032],"domain_scores_gemma":[0.9994936,0.000012652002,0.000032908847,0.00036849614,0.000043072636,0.000049254166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023552873,0.000081699436,0.000097814256,0.000041559604,0.000102517486,0.00013090228,0.0004335007,0.00002480867,0.000022100661],"category_scores_gemma":[0.0000026653106,0.000062165665,0.00003115962,0.00026779898,0.000007670157,0.00032949419,0.00011015017,0.000079747304,0.000117547526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015787025,0.0008356312,0.026722817,0.0000124864855,0.000081744365,0.00005997878,0.0038291775,0.71984136,0.000014982647,0.20845768,0.0058350954,0.03429328],"study_design_scores_gemma":[0.0013701583,0.0010178053,0.01873719,0.0000319107,0.0000038132405,0.00009045727,0.0003707684,0.972559,0.000082242994,0.000469066,0.004934541,0.0003330451],"about_ca_topic_score_codex":0.000090176,"about_ca_topic_score_gemma":0.000075170276,"teacher_disagreement_score":0.7554242,"about_ca_system_score_codex":0.000032704167,"about_ca_system_score_gemma":0.000016772843,"threshold_uncertainty_score":0.25350422},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049969,0.00020647854,0.06668734,0.0006848865,0.0013275924,0.00023189704,3.9735082e-7,0.000075875265,0.025788676],"genre_scores_gemma":[0.9959837,0.00002174566,0.0014700551,0.0002283023,0.000080363796,0.0000049581713,6.4276094e-8,0.0000022750864,0.002208514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992353,0.00006853262,0.00022461187,0.00018204736,0.00013816966,0.00015137003],"domain_scores_gemma":[0.99933887,0.000049863072,0.00007069624,0.00044698094,0.000064589876,0.000029015118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028873188,0.000069890884,0.000115350034,0.000011550087,0.000118390206,0.000035924048,0.0003293065,0.000035602236,0.00005502857],"category_scores_gemma":[0.000010004816,0.00003954377,0.000040544568,0.00021400377,0.000041337677,0.00015766568,0.00014425199,0.000077639525,0.000008375671],"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.000072919276,0.00042983057,0.189804,0.0002730421,0.00013236396,0.000004247938,0.004922029,0.2246771,0.0005479468,0.06558362,0.15120026,0.36235264],"study_design_scores_gemma":[0.00012080709,0.00007381045,0.012852804,0.000034374734,0.0000017288561,0.000009548324,0.000008450927,0.98201245,0.00010180874,0.000061103456,0.004666705,0.00005641588],"about_ca_topic_score_codex":0.000037625232,"about_ca_topic_score_gemma":0.00003097503,"teacher_disagreement_score":0.75733536,"about_ca_system_score_codex":0.000013345816,"about_ca_system_score_gemma":0.0000041919943,"threshold_uncertainty_score":0.16125482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3530889,0.000041227602,0.30566844,0.0020641782,0.013571036,0.00062081445,0.000012972867,0.0005423791,0.32439005],"genre_scores_gemma":[0.9938818,0.000006596353,0.00054922415,0.00015578471,0.0003009686,0.000020069803,5.48939e-7,0.000006759643,0.005078236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883014,0.00002669376,0.00035274157,0.00026888697,0.00037438137,0.0001471771],"domain_scores_gemma":[0.9992238,0.00007170099,0.00016620664,0.00022583442,0.00027407683,0.000038330003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030288257,0.00011235195,0.00013911533,0.00010489583,0.00017989802,0.000057953017,0.000898542,0.00007206547,0.000021539958],"category_scores_gemma":[0.000046003486,0.00007092394,0.00012091167,0.00031180467,0.000042618714,0.0003570603,0.00016764739,0.00017584272,0.000023230505],"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.000053949396,0.00017664958,0.0091975015,0.000060949198,0.00014467258,0.0000061128735,0.0046974095,0.001155651,0.0012529766,0.85904557,0.11851764,0.0056909337],"study_design_scores_gemma":[0.002211767,0.0005370446,0.055331696,0.002561999,0.000022253984,0.00249479,0.006844358,0.86352015,0.020064652,0.00054992794,0.045034844,0.000826533],"about_ca_topic_score_codex":0.000038682574,"about_ca_topic_score_gemma":0.0000070257697,"teacher_disagreement_score":0.8623645,"about_ca_system_score_codex":0.00011091037,"about_ca_system_score_gemma":0.000025821313,"threshold_uncertainty_score":0.28921944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009218363,0.00042778294,0.991613,0.00025618888,0.0047784387,0.00068583776,0.000004689387,0.00009468898,0.0020472151],"genre_scores_gemma":[0.07650525,0.00001915536,0.92014647,0.0020110214,0.00069442304,0.00007320526,0.0000033940723,0.000058407946,0.0004886526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632055,0.00004774826,0.0006688149,0.0015186023,0.00063938077,0.0008049172],"domain_scores_gemma":[0.9979829,0.00047329333,0.0002493262,0.0009364046,0.00022109269,0.00013698624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014383615,0.00047017835,0.00059108733,0.0011333425,0.00023853,0.0004700548,0.0018935667,0.00033241237,0.000008515979],"category_scores_gemma":[0.000040375202,0.00043522165,0.000212672,0.0007838155,0.00023850518,0.0001865528,0.00041053773,0.0005759661,0.000013535131],"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.00000224627,0.000031407355,0.000008562747,0.000022748309,0.000007017886,0.00003635751,0.00053462054,0.45289308,0.000016878796,0.022478102,0.00004015477,0.5239288],"study_design_scores_gemma":[0.00035266712,0.00012172039,0.000007046536,0.0003902664,0.0000028444713,0.00008040649,4.0618954e-7,0.95693576,0.00010801959,0.038103554,0.0034097454,0.00048757167],"about_ca_topic_score_codex":0.000027424254,"about_ca_topic_score_gemma":0.00007303246,"teacher_disagreement_score":0.52344126,"about_ca_system_score_codex":0.00037526657,"about_ca_system_score_gemma":0.00021862968,"threshold_uncertainty_score":0.99981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010215391,0.00015138988,0.9852033,0.0029503393,0.00016700773,0.00041062894,0.0000027294482,0.00009021859,0.00080894027],"genre_scores_gemma":[0.9078245,0.00004888282,0.09194849,0.00008438409,0.0000128641,0.000041340885,0.0000019935228,0.0000075815037,0.000029955683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986453,0.0004378397,0.00029797736,0.00020180579,0.00028644633,0.00013062902],"domain_scores_gemma":[0.99791443,0.00033339876,0.00012542184,0.0013083934,0.00026861124,0.000049759627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010018516,0.000105898165,0.00014174213,0.00016131531,0.00038622602,0.00006979662,0.0007076225,0.0000645728,0.000012842275],"category_scores_gemma":[0.000017902466,0.000102976315,0.00005379407,0.00041061756,0.00008113147,0.00021661347,0.000019030438,0.00024541412,0.000010018225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103097345,0.00021408193,0.0000023111695,0.0000074562163,0.00005588972,2.2806165e-7,0.0031226156,0.8589768,0.00093666796,0.049134836,0.000009924974,0.087528884],"study_design_scores_gemma":[0.0018378461,0.00026680567,0.00034498953,0.00023889773,0.00011601979,0.00007816708,0.00048680857,0.9653162,0.0053411555,0.025390908,0.00028751153,0.0002947219],"about_ca_topic_score_codex":0.00034115085,"about_ca_topic_score_gemma":0.00019433926,"teacher_disagreement_score":0.8976091,"about_ca_system_score_codex":0.00009122251,"about_ca_system_score_gemma":0.0001125396,"threshold_uncertainty_score":0.4199252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026926603,0.000040099323,0.5210075,0.00018697113,0.0017098283,0.000104129846,1.8159999e-7,0.00020255627,0.4498222],"genre_scores_gemma":[0.98625517,5.9388395e-7,0.0057209004,0.00072537333,0.00090010976,0.0000039768747,7.581692e-7,0.0000063381212,0.0063867797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991669,0.000020603002,0.00019854167,0.00021778932,0.00011976487,0.00027641043],"domain_scores_gemma":[0.9995426,0.000048488106,0.00005763701,0.00028654837,0.000031507072,0.000033202916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023943119,0.00008976881,0.000111464105,0.000041214815,0.00016638334,0.00018514889,0.00025931356,0.000052026397,0.00008607539],"category_scores_gemma":[0.0000025655038,0.00007114989,0.000049589136,0.00022842467,0.000007537688,0.00024156175,0.000021550284,0.00008217235,0.00012043128],"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.0000054424513,0.000024726332,0.00023409586,0.0000031567731,0.0000062480835,0.0000071538984,0.000033380868,0.094629265,0.000128647,0.84855425,0.053251363,0.0031222668],"study_design_scores_gemma":[0.00022369888,0.00009435001,0.00034463344,0.00005956441,0.000001752728,0.00006469121,0.000012784029,0.9340451,0.000681091,0.026371628,0.03787781,0.0002229383],"about_ca_topic_score_codex":0.0004655141,"about_ca_topic_score_gemma":0.00009345768,"teacher_disagreement_score":0.9593286,"about_ca_system_score_codex":0.00004362232,"about_ca_system_score_gemma":0.000017477558,"threshold_uncertainty_score":0.29014084},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064602453,0.00065351935,0.82649535,0.0029521945,0.0031930387,0.00016175346,1.6003636e-7,0.00028355722,0.16561441],"genre_scores_gemma":[0.95720726,0.0000661292,0.0029907213,0.0013056458,0.0007613706,0.000024604175,3.5173903e-7,0.000008022698,0.03763587],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891347,0.0000938064,0.00024143333,0.00022092047,0.00019010912,0.00034027448],"domain_scores_gemma":[0.99915737,0.00014210439,0.000059783135,0.0005216496,0.000059609065,0.000059462476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033506274,0.00009917182,0.000104521365,0.00001696405,0.00044581282,0.00032075564,0.00067548314,0.000042227846,0.00015177023],"category_scores_gemma":[0.000008995154,0.000056217577,0.00006940081,0.00027413695,0.000024033077,0.00016228875,0.000118840435,0.00010442661,0.00044512423],"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.0000035719302,0.000034871362,0.00019125665,0.000002400609,0.000046821006,0.000011890705,0.00040051216,0.011726895,0.000013380793,0.20622902,0.60870105,0.17263833],"study_design_scores_gemma":[0.00010086333,0.000031173473,0.000066306224,0.000009081799,0.000001100642,0.000016565029,0.000018674002,0.7227599,0.000008891166,0.0003342594,0.2765824,0.00007076389],"about_ca_topic_score_codex":0.000034590747,"about_ca_topic_score_gemma":0.00016330974,"teacher_disagreement_score":0.95656127,"about_ca_system_score_codex":0.000023480476,"about_ca_system_score_gemma":0.0000044354742,"threshold_uncertainty_score":0.572132},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031085467,0.00042389918,0.9912388,0.0001538795,0.004330888,0.0006283389,0.0000045530273,0.00013560435,0.0030529846],"genre_scores_gemma":[0.0208023,0.000036055557,0.9751356,0.0015285322,0.0014869792,0.000026450558,0.0000069341418,0.00005744903,0.00091965724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959275,0.00003957823,0.00086496765,0.0015439356,0.000697618,0.0009263805],"domain_scores_gemma":[0.9973115,0.0008856904,0.00034613488,0.0009980561,0.00029987463,0.00015878947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021954647,0.00051072834,0.0006293659,0.001544171,0.00024770346,0.00038539837,0.002547709,0.00045993886,0.000009312743],"category_scores_gemma":[0.00007296082,0.00048110128,0.00021569862,0.0010402265,0.00031014078,0.00047510685,0.000675747,0.00088266475,0.000016589504],"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.0000023588593,0.000016954331,0.000021623875,0.000020530873,0.0000064892006,0.00005566837,0.00035768904,0.017451217,0.000011207355,0.012548147,0.000021712855,0.9694864],"study_design_scores_gemma":[0.00035238414,0.0001651149,0.0000208584,0.000540733,0.000002968772,0.0000965804,3.403902e-7,0.95408344,0.00015592048,0.039876405,0.0041789636,0.000526317],"about_ca_topic_score_codex":0.000076377946,"about_ca_topic_score_gemma":0.00035951656,"teacher_disagreement_score":0.9689601,"about_ca_system_score_codex":0.0003236405,"about_ca_system_score_gemma":0.0002732621,"threshold_uncertainty_score":0.9997641},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98333395,0.00037423914,0.011906309,0.00021682697,0.0012055103,0.00045107474,0.0000077705845,0.00018106386,0.0023232705],"genre_scores_gemma":[0.9986784,0.00006146787,0.00092532224,0.0000837619,0.000015910055,0.00003173223,0.0000050700946,0.000018616067,0.00017972192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978633,0.00028147595,0.00052768504,0.00062425295,0.0003384482,0.00036486468],"domain_scores_gemma":[0.99772215,0.00046713202,0.0002855093,0.00087067136,0.00048992614,0.00016460393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006150021,0.00026768993,0.0005518486,0.00014140335,0.000218226,0.00005138645,0.00047169914,0.00013906854,0.000015585894],"category_scores_gemma":[0.00014450023,0.00022293295,0.00009058384,0.0006992607,0.00025863672,0.00044630564,0.00017957223,0.00021624904,0.0000050854514],"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.00033284925,0.00069830497,0.045168363,0.00015805427,0.00020829788,0.00011195243,0.0026451668,0.00031632808,0.0009929385,0.94400424,0.0044068173,0.0009566907],"study_design_scores_gemma":[0.017893868,0.010229399,0.08048766,0.000822047,0.00014711148,0.0023291786,0.0004269303,0.2423926,0.025303971,0.6134322,0.0038542051,0.0026807985],"about_ca_topic_score_codex":0.0005214365,"about_ca_topic_score_gemma":0.00013317478,"teacher_disagreement_score":0.330572,"about_ca_system_score_codex":0.000039563285,"about_ca_system_score_gemma":0.00009648649,"threshold_uncertainty_score":0.90909415},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002106724,0.0003159524,0.9871428,0.00028762288,0.001725989,0.0003356207,0.0000017331051,0.00006737659,0.009912257],"genre_scores_gemma":[0.84844816,0.00003211113,0.14940998,0.00059166434,0.000561584,0.000012053914,0.0000020585683,0.000032259562,0.00091015163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967001,0.00006405005,0.00081780844,0.0011594879,0.0007249639,0.00053359335],"domain_scores_gemma":[0.99782234,0.00036993893,0.00036154967,0.0011254117,0.00021912593,0.00010160409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00125918,0.00040775986,0.0007118431,0.0009844276,0.000087694214,0.00023623262,0.0026352482,0.00032254405,0.000017373959],"category_scores_gemma":[0.00003996872,0.00035448003,0.00014418748,0.0006410147,0.00039728664,0.00031508086,0.00072624895,0.00061715575,0.000025006597],"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.0000070751807,0.000035139583,0.0003071067,0.000088366054,0.000009949042,0.000043870532,0.0014194135,0.102081835,0.00022405921,0.08164202,0.00007530479,0.8140659],"study_design_scores_gemma":[0.00041751197,0.00035369577,0.00028575244,0.0014965814,0.000004306817,0.00014028867,4.109156e-7,0.9174484,0.00061642943,0.07172094,0.0067930846,0.0007225971],"about_ca_topic_score_codex":0.00010528479,"about_ca_topic_score_gemma":0.00062727934,"teacher_disagreement_score":0.84823745,"about_ca_system_score_codex":0.00019499483,"about_ca_system_score_gemma":0.00025107627,"threshold_uncertainty_score":0.99989074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031498104,0.000038249855,0.96704024,0.0002082563,0.0002233216,0.00015032529,8.959214e-7,0.00011374539,0.0007268309],"genre_scores_gemma":[0.6197918,0.000001701439,0.37930268,0.000059801605,0.00039218867,0.000003467914,0.0000013575586,0.0000054014185,0.0004415683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990916,0.00003794515,0.00029761126,0.00024531176,0.00017130491,0.00015618073],"domain_scores_gemma":[0.9992498,0.000018057039,0.00013270973,0.00035139066,0.00018667067,0.0000613564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025065715,0.00008840991,0.00013090008,0.00008255636,0.00006893894,0.000060360442,0.00036537834,0.00005611278,0.000021433636],"category_scores_gemma":[0.000006514145,0.000074149524,0.0000485843,0.00027904543,0.000017994853,0.0006665855,0.000031690568,0.000060821207,0.000024893514],"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.000021127866,0.0012326337,0.0018505834,0.00012855706,0.00009024702,0.000003553083,0.0071410895,0.0943045,0.09351125,0.02672737,0.0012539256,0.77373517],"study_design_scores_gemma":[0.00014993073,0.00005018012,0.00011004943,0.000016245778,0.0000024950982,0.000023525967,0.00006357779,0.9774463,0.01904204,0.0000679148,0.0029295832,0.00009815776],"about_ca_topic_score_codex":0.00010460265,"about_ca_topic_score_gemma":0.000023420249,"teacher_disagreement_score":0.8831418,"about_ca_system_score_codex":0.000029635741,"about_ca_system_score_gemma":0.0000294609,"threshold_uncertainty_score":0.302373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026543962,0.0009148896,0.83726156,0.005991015,0.04107138,0.0017999499,0.00013450629,0.0005833989,0.08569932],"genre_scores_gemma":[0.9922253,0.00008025005,0.000058702397,0.00030742382,0.0014995001,0.00036589167,0.0000030414524,0.000023139426,0.0054367715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796087,0.000103220686,0.0005414172,0.0005862091,0.00047487917,0.00033342047],"domain_scores_gemma":[0.99850863,0.00048257908,0.00023690122,0.00040343375,0.00022750195,0.00014092812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050691376,0.00023769912,0.00034082553,0.00016312221,0.00023971174,0.00062708854,0.00073081173,0.00012915702,0.000026451044],"category_scores_gemma":[0.00004701908,0.00020581098,0.00015053365,0.00013668368,0.000029989627,0.0003553615,0.000034676952,0.00011451381,0.000113574526],"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.00002515695,0.0004445926,0.000753223,0.0003687099,0.00063691876,0.000051719206,0.0025747141,0.011881927,0.011407578,0.8646683,0.08062569,0.026561458],"study_design_scores_gemma":[0.0005238734,0.00018981402,0.0000696422,0.00038316668,0.0000150168335,0.00031446078,0.00008412811,0.87745225,0.0006825166,0.00013966816,0.11972695,0.0004185043],"about_ca_topic_score_codex":0.00011345642,"about_ca_topic_score_gemma":0.000009277315,"teacher_disagreement_score":0.9656813,"about_ca_system_score_codex":0.0001370182,"about_ca_system_score_gemma":0.000009750405,"threshold_uncertainty_score":0.83927286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003657279,0.00041675978,0.99232453,0.00065622275,0.0007820116,0.0004015249,7.398776e-7,0.00017894966,0.001582],"genre_scores_gemma":[0.58690983,0.00004613433,0.4108602,0.0014899876,0.00018610626,0.00034648078,4.0961112e-7,0.000011079965,0.00014971933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987492,0.000029800754,0.00027134616,0.00040192774,0.00018842328,0.00035929124],"domain_scores_gemma":[0.9980379,0.0010346611,0.00022899185,0.0004584708,0.00015792406,0.00008209083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060687214,0.00015150686,0.00014577845,0.000042477146,0.0006748557,0.00033668047,0.0006256614,0.00010059029,0.000023702436],"category_scores_gemma":[0.0006898565,0.00010446299,0.000060129572,0.00024164478,0.000077830846,0.001912707,0.00021791042,0.00023895797,0.000013060681],"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.000059195754,0.00006716879,0.0007170635,0.00006138693,0.00004316772,0.000019487194,0.2311214,0.000012093039,0.000055512213,0.70835,0.0015935316,0.05789999],"study_design_scores_gemma":[0.0010275973,0.0010793423,0.0010967151,0.001131033,0.00006160466,0.0016118784,0.1462359,0.074209765,0.0013770369,0.34564975,0.42476735,0.0017520206],"about_ca_topic_score_codex":0.00009344689,"about_ca_topic_score_gemma":0.0000058405913,"teacher_disagreement_score":0.5832526,"about_ca_system_score_codex":0.000024991843,"about_ca_system_score_gemma":0.000040168663,"threshold_uncertainty_score":0.5190513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019380412,0.00067529833,0.97988325,0.0010862577,0.0055408427,0.00056558434,0.0000019819279,0.00043731707,0.011790079],"genre_scores_gemma":[0.68877196,0.000037180624,0.30649507,0.002278507,0.0016475442,0.00002162739,0.0000016660722,0.000072929004,0.0006735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995091,0.00008317848,0.0010043256,0.0016827587,0.0010473765,0.0010913576],"domain_scores_gemma":[0.9964908,0.0009344041,0.00047203465,0.0015372211,0.0003087755,0.00025681732],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001747578,0.00070457364,0.0009755449,0.00052436185,0.00041191326,0.0011016534,0.0037263434,0.00048752746,0.00006178501],"category_scores_gemma":[0.000120394536,0.00062095694,0.00027029082,0.00059594586,0.00057291857,0.0006203164,0.0011339956,0.0010689407,0.00012643325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008843928,0.000016813037,0.000007759398,0.00003724299,0.000031348503,0.000083388906,0.0004962074,0.72660524,0.000022407627,0.14236292,0.00010874065,0.13021907],"study_design_scores_gemma":[0.00034811214,0.00015998061,0.000009796726,0.0015304992,0.000009220609,0.000117911804,2.499353e-7,0.82746404,0.00010978461,0.16804579,0.0015591407,0.0006454878],"about_ca_topic_score_codex":0.00003225247,"about_ca_topic_score_gemma":0.000102772196,"teacher_disagreement_score":0.6887526,"about_ca_system_score_codex":0.0007521081,"about_ca_system_score_gemma":0.0007213551,"threshold_uncertainty_score":0.99993527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073831356,0.00026543075,0.99034184,0.0004254367,0.00028065013,0.00017581499,4.08614e-7,0.00046868602,0.0006586119],"genre_scores_gemma":[0.94843894,6.661535e-7,0.051115714,0.00015445804,0.00008881517,0.000033858418,4.3386953e-7,0.000006023553,0.00016109062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992511,0.00001824372,0.00017117593,0.0002493769,0.00010703838,0.00020304031],"domain_scores_gemma":[0.99950135,0.000096612865,0.00006346911,0.00015696525,0.00013383511,0.000047795875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036358938,0.00009056111,0.0001245096,0.000058458245,0.0001747292,0.00047556253,0.00026542306,0.00006957378,0.0000011214582],"category_scores_gemma":[0.000057241843,0.000070557624,0.000026982902,0.00015002087,0.000050672155,0.0002164578,0.00007637645,0.000060511054,0.0000034021575],"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.0000622413,0.00007535884,0.00083975017,0.00026498904,0.000023035558,0.00002836859,0.0016275361,0.005971153,0.0007837204,0.045730643,0.0048386944,0.9397545],"study_design_scores_gemma":[0.0003132579,0.00016950603,0.0000044348026,0.00004749496,0.0000028993966,0.000020109426,0.00033610262,0.98360974,0.0011016027,0.002381244,0.011896252,0.00011735676],"about_ca_topic_score_codex":0.000010554534,"about_ca_topic_score_gemma":0.000008895556,"teacher_disagreement_score":0.9776386,"about_ca_system_score_codex":0.000023084822,"about_ca_system_score_gemma":0.000099984645,"threshold_uncertainty_score":0.45858604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009843967,0.00004574671,0.97754455,0.0002705529,0.0007527765,0.00030400697,0.00001079363,0.00018992132,0.011037692],"genre_scores_gemma":[0.9564002,0.0000098563505,0.042346224,0.0006371811,0.00007756412,0.00003703493,0.000058177786,0.000019071897,0.0004146471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792844,0.00029558866,0.00063327845,0.0005766004,0.00034513796,0.0002209297],"domain_scores_gemma":[0.9954903,0.00027267943,0.00048028666,0.003467015,0.00020642822,0.00008325993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006722006,0.0002753754,0.00047516244,0.00021029582,0.00010613695,0.00019014851,0.002714834,0.00027955274,0.00003842662],"category_scores_gemma":[0.000036955924,0.000245235,0.00023665471,0.00012479091,0.000041212785,0.000099122386,0.0012366178,0.00044818508,0.000031823816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070921956,0.000095578325,0.00002513086,0.0001320983,0.00006384037,0.0000011461199,0.00042859485,0.97282535,0.00009493181,0.018637525,0.005371361,0.0023173378],"study_design_scores_gemma":[0.00015544072,0.000036448368,0.000009831101,0.00036546422,0.0000051549755,0.0000025533861,0.0000150332435,0.99557704,0.0010114395,0.0014728805,0.0011021973,0.00024651072],"about_ca_topic_score_codex":0.00011048278,"about_ca_topic_score_gemma":0.00004510261,"teacher_disagreement_score":0.94655627,"about_ca_system_score_codex":0.00007792278,"about_ca_system_score_gemma":0.0001283911,"threshold_uncertainty_score":1},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005509774,0.00025674448,0.8716119,0.00023114246,0.0011924584,0.00009360514,5.6542632e-8,0.000245361,0.12085894],"genre_scores_gemma":[0.99509156,0.0000022111992,0.0025366442,0.00014054276,0.0002686335,0.00001682999,1.8091208e-7,0.000003476482,0.0019399227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992057,0.00007255131,0.00021159745,0.00018307325,0.00009985116,0.00022720448],"domain_scores_gemma":[0.9996353,0.00003211067,0.000036552123,0.00023565217,0.000021325195,0.00003905834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027312004,0.00006112483,0.0001018777,0.00004203086,0.00007435713,0.00012228184,0.00022757011,0.00003806895,0.000096660595],"category_scores_gemma":[0.0000031430002,0.00005338463,0.000035328572,0.00033958213,0.000005582112,0.00020155018,0.00004717187,0.00006842097,0.00031378845],"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":[6.926143e-7,0.000024152057,0.0023188228,0.000018828021,0.000006584043,0.00006282502,0.00051615934,0.027099794,0.000032750006,0.94080377,0.026725776,0.002389863],"study_design_scores_gemma":[0.000107003085,0.000016676342,0.0000992805,0.0000713699,4.878906e-7,0.000020997208,0.00005924904,0.99106836,0.00004411194,0.00020429588,0.008228463,0.00007972859],"about_ca_topic_score_codex":0.000058658105,"about_ca_topic_score_gemma":0.000056626508,"teacher_disagreement_score":0.98958176,"about_ca_system_score_codex":0.000046305075,"about_ca_system_score_gemma":0.000002638657,"threshold_uncertainty_score":0.40332204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020248606,0.00014449733,0.9915106,0.0002570628,0.0011694417,0.00040742249,2.6907674e-7,0.00022947552,0.0042563253],"genre_scores_gemma":[0.6758825,0.000004257846,0.32173264,0.00027984436,0.00017934333,0.000030998326,2.9158423e-7,0.000010689577,0.0018794102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864507,0.000094585805,0.00031938544,0.0003685032,0.0001260402,0.00044643987],"domain_scores_gemma":[0.99894565,0.00044869742,0.00010366085,0.00034738414,0.00007262563,0.00008199262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066751766,0.00014122957,0.00017853356,0.000038048525,0.00029902163,0.0002708202,0.00044093325,0.00006879653,0.00005396768],"category_scores_gemma":[0.00002210642,0.00012009356,0.00010462279,0.00020810404,0.00000782052,0.00025529385,0.000082693434,0.00010684367,0.000108309876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045139866,0.00035456993,0.00071934285,0.00017879743,0.000117826596,0.00004186595,0.0061903517,0.6702028,0.003209229,0.09701854,0.10148106,0.12044046],"study_design_scores_gemma":[0.00032623994,0.00008804459,0.000016462196,0.00003492708,0.0000036072374,0.000017167938,0.000040692827,0.99576443,0.00012030226,0.00065511814,0.002768446,0.00016456249],"about_ca_topic_score_codex":0.000022935756,"about_ca_topic_score_gemma":0.000014133441,"teacher_disagreement_score":0.6738577,"about_ca_system_score_codex":0.000050023114,"about_ca_system_score_gemma":0.000008084699,"threshold_uncertainty_score":0.48972732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036786158,0.000028448909,0.9828288,0.00008265022,0.0002376386,0.00046709343,1.7622575e-7,0.00004458526,0.016273806],"genre_scores_gemma":[0.82753414,0.00000202735,0.16990098,0.0003637283,0.00014061767,0.0003271866,3.8820693e-7,0.0000054355673,0.0017254681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946105,0.000046413654,0.00015275516,0.00014779244,0.000064171916,0.00012781467],"domain_scores_gemma":[0.99938965,0.00019681544,0.000053708995,0.00027234806,0.00006114504,0.00002635387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037141907,0.0000504834,0.00008595671,0.000023579441,0.00007071218,0.000025788731,0.00020190373,0.000030092013,0.000012495232],"category_scores_gemma":[0.000009509719,0.000040035302,0.00003922743,0.00019004836,0.0000061258306,0.000045981404,0.000009249659,0.000027640148,0.000015586256],"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.000001990882,0.000022361997,0.000020376741,0.0000040028303,0.0000064438154,3.422415e-8,0.000037165897,0.03080656,0.000059664715,0.95742685,0.008809682,0.0028048842],"study_design_scores_gemma":[0.0005580301,0.00047048548,0.000056207708,0.000036326666,0.000005699674,0.000009667894,0.00003396551,0.7544039,0.0032299298,0.074972704,0.1659804,0.00024271729],"about_ca_topic_score_codex":0.0000027177985,"about_ca_topic_score_gemma":0.000002165797,"teacher_disagreement_score":0.88245416,"about_ca_system_score_codex":0.000009278272,"about_ca_system_score_gemma":0.000020850146,"threshold_uncertainty_score":0.16325922},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018180069,0.000086184875,0.9831804,0.000059935843,0.0016250262,0.00030698042,2.4685644e-7,0.00015343945,0.012769748],"genre_scores_gemma":[0.82979345,0.0000024777034,0.16509856,0.00040188065,0.00022410779,0.000053644904,5.358653e-7,0.000008412629,0.004416941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990527,0.00011595371,0.0001944852,0.00027984244,0.00008418866,0.0002728533],"domain_scores_gemma":[0.9992994,0.0001502093,0.000057120327,0.00033799763,0.00008222456,0.00007301833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064063,0.00010045359,0.00013223673,0.000024390378,0.00014859071,0.0001919919,0.00038422595,0.000055229644,0.00006129021],"category_scores_gemma":[0.000023971497,0.00007708219,0.000049660594,0.00016215979,0.00001305109,0.0003091597,0.000028408436,0.000052768948,0.00005197847],"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.000017270111,0.000049790026,0.00022077121,0.000008067672,0.00003003756,0.0000018922765,0.0005053082,0.03876247,0.00012483778,0.716072,0.23907867,0.00512888],"study_design_scores_gemma":[0.00031554216,0.0006182983,0.000022046288,0.000023362923,0.0000036810677,0.000038202837,0.00010682537,0.8681221,0.0010447536,0.021728141,0.10775887,0.0002181863],"about_ca_topic_score_codex":0.00001641185,"about_ca_topic_score_gemma":0.000052461906,"teacher_disagreement_score":0.8293596,"about_ca_system_score_codex":0.000019043788,"about_ca_system_score_gemma":0.000026841537,"threshold_uncertainty_score":0.31433207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025574258,0.000038519207,0.9828448,0.00023995359,0.00027897564,0.0003236947,2.3646658e-7,0.00023291443,0.015785132],"genre_scores_gemma":[0.83780926,0.0000023102148,0.15404972,0.00023632993,0.00009660161,0.000058242345,8.3213126e-7,0.000006661884,0.007740051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992326,0.00004246917,0.00017127242,0.00025675655,0.00009102811,0.00020587009],"domain_scores_gemma":[0.9994626,0.00008394801,0.000041385872,0.00029266873,0.00006537059,0.00005405181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002857661,0.000089501205,0.000117911564,0.000051497158,0.00010584969,0.00014182598,0.00037676105,0.000051505835,0.000041367268],"category_scores_gemma":[0.000014037653,0.000068146925,0.000062005376,0.00021314922,0.00000947525,0.00019121454,0.000035674995,0.000048489797,0.00003505466],"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.000047833168,0.0006505986,0.00027731163,0.000095228395,0.00021973717,0.000007985704,0.004060276,0.040208142,0.0022384783,0.44484913,0.34907177,0.1582735],"study_design_scores_gemma":[0.00021730537,0.00007998042,0.000025395351,0.000003931296,0.000001961368,0.000012389776,0.000016371261,0.9939128,0.00081013556,0.0005367555,0.0042731054,0.000109858585],"about_ca_topic_score_codex":0.00001438165,"about_ca_topic_score_gemma":0.0000022150323,"teacher_disagreement_score":0.95370466,"about_ca_system_score_codex":0.000018094683,"about_ca_system_score_gemma":0.0000058108326,"threshold_uncertainty_score":0.2778951},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43324766,0.00004343617,0.5618686,0.0007720315,0.00019979183,0.00012454033,7.724098e-7,0.00006905207,0.0036741],"genre_scores_gemma":[0.96923935,0.0000030434876,0.029723069,0.00026423534,0.00011656445,0.000004684847,0.0000011420541,0.0000027250267,0.0006451593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994046,0.000033875607,0.0001991096,0.00015587584,0.00009735449,0.000109194334],"domain_scores_gemma":[0.9996416,0.000014508135,0.000052903866,0.00017689157,0.00006834866,0.000045762874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025085462,0.00005191763,0.000082721206,0.00004850121,0.000043721677,0.00006728526,0.00013394737,0.000025333647,0.00015186326],"category_scores_gemma":[0.0000024861026,0.000042422394,0.000018028553,0.00010928564,0.000010505656,0.00053442345,0.000045426612,0.000028747701,0.00001385293],"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.000014912706,0.00014843798,0.0033195477,0.000033286127,0.00003853827,0.0000019031309,0.0026763338,0.0013346629,0.0056837983,0.17468514,0.0100878505,0.8019756],"study_design_scores_gemma":[0.0010903395,0.00028238766,0.0051617958,0.000019159055,0.000005511812,0.000036626752,0.00088445935,0.9282839,0.046756864,0.0008207351,0.016444733,0.00021354554],"about_ca_topic_score_codex":0.00023823185,"about_ca_topic_score_gemma":0.00047540115,"teacher_disagreement_score":0.9269492,"about_ca_system_score_codex":0.000011781304,"about_ca_system_score_gemma":0.000016620455,"threshold_uncertainty_score":0.1729935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18912965,0.0004078401,0.8096976,0.00009632556,0.00035539042,0.00010369175,0.000001000158,0.0001247575,0.00008369934],"genre_scores_gemma":[0.9821766,0.000013716578,0.01732719,0.00028032108,0.00017781615,0.0000032945595,0.0000082728075,0.000007682988,0.000005109348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982748,0.00008758182,0.00043404163,0.0004551465,0.000120835015,0.0006275904],"domain_scores_gemma":[0.99887884,0.000554081,0.00011640675,0.00019436576,0.000049062513,0.0002072724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011055256,0.00019601086,0.0002696821,0.000096549025,0.00023029017,0.0002043074,0.00020668376,0.0001231529,9.3304175e-7],"category_scores_gemma":[0.000034405555,0.00018040946,0.00003867805,0.00033507156,0.00005673078,0.00010805217,0.00017041374,0.00026464523,0.0000011296644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008676244,0.00014976301,0.03885684,0.00006876464,0.000030696123,0.00020864939,0.0011477233,0.79267615,0.000017436587,0.008416071,0.0002947152,0.15804644],"study_design_scores_gemma":[0.0009811743,0.000060161237,0.024146816,0.0001270409,0.000002080641,0.000043526416,0.00012047017,0.97389793,0.0000021574906,0.00012991842,0.00027043515,0.00021830336],"about_ca_topic_score_codex":0.000058502006,"about_ca_topic_score_gemma":0.000020699039,"teacher_disagreement_score":0.79304695,"about_ca_system_score_codex":0.000045870045,"about_ca_system_score_gemma":0.00001333858,"threshold_uncertainty_score":0.73568845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.289998,0.027013399,0.04936917,0.010775446,0.17387772,0.013430101,0.00008978545,0.001811532,0.43363485],"genre_scores_gemma":[0.99478805,0.00020836195,0.00041662614,0.00021720804,0.0037288652,0.00002659777,0.000012308452,0.00005273843,0.00054921745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580914,0.00029905545,0.0011524183,0.0009954771,0.0008110714,0.0009328306],"domain_scores_gemma":[0.99691844,0.0009029212,0.00067168596,0.0007393142,0.00038199,0.0003856622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066561694,0.00059198815,0.0010464579,0.0002226505,0.0004144955,0.00021802617,0.00073211815,0.00035244584,0.000075810865],"category_scores_gemma":[0.000093643146,0.0005680933,0.00013174047,0.0012150838,0.00015900882,0.00033950646,0.0002418408,0.0005650585,0.000002705501],"study_design_candidate":"simulation_or_modeling","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.0009884521,0.0013858655,0.0053108386,0.0007291967,0.0017611851,0.00025391413,0.004089588,0.02654955,0.00047623058,0.6427275,0.18265617,0.1330715],"study_design_scores_gemma":[0.016823981,0.0021072018,0.0046158694,0.00345188,0.00025370848,0.0003376028,0.00036908098,0.720797,0.0016324233,0.005301073,0.24110742,0.0032027604],"about_ca_topic_score_codex":0.1322574,"about_ca_topic_score_gemma":0.31558147,"teacher_disagreement_score":0.70479006,"about_ca_system_score_codex":0.0004466919,"about_ca_system_score_gemma":0.00065350736,"threshold_uncertainty_score":0.99967706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95893186,0.00030214168,0.010483833,0.00042434974,0.011119305,0.0002421651,0.000002419209,0.00017399134,0.018319918],"genre_scores_gemma":[0.99879134,0.00005761535,0.00034859325,0.00016026803,0.00001834659,0.000006296758,0.0000012557006,0.000008236282,0.0006080601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988951,0.0001072402,0.00029365532,0.00025148777,0.00025216944,0.00020033098],"domain_scores_gemma":[0.9990387,0.000068086185,0.00013205722,0.0005168359,0.00017186184,0.00007247294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027498053,0.00010339284,0.00022526184,0.00010355158,0.00012407429,0.000024841906,0.0005162422,0.000080172984,0.000026866577],"category_scores_gemma":[0.000013531592,0.000107761836,0.000104769424,0.0004791526,0.000056774967,0.00023293054,0.000115450544,0.000112336245,0.000064184904],"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.000004605952,0.00013543856,0.0024446587,0.000012485499,0.000026442705,0.000006862284,0.0009325223,0.00001056985,0.00047285197,0.9731777,0.021293119,0.001482785],"study_design_scores_gemma":[0.0034944902,0.0013048564,0.02440069,0.0002512134,0.00002545043,0.00013861671,0.00012516056,0.023055961,0.0266327,0.879972,0.03960246,0.0009963921],"about_ca_topic_score_codex":0.0001382486,"about_ca_topic_score_gemma":0.0000035094101,"teacher_disagreement_score":0.093205646,"about_ca_system_score_codex":0.000026411311,"about_ca_system_score_gemma":0.000042451968,"threshold_uncertainty_score":0.43944},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000071438626,0.00009489133,0.5030185,0.00018126165,0.0014219363,0.00018542746,0.0000013420636,0.0004911728,0.49459836],"genre_scores_gemma":[0.008526389,0.00006917404,0.0052666627,0.0007407755,0.0010620687,0.00003643137,0.0000064578676,0.0002205217,0.9840715],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985049,0.00008810719,0.00024896354,0.0006048152,0.00026073135,0.00029249236],"domain_scores_gemma":[0.9989022,0.000036960904,0.00020409244,0.00071704405,0.000057983514,0.00008172081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098085606,0.00032431516,0.00035229474,0.00031917603,0.00006482895,0.00018765769,0.0005792059,0.00026433048,0.0008228116],"category_scores_gemma":[0.00000415585,0.00022744555,0.000102568745,0.00019600007,0.00004378939,0.00018496432,0.00014595847,0.00021438338,0.0006898081],"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.0000064663595,0.000020365584,0.000055615666,0.000024809153,0.00006792355,0.0000274376,0.00017627398,0.000036340447,0.0000012298061,0.004430775,0.9918807,0.0032720466],"study_design_scores_gemma":[0.00038656307,0.00020886965,0.000022227772,0.00036059186,0.0000072753796,0.00068675657,0.000049992334,0.017469447,0.00003357915,0.00002362504,0.98031616,0.0004349351],"about_ca_topic_score_codex":0.0006998505,"about_ca_topic_score_gemma":0.001735342,"teacher_disagreement_score":0.4977518,"about_ca_system_score_codex":0.000060936763,"about_ca_system_score_gemma":0.00003805558,"threshold_uncertainty_score":0.927496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7105331,0.000036817102,0.11832035,0.0010246316,0.0018385756,0.00016872784,3.0182525e-7,0.0001405359,0.167937],"genre_scores_gemma":[0.9915943,0.000004918219,0.00043366716,0.00023497123,0.00006701239,0.0000034244338,6.1907e-8,0.0000028328814,0.0076587675],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952537,0.000010207366,0.00013012454,0.000098877994,0.00012673766,0.00010871045],"domain_scores_gemma":[0.9995765,0.000014736888,0.000042572945,0.00031432012,0.000033611548,0.00001822922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082546554,0.0000504878,0.00006853491,0.000024926368,0.00006742219,0.00002619596,0.00042939538,0.000029323533,0.00009243145],"category_scores_gemma":[0.0000014306256,0.00002849538,0.00004936803,0.00018980457,0.00001490883,0.00013541621,0.00004743315,0.000060854763,0.00004722469],"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.000010822933,0.00036911716,0.0035688402,0.00014040165,0.00010768157,0.0000035490104,0.0065495986,0.18196149,0.0012207573,0.21366312,0.41396818,0.17843643],"study_design_scores_gemma":[0.00008097373,0.00003455892,0.0004852218,0.000014009568,8.250623e-7,0.000010674961,0.000032274813,0.99402595,0.0005547983,0.000032591077,0.004672305,0.000055805693],"about_ca_topic_score_codex":0.000010630069,"about_ca_topic_score_gemma":0.00003801836,"teacher_disagreement_score":0.81206447,"about_ca_system_score_codex":0.000012911286,"about_ca_system_score_gemma":0.0000046930973,"threshold_uncertainty_score":0.11620079},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879714,0.0015399933,0.0039505446,0.0007944917,0.004013818,0.0006141719,0.000003785088,0.000042549884,0.0010692008],"genre_scores_gemma":[0.9995724,0.000058018646,0.00006600881,0.00013309435,0.000013777679,0.000037423433,4.1182375e-7,0.000012384948,0.000106512074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973923,0.0010109306,0.00050109834,0.00036626324,0.0004299196,0.00029949908],"domain_scores_gemma":[0.99736303,0.00070376927,0.00040512034,0.001231077,0.00023702411,0.00005996356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019667586,0.00022097096,0.0004139267,0.00011026462,0.0004077873,0.0000843305,0.0009522494,0.00010826296,0.000005950053],"category_scores_gemma":[0.00017748619,0.00011172143,0.0003888755,0.0014102829,0.00073311053,0.00019153237,0.00021210073,0.0002924397,0.0000010594073],"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.000022634476,0.00008512485,0.0010880989,0.000021382528,0.00010263815,0.0000010044304,0.0012683371,0.00010643415,0.00022963752,0.9963041,0.0006181506,0.00015243582],"study_design_scores_gemma":[0.00195806,0.0001901899,0.004847994,0.000094958734,0.000042888845,0.00007734248,0.00036301636,0.001969036,0.004016176,0.9859525,0.0002990653,0.00018876958],"about_ca_topic_score_codex":0.00022495266,"about_ca_topic_score_gemma":0.000049964223,"teacher_disagreement_score":0.011600924,"about_ca_system_score_codex":0.00001206315,"about_ca_system_score_gemma":0.000043166805,"threshold_uncertainty_score":0.45558676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19277976,0.00006980285,0.7999189,0.0000498132,0.00085869664,0.00011309136,0.0000015535492,0.00014959439,0.006058802],"genre_scores_gemma":[0.99389297,0.00004841821,0.0023101084,0.0001020831,0.00008626017,0.000013159231,0.0000034754617,0.000007307171,0.003536198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859095,0.000092977316,0.0004897757,0.0003665889,0.00019974461,0.0002599547],"domain_scores_gemma":[0.99889815,0.00010339372,0.00018956115,0.000580855,0.00015450234,0.00007351574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030791026,0.00015276854,0.000362661,0.00040290883,0.0001015206,0.00008512446,0.00048420092,0.00009785038,0.0002466222],"category_scores_gemma":[0.000020160262,0.00012816345,0.00023580753,0.001303131,0.00002874077,0.00043988816,0.00010906971,0.00012867314,0.000027600507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037085967,0.00053235685,0.068741746,0.00006843096,0.0021608335,0.000015601618,0.00482641,0.6891436,0.00040343744,0.014515786,0.007877903,0.21167679],"study_design_scores_gemma":[0.00022620574,0.00009537283,0.011016493,0.000018579527,0.000057882222,0.0000052763894,0.000061751954,0.9873715,0.00014341515,0.0000028112938,0.00085053843,0.00015017128],"about_ca_topic_score_codex":0.00019940975,"about_ca_topic_score_gemma":0.00021372392,"teacher_disagreement_score":0.80111325,"about_ca_system_score_codex":0.00004911084,"about_ca_system_score_gemma":0.0000033243216,"threshold_uncertainty_score":0.52263534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7595573,0.00010198718,0.14714983,0.00023912582,0.0005308618,0.00016729883,3.3565905e-7,0.000042590007,0.09221066],"genre_scores_gemma":[0.99944085,0.000012158116,0.00007956116,0.00006090125,0.00003789375,0.0000023144444,6.7556506e-8,0.000002243055,0.0003640366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994325,0.000098150194,0.00019595512,0.00009659917,0.00008199144,0.00009479527],"domain_scores_gemma":[0.9994469,0.00019579976,0.00007437207,0.0002384863,0.000028938444,0.000015455274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002553866,0.00005321043,0.00010585291,0.00006032465,0.00001848768,0.000013728243,0.00012751334,0.000035883288,0.00011172116],"category_scores_gemma":[0.000013155089,0.000029221106,0.00008501847,0.00031388577,0.0000146797975,0.00008359379,0.000021652782,0.000085581785,0.0000051498023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047050766,0.00055471814,0.0061331186,0.000016053484,0.00010215083,0.00001678367,0.0025018072,0.54354864,0.0008217846,0.3601957,0.06964502,0.016417151],"study_design_scores_gemma":[0.00007834355,0.00013116586,0.004760915,0.000029373923,4.4873067e-7,0.000009451317,0.000014943829,0.9941333,0.00019218164,0.00058965635,0.000024733,0.000035498586],"about_ca_topic_score_codex":0.00037172504,"about_ca_topic_score_gemma":0.000031293628,"teacher_disagreement_score":0.45058462,"about_ca_system_score_codex":0.000020490805,"about_ca_system_score_gemma":0.000004056983,"threshold_uncertainty_score":0.12232683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37358063,0.00003322201,0.58447653,0.0010988471,0.0027618601,0.008388533,0.00015218984,0.0005209066,0.028987277],"genre_scores_gemma":[0.99237114,0.000002989556,0.0011315093,0.00013755048,0.0007635984,0.005134817,0.000027235452,0.00004995596,0.00038123093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556726,0.0003933315,0.0011156475,0.0010183019,0.0015411329,0.00036434495],"domain_scores_gemma":[0.99535215,0.0012219357,0.00064548134,0.0013641559,0.0012591744,0.00015712153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027081145,0.0004080115,0.00049140846,0.0006716898,0.00036768845,0.00022516567,0.0013220509,0.00016039069,0.000030909276],"category_scores_gemma":[0.00015388546,0.0003636158,0.00036176777,0.00060951215,0.000060396043,0.00015049975,0.00008278742,0.00028502243,0.00027416256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036919292,0.0041355602,0.000076615754,0.00012441429,0.001494127,0.00011583563,0.006613216,0.5581494,0.001570152,0.36133358,0.0026325756,0.06338533],"study_design_scores_gemma":[0.03420097,0.010356059,0.00083460246,0.007878298,0.0012904159,0.008306859,0.032647565,0.8382404,0.014061626,0.03558181,0.011622443,0.0049789846],"about_ca_topic_score_codex":0.0003201508,"about_ca_topic_score_gemma":0.0001979958,"teacher_disagreement_score":0.61879045,"about_ca_system_score_codex":0.0008629236,"about_ca_system_score_gemma":0.00020441905,"threshold_uncertainty_score":0.99988157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16087005,0.00063513673,0.83580303,0.0010572876,0.0009149934,0.00015571923,4.193302e-7,0.000032321015,0.00053103815],"genre_scores_gemma":[0.9879782,0.000052596624,0.010982148,0.0008199732,0.00013641738,0.000014692378,4.7025995e-7,0.000003906978,0.000011569175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798465,0.0007685742,0.00040010965,0.00036611877,0.00023054951,0.00025000784],"domain_scores_gemma":[0.9957001,0.0034811778,0.00025465133,0.00021463164,0.00023464291,0.000114780785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024735478,0.00013369966,0.00022991713,0.000035930232,0.00029186578,0.00023230989,0.00019141249,0.00005383236,0.0000010979112],"category_scores_gemma":[0.0011574909,0.00010343825,0.000034392364,0.0005053392,0.0000921157,0.0006937756,0.00023006788,0.00017754488,0.000003997057],"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.00010378385,0.00008844761,0.0016239857,0.00008463544,0.000067497946,0.0000063703583,0.033990167,0.25084418,0.00022228702,0.3626599,0.0013275068,0.34898123],"study_design_scores_gemma":[0.0002355192,0.00023492263,0.0023280594,0.0001053846,0.00001698572,0.000093188144,0.0022076436,0.9855281,0.00034933322,0.0013457382,0.007285312,0.0002698091],"about_ca_topic_score_codex":0.000075505064,"about_ca_topic_score_gemma":0.000011853734,"teacher_disagreement_score":0.8271082,"about_ca_system_score_codex":0.000012328731,"about_ca_system_score_gemma":0.000020521758,"threshold_uncertainty_score":0.42180893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046709977,0.000032430504,0.97261775,0.00008755064,0.0017442009,0.00024493277,0.0000014564233,0.00011138375,0.024693212],"genre_scores_gemma":[0.87970525,0.000005443825,0.10514432,0.0006881449,0.00008521042,0.00009563035,8.029585e-7,0.000012415524,0.0142627815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896336,0.000059586568,0.00023024161,0.00029088501,0.00016104593,0.00029489503],"domain_scores_gemma":[0.99941856,0.00009327933,0.000060644248,0.00027035864,0.00007852198,0.000078657795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053108606,0.00010806486,0.00013210477,0.00005093918,0.000121950376,0.0001862633,0.00024295143,0.000037907932,0.00008285705],"category_scores_gemma":[0.000014829961,0.00008449607,0.00008400453,0.00014077398,0.000009253117,0.0002240216,0.000034381075,0.00005745695,0.000043710137],"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.000008451276,0.0003418359,0.00026466767,0.000049101047,0.0001884724,0.000038847706,0.0041985414,0.0047459104,0.003125597,0.6402759,0.124079205,0.22268346],"study_design_scores_gemma":[0.0006662713,0.00023680918,0.00001704644,0.000048932237,0.000003162737,0.000041514348,0.00019357525,0.7608513,0.012848155,0.004615277,0.22011514,0.00036281516],"about_ca_topic_score_codex":0.000010971165,"about_ca_topic_score_gemma":0.0000063828656,"teacher_disagreement_score":0.8792381,"about_ca_system_score_codex":0.00006182545,"about_ca_system_score_gemma":0.00003251563,"threshold_uncertainty_score":0.34456497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00235844,0.000008264658,0.99265975,0.00031647133,0.00039221995,0.0002481455,1.2789059e-7,0.000070989736,0.0039455905],"genre_scores_gemma":[0.9398811,3.8853779e-7,0.058330957,0.0006853526,0.000070655326,0.000016145008,5.60314e-7,0.0000031727686,0.0010116821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995508,0.000053960037,0.00009481766,0.00013900886,0.000078552715,0.00008284745],"domain_scores_gemma":[0.9993125,0.00039525377,0.00002737388,0.00013105883,0.000087213746,0.00004659251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004641299,0.000048094036,0.0000652042,0.000027191445,0.00003565757,0.00023218285,0.00009025516,0.00002937597,0.000002158516],"category_scores_gemma":[0.00006796094,0.00003668407,0.00001526363,0.000050816987,0.0000041290123,0.0003700677,0.000020501939,0.000022719558,0.000013599755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024471537,0.000014002411,0.0000042564543,0.0000028681202,0.000005089091,5.487021e-7,0.0008143978,0.85058266,0.000039103135,0.11994895,0.007928246,0.020635415],"study_design_scores_gemma":[0.00027913938,0.00021653593,0.000010124811,0.0000061579176,7.4993244e-7,0.0000023018865,0.00003697896,0.9896298,0.00026200683,0.0031718994,0.0063301604,0.000054111835],"about_ca_topic_score_codex":0.0000038655444,"about_ca_topic_score_gemma":0.0000020160155,"teacher_disagreement_score":0.93752265,"about_ca_system_score_codex":0.000014920721,"about_ca_system_score_gemma":0.00001758899,"threshold_uncertainty_score":0.22389445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863824,0.0009497465,0.0011047202,0.0008810345,0.0065497844,0.00083693693,0.0000064002274,0.0008804446,0.0024085254],"genre_scores_gemma":[0.9979751,0.00008585185,0.0007064441,0.0007851224,0.000021533593,0.0001308333,0.000016305512,0.000049705955,0.00022911931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959593,0.00039458243,0.000849701,0.0011298722,0.0006391534,0.0010274071],"domain_scores_gemma":[0.9971703,0.00030149045,0.00027807007,0.0011324451,0.00065143313,0.00046625582],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006054486,0.0005853381,0.0007133052,0.00045335336,0.00064925157,0.001069364,0.001338194,0.00033540302,0.00009591],"category_scores_gemma":[0.00010001965,0.0005426203,0.00026304778,0.0016801133,0.0001969846,0.0012959451,0.00039214033,0.00050280883,0.00014946237],"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.000013938442,0.00013020959,0.0083278185,0.00003377184,0.0001585345,0.000040883067,0.0010812671,0.000036428,0.002130779,0.97444415,0.011995381,0.001606822],"study_design_scores_gemma":[0.0043166587,0.00069639075,0.05568743,0.0003976318,0.0000603112,0.00035109528,0.00052929675,0.060058344,0.0010769555,0.86933887,0.0057380334,0.0017489786],"about_ca_topic_score_codex":0.0012261269,"about_ca_topic_score_gemma":0.000109579276,"teacher_disagreement_score":0.105105296,"about_ca_system_score_codex":0.00008084872,"about_ca_system_score_gemma":0.00008497028,"threshold_uncertainty_score":0.99996763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043308508,0.000039979066,0.97950417,0.00026847346,0.0011167397,0.00021793571,0.0000010316787,0.0001348272,0.018283745],"genre_scores_gemma":[0.44087794,0.0000041372514,0.5478716,0.0009956558,0.00036868715,0.000080620055,0.000003318756,0.000013259274,0.009784808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926573,0.000053027798,0.00014652012,0.00023726794,0.000100212485,0.00019726029],"domain_scores_gemma":[0.99952346,0.00006667068,0.000038433158,0.00024912573,0.00007130403,0.000051021812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002637768,0.00008301292,0.00009693114,0.0000470021,0.00010709843,0.000107691114,0.0002122642,0.000053806663,0.000055412744],"category_scores_gemma":[0.000021928274,0.00006442127,0.00008153569,0.00014746471,0.0000087726385,0.00013338271,0.000020124946,0.000060650647,0.000041550215],"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.000002961004,0.000046635065,0.000031806918,0.000014237974,0.000022085249,0.0000025848874,0.0005890015,0.0011870333,0.000683847,0.7670379,0.029077405,0.20130445],"study_design_scores_gemma":[0.000501364,0.00020004429,0.000042525335,0.000018167542,0.0000034430568,0.00010217221,0.00006793201,0.38525695,0.003456618,0.034094077,0.5760093,0.00024743736],"about_ca_topic_score_codex":0.000014559508,"about_ca_topic_score_gemma":0.000019415578,"teacher_disagreement_score":0.7329439,"about_ca_system_score_codex":0.000022321277,"about_ca_system_score_gemma":0.000020619857,"threshold_uncertainty_score":0.26270232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.579126,0.0001465211,0.41549638,0.00017289988,0.00400749,0.0004137025,0.000005750881,0.0001498177,0.00048145387],"genre_scores_gemma":[0.9880298,0.000002780405,0.011719524,0.00007509311,0.000047253507,0.000045745397,0.0000030144417,0.0000128858355,0.00006390635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986262,0.00012192998,0.0003366655,0.00039646943,0.00022470672,0.00029407814],"domain_scores_gemma":[0.9986525,0.00015144276,0.00016841282,0.0006908446,0.0002284017,0.000108372136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071458815,0.0001473402,0.00027599107,0.00011686786,0.00014826554,0.00007129426,0.0006244924,0.00009659427,0.0000050815916],"category_scores_gemma":[0.00002325379,0.00014121358,0.00014848358,0.00033325597,0.000047011858,0.00026516017,0.00006899898,0.00009351891,0.0000091133625],"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.000005407753,0.00032686655,0.00012003603,0.0000111592335,0.0000251118,0.0000011833106,0.00039015786,0.0010952441,0.000635321,0.9432889,0.0013852771,0.052715316],"study_design_scores_gemma":[0.0011724521,0.00045715744,0.00082741294,0.0000321315,0.000009420082,0.000013791449,0.000043423894,0.89093506,0.011117873,0.089985795,0.0051531326,0.00025236577],"about_ca_topic_score_codex":0.000031033804,"about_ca_topic_score_gemma":0.000007905341,"teacher_disagreement_score":0.8898398,"about_ca_system_score_codex":0.00005788184,"about_ca_system_score_gemma":0.00003144038,"threshold_uncertainty_score":0.5758523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827253,0.000116599665,0.0017907538,0.00044230276,0.0027985473,0.0001843156,0.0000032309158,0.00009695413,0.011841994],"genre_scores_gemma":[0.9991186,0.000016421222,0.00056908134,0.00008475579,0.000032195618,0.000010569896,0.0000013621703,0.000011081289,0.00015588685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987005,0.00010590475,0.00042622714,0.00026948014,0.0002679234,0.00022999433],"domain_scores_gemma":[0.99862593,0.00026836773,0.00027753686,0.0005286924,0.00023175021,0.00006772861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030356727,0.00014530763,0.00032659838,0.00011167172,0.00006488683,0.00003836538,0.0005125456,0.00010050997,0.000049372866],"category_scores_gemma":[0.00005049833,0.00013271972,0.00012228703,0.00039699473,0.000059867147,0.0002856584,0.000068720976,0.0001391421,0.000058155056],"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.000029008663,0.0003375361,0.004596228,0.000023991806,0.00005713173,0.0000044713684,0.0003981593,0.00016257956,0.000878509,0.9841734,0.0032681746,0.0060707917],"study_design_scores_gemma":[0.0071118064,0.0015455963,0.039621573,0.00084686413,0.000062697116,0.00018546607,0.0004052215,0.021361196,0.18676223,0.7224347,0.018347804,0.0013148615],"about_ca_topic_score_codex":0.00010469429,"about_ca_topic_score_gemma":0.000026251062,"teacher_disagreement_score":0.26173872,"about_ca_system_score_codex":0.000030779283,"about_ca_system_score_gemma":0.000034159617,"threshold_uncertainty_score":0.54121536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029414047,0.000035134988,0.9083183,0.0002722554,0.00025667576,0.00004291088,4.9955986e-7,0.000065876615,0.06159433],"genre_scores_gemma":[0.9896777,3.6766326e-7,0.007970372,0.00009324835,0.00009220693,0.0000022082957,6.073755e-7,0.0000022161291,0.0021610656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999544,0.000011960958,0.00014892434,0.000111858644,0.00009230773,0.0000909104],"domain_scores_gemma":[0.9997124,0.000016598256,0.000030114124,0.00019150476,0.000033680302,0.000015667596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007798003,0.000045587527,0.00008335365,0.00003885805,0.000020053498,0.000015050008,0.00021273388,0.000026188682,0.000035630674],"category_scores_gemma":[9.846102e-7,0.000032855933,0.000052330182,0.00012730152,0.000011147241,0.000057149686,0.000013859044,0.000037005317,0.000009076796],"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.0000042164365,0.000064059175,0.0024689068,0.000018142726,0.000010401477,0.0000103300445,0.00023666797,0.0063419347,0.005093537,0.97011304,0.009631944,0.0060068048],"study_design_scores_gemma":[0.0025435262,0.00077358383,0.091465995,0.00024811964,0.00002551257,0.0007804335,0.00019425985,0.36456782,0.053388245,0.15664718,0.32776272,0.0016026241],"about_ca_topic_score_codex":0.0004523168,"about_ca_topic_score_gemma":0.00018916982,"teacher_disagreement_score":0.96026367,"about_ca_system_score_codex":0.0000041016465,"about_ca_system_score_gemma":0.0000100005045,"threshold_uncertainty_score":0.13398261},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011311137,0.00011038193,0.9673254,0.00022430361,0.00068176945,0.00006476763,0.0000026333664,0.000087335735,0.030372279],"genre_scores_gemma":[0.9571897,0.0000060119314,0.040948343,0.00009802762,0.00013998832,0.000012960454,2.59153e-7,0.00000497381,0.0015997478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911654,0.00006673116,0.0002517983,0.00021498221,0.00020223996,0.00014773075],"domain_scores_gemma":[0.9992758,0.00016048235,0.00008921076,0.00038029917,0.000043092543,0.000051139326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011656307,0.0000827959,0.00017691198,0.000049647988,0.000044188797,0.00006282069,0.00036507015,0.000046174708,0.00043439402],"category_scores_gemma":[0.000014167007,0.0000665045,0.00007143224,0.00014001584,0.000015150075,0.00015296729,0.000058231893,0.000040953728,0.00014031967],"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.0000020481011,0.00057989155,0.00016031337,0.000024797631,0.00016682745,0.00002416733,0.0018084648,0.0010275813,0.007658313,0.035224237,0.041702904,0.91162044],"study_design_scores_gemma":[0.00008857558,0.000059273007,0.00003876686,0.000060011167,0.000005234555,0.00000998788,0.00008269551,0.9660811,0.028216384,0.00027460902,0.004959046,0.00012432066],"about_ca_topic_score_codex":0.00024177096,"about_ca_topic_score_gemma":0.000009473331,"teacher_disagreement_score":0.9650535,"about_ca_system_score_codex":0.00004298639,"about_ca_system_score_gemma":0.0000036938466,"threshold_uncertainty_score":0.475631},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97714436,0.00014116555,0.009254913,0.00039925476,0.0034614615,0.00020812043,0.0000025033503,0.00015965589,0.009228558],"genre_scores_gemma":[0.9995204,0.0000083676805,0.00025493448,0.00008837484,0.000013854242,0.000011781652,0.0000011475404,0.000008198681,0.00009290719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880123,0.00015289067,0.0002958699,0.0002918559,0.00022085753,0.00023727253],"domain_scores_gemma":[0.9989925,0.00020015423,0.000120523495,0.00041189438,0.00019467209,0.000080265745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023152465,0.00013502018,0.00025668746,0.000121372395,0.00008061966,0.000040494793,0.0004583877,0.000092129754,0.000012019306],"category_scores_gemma":[0.00003735612,0.00012927756,0.00011295713,0.0005822149,0.000045904653,0.0003160842,0.00005756538,0.00014831204,0.00001738593],"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.000011811205,0.00015979962,0.00079288986,0.000008191167,0.000038680846,0.0000047815615,0.0007805773,0.00006530663,0.0011377851,0.99043036,0.0013917529,0.0051780655],"study_design_scores_gemma":[0.0058844993,0.0012422178,0.04245285,0.00023606575,0.000048729915,0.00009731327,0.00025537095,0.3305272,0.04076482,0.56797457,0.009337779,0.0011785927],"about_ca_topic_score_codex":0.00010044826,"about_ca_topic_score_gemma":0.00002683415,"teacher_disagreement_score":0.4224558,"about_ca_system_score_codex":0.000050267507,"about_ca_system_score_gemma":0.000049091723,"threshold_uncertainty_score":0.5271786},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016316115,0.0013264862,0.107283086,0.0003284886,0.004795815,0.00051381654,0.0000032774287,0.00041459265,0.8851713],"genre_scores_gemma":[0.37646005,0.00001682577,0.00018717306,0.0005038606,0.0014508731,0.000044798566,0.000011649376,0.000062237596,0.62126255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965741,0.000103876766,0.0012861886,0.0009113652,0.0005684805,0.00055597175],"domain_scores_gemma":[0.99774647,0.00009058948,0.00081102445,0.00083637267,0.0003602514,0.00015530537],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008353257,0.0005715916,0.0008385471,0.00042588168,0.00014159617,0.00042590135,0.001896946,0.0019204785,0.0000862494],"category_scores_gemma":[0.000048955182,0.0004713781,0.00043186115,0.00006494409,0.00031128965,0.00096329796,0.0005947388,0.002216746,0.00002608216],"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.000043546625,0.000017833076,0.000025331276,0.000107436856,0.00021051835,0.000020187214,0.0004317766,0.0008000255,0.00021083764,0.63783777,0.3412579,0.019036835],"study_design_scores_gemma":[0.0006691742,0.00033314677,0.000014085696,0.0015321578,0.000084296014,0.00024724784,0.000070215094,0.036191013,0.0005688929,0.041833535,0.91699183,0.0014644184],"about_ca_topic_score_codex":0.00010976675,"about_ca_topic_score_gemma":0.000020772404,"teacher_disagreement_score":0.59600425,"about_ca_system_score_codex":0.0002216869,"about_ca_system_score_gemma":0.00012809632,"threshold_uncertainty_score":0.9997738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035731366,0.0017598672,0.98867375,0.001661006,0.0012276105,0.000444102,0.000029753526,0.00042812905,0.005740039],"genre_scores_gemma":[0.6433927,0.00040157762,0.32592627,0.00062491884,0.0077736136,0.004105925,0.00029918057,0.00008213609,0.017393691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987918,0.00010298131,0.00027599907,0.00042561206,0.0001201454,0.00028344523],"domain_scores_gemma":[0.9991257,0.00013700225,0.000087094595,0.0004214009,0.00010528532,0.00012350846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028142202,0.00016901839,0.0002089439,0.00011495799,0.00034226876,0.0001773672,0.00024391108,0.00011902622,0.000030125986],"category_scores_gemma":[0.000009069284,0.00013382845,0.000089137146,0.0006073177,0.000027302269,0.00012899484,0.000032223743,0.000115277326,0.0000071364216],"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.00000783489,0.00005196973,0.00008283689,0.000043252563,0.00006174314,0.000001299254,0.00045328445,0.000489962,0.000027028083,0.5123063,0.028376745,0.45809776],"study_design_scores_gemma":[0.00032930012,0.000036704023,0.00012433108,0.000011225093,0.000008224107,0.00007481612,0.00014704578,0.08858157,0.000052708692,0.0003776938,0.9100993,0.00015704948],"about_ca_topic_score_codex":0.000034391574,"about_ca_topic_score_gemma":0.00011201946,"teacher_disagreement_score":0.88172257,"about_ca_system_score_codex":0.000046292265,"about_ca_system_score_gemma":0.000019133038,"threshold_uncertainty_score":0.5457366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001412122,0.000020684718,0.8870871,0.00007942465,0.0005164184,0.000094863826,6.563132e-7,0.00015668289,0.110632025],"genre_scores_gemma":[0.9894169,8.580231e-7,0.009302795,0.00018357404,0.000031142525,0.00003521238,1.7686439e-7,0.0000047864896,0.0010245297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917716,0.00008086565,0.00015677193,0.00023303041,0.00015748068,0.00019466881],"domain_scores_gemma":[0.99945855,0.00006756018,0.000040703344,0.00027854505,0.00007768876,0.000076946235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023860147,0.00009127756,0.00012425272,0.000038712664,0.00008507152,0.00011449998,0.00022494297,0.000041799914,0.00008280665],"category_scores_gemma":[0.000006645479,0.00006140033,0.00003337378,0.0001845087,0.000058069683,0.00016584808,0.000020397374,0.000060095048,0.00013458251],"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":[9.9705e-7,0.000016897138,0.0014545856,0.000012023878,0.000016288408,0.000026521622,0.00009522355,0.00035938786,0.000002284546,0.9873483,0.0034533753,0.0072141206],"study_design_scores_gemma":[0.0060680737,0.0018740556,0.004502176,0.0016137181,0.000054886517,0.009556611,0.013732776,0.6858502,0.019301847,0.0016695147,0.25253102,0.003245089],"about_ca_topic_score_codex":0.000050162755,"about_ca_topic_score_gemma":0.00005481956,"teacher_disagreement_score":0.9880048,"about_ca_system_score_codex":0.000052480027,"about_ca_system_score_gemma":0.000044361008,"threshold_uncertainty_score":0.2503833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93953454,0.00055523764,0.012591602,0.0003977795,0.012309672,0.0003377023,0.0000011903808,0.00033750205,0.033934742],"genre_scores_gemma":[0.99835753,0.000018057712,0.00056051783,0.00013726996,0.000025623085,0.000020726287,7.0603414e-7,0.000013317511,0.00086622237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998382,0.00029554375,0.00027303045,0.0004845865,0.00021093935,0.0003539028],"domain_scores_gemma":[0.9987242,0.00027489083,0.00011025664,0.0005941836,0.00014090593,0.00015556425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004474246,0.00018601619,0.00025084597,0.000110459594,0.00024393287,0.00022344991,0.00038471253,0.00013085963,0.000015943599],"category_scores_gemma":[0.00022013737,0.00017680688,0.00006511484,0.00053502095,0.000049524228,0.0003993147,0.00011829107,0.0002090083,0.000055166875],"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.0000043862196,0.000073006115,0.002345456,0.000009163157,0.000020028416,0.00001604157,0.0002614788,0.0000043111413,0.0002971942,0.985198,0.009407981,0.0023629246],"study_design_scores_gemma":[0.0040935683,0.00081499276,0.035374332,0.00013612697,0.000029230994,0.0003814695,0.00023486833,0.025094708,0.0042038066,0.8431521,0.08516076,0.0013240193],"about_ca_topic_score_codex":0.000046650108,"about_ca_topic_score_gemma":0.000011054011,"teacher_disagreement_score":0.14204592,"about_ca_system_score_codex":0.000057774967,"about_ca_system_score_gemma":0.00006583749,"threshold_uncertainty_score":0.7209975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49094656,0.000017905924,0.5083074,0.00001936497,0.000026798794,0.00005190158,2.4474267e-7,0.000020348958,0.0006094767],"genre_scores_gemma":[0.971265,0.000009964973,0.028563693,0.000028516162,0.000011547498,0.0000030091287,4.477769e-7,0.0000033155966,0.00011451106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991627,0.00006853142,0.00025143105,0.00021823686,0.00016543912,0.00013370185],"domain_scores_gemma":[0.9993262,0.000046284706,0.0001231443,0.0003436362,0.00010911639,0.000051612093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029625616,0.00008930824,0.00029286867,0.00016138073,0.00005797388,0.000035865807,0.0002492615,0.000031712323,0.000026666286],"category_scores_gemma":[0.000002496541,0.00006450276,0.00003930435,0.00066208735,0.000067707,0.00031886736,0.000053591466,0.000048493603,0.00000144677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029366734,0.0010222628,0.16781636,0.0004517923,0.0036379735,0.000025335507,0.01937516,0.53921735,0.009818064,0.07426099,0.0007284933,0.18335253],"study_design_scores_gemma":[0.00014646525,0.0003725508,0.018347638,0.000016837928,0.000039072198,0.000009307518,0.00004571648,0.9774883,0.0034107391,0.000024731306,0.000013060954,0.000085593674],"about_ca_topic_score_codex":0.000101731595,"about_ca_topic_score_gemma":0.000084404186,"teacher_disagreement_score":0.48031846,"about_ca_system_score_codex":0.000011940064,"about_ca_system_score_gemma":0.0000053127555,"threshold_uncertainty_score":0.2630346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94764745,0.00018498852,0.03059711,0.00021428391,0.0051004137,0.00027945996,0.0000060112548,0.00020691629,0.015763361],"genre_scores_gemma":[0.99952257,0.0000045389716,0.00021091638,0.00003964504,0.000023590354,0.00001517376,0.0000037269774,0.000010010892,0.00016984322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985852,0.00019666257,0.00036462047,0.00034299595,0.00024125336,0.00026926352],"domain_scores_gemma":[0.99884814,0.00021770223,0.00016434409,0.00045842276,0.00025260623,0.000058757167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002803721,0.00015424925,0.0002925843,0.00014857062,0.00011779359,0.000059107322,0.0004599481,0.000110458204,0.000008440507],"category_scores_gemma":[0.000027374183,0.00014939407,0.00013998931,0.0007982892,0.00006425305,0.0003155918,0.000061856,0.000157275,0.000014693843],"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.000010180812,0.0001531795,0.0017364883,0.000011571988,0.000020077972,0.000011018849,0.00022185541,0.00004175322,0.0014690121,0.9907514,0.0049953577,0.0005781099],"study_design_scores_gemma":[0.0022762388,0.0004958407,0.06801967,0.00010439826,0.000021140479,0.00004180358,0.000076886245,0.01864924,0.016837291,0.88948095,0.0034628233,0.0005337263],"about_ca_topic_score_codex":0.0005340677,"about_ca_topic_score_gemma":0.000049991104,"teacher_disagreement_score":0.10127046,"about_ca_system_score_codex":0.00004670235,"about_ca_system_score_gemma":0.000052933967,"threshold_uncertainty_score":0.60921127},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62552553,0.000013845333,0.37162882,0.00033572607,0.0001967613,0.00011638845,2.7915826e-7,0.000038414488,0.002144218],"genre_scores_gemma":[0.994544,4.9459305e-7,0.0050880755,0.00022402333,0.000029069655,0.000009167202,5.809773e-7,0.0000024905285,0.000102082086],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937695,0.00005036126,0.00021052231,0.00014242348,0.00010877032,0.000110983],"domain_scores_gemma":[0.9996486,0.00001874455,0.000050810908,0.00020688579,0.00004774745,0.000027269953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017526903,0.00004794094,0.00008007383,0.000080200756,0.000019348694,0.00003765084,0.00018646047,0.00002512279,0.00041605224],"category_scores_gemma":[0.0000018040731,0.000040983647,0.000025222562,0.00022979733,0.0000059161775,0.00029273916,0.000017634076,0.000035929814,0.000021242433],"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.000019612402,0.0007817963,0.4618819,0.00007694166,0.000036326433,0.000022665306,0.007936208,0.01237039,0.013543069,0.31498295,0.005881686,0.18246643],"study_design_scores_gemma":[0.00080709846,0.00019324776,0.022184344,0.000016878246,0.0000010105542,0.0000028010852,0.0003498628,0.96874255,0.006930736,0.00018789797,0.00047721807,0.00010632712],"about_ca_topic_score_codex":0.00036401206,"about_ca_topic_score_gemma":0.001188693,"teacher_disagreement_score":0.9563722,"about_ca_system_score_codex":0.000019827794,"about_ca_system_score_gemma":0.000009887177,"threshold_uncertainty_score":0.45554802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006029253,0.00008037504,0.97234285,0.0008006308,0.00054282957,0.00013326164,7.245139e-8,0.00010104726,0.025395982],"genre_scores_gemma":[0.9625731,0.000025519219,0.014469822,0.00088556163,0.00010031162,0.000016583152,1.8227337e-7,0.0000063830907,0.021922516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.00007547864,0.00018624197,0.00026886017,0.00021941598,0.00021669678],"domain_scores_gemma":[0.9994477,0.00003672012,0.000043689313,0.00039476913,0.000012051094,0.00006506496],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023185633,0.000093733855,0.00009133123,0.00003249894,0.00010105259,0.00011285224,0.00035219602,0.00004248922,0.0011798901],"category_scores_gemma":[0.0000023143198,0.00007485436,0.000044491415,0.00008478388,0.000011683562,0.00025667512,0.000094612136,0.000053316613,0.0016256114],"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.000010209197,0.0006501343,0.0008990743,0.000019607975,0.00020110012,0.00006037533,0.0021809945,0.052596983,0.0037858493,0.42117438,0.42061606,0.09780525],"study_design_scores_gemma":[0.00037970225,0.0001684268,0.00027944084,0.000015306441,0.000003664183,0.00003029623,0.000048366946,0.9468114,0.0011789086,0.002457143,0.048367675,0.00025968056],"about_ca_topic_score_codex":0.000020512669,"about_ca_topic_score_gemma":0.0000023270507,"teacher_disagreement_score":0.9619702,"about_ca_system_score_codex":0.000074633404,"about_ca_system_score_gemma":0.0000033374154,"threshold_uncertainty_score":0.99973315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014768799,0.000014949526,0.9791038,0.0041021323,0.0023735943,0.003212382,0.00033591702,0.00046916673,0.008911157],"genre_scores_gemma":[0.91704917,0.000014422698,0.07399091,0.00082204316,0.0015872887,0.004705102,0.0001721583,0.000072993214,0.0015858817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640274,0.00014085446,0.0009863721,0.0011419881,0.00087905116,0.0004490081],"domain_scores_gemma":[0.99675924,0.0010451443,0.00035468466,0.0011207928,0.00043762344,0.00028252328],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006673525,0.00044901966,0.00045876668,0.00050316035,0.00036442155,0.00043348552,0.0016414924,0.00023028693,0.000046288522],"category_scores_gemma":[0.00004071433,0.0004199454,0.00031095394,0.00061566895,0.00003415743,0.00024542207,0.000055223994,0.00025173413,0.002024587],"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.0004686309,0.0006845383,0.000006246391,0.000031244414,0.0003888267,0.000007608904,0.0010805242,0.3260364,0.0026197631,0.5632617,0.010732197,0.094682366],"study_design_scores_gemma":[0.013372573,0.0044243373,0.001687548,0.008475143,0.0002909302,0.00020245502,0.0019212438,0.6198662,0.08256253,0.042781476,0.21824105,0.0061744996],"about_ca_topic_score_codex":0.000385165,"about_ca_topic_score_gemma":0.000051688432,"teacher_disagreement_score":0.9155723,"about_ca_system_score_codex":0.00088341034,"about_ca_system_score_gemma":0.000140702,"threshold_uncertainty_score":0.99982524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06755416,0.00013050082,0.91877085,0.00039695765,0.00068081607,0.00021228897,3.4785958e-7,0.000107553955,0.012146513],"genre_scores_gemma":[0.9676021,0.000025191819,0.017093604,0.0004715263,0.00012243286,0.000015834647,3.162011e-7,0.000005051866,0.014663994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934554,0.000014499014,0.00014643671,0.00023470553,0.00008654677,0.0001722836],"domain_scores_gemma":[0.99954814,0.00008304512,0.00004352149,0.00021628784,0.000037208607,0.00007177436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102610335,0.00009075682,0.00010867781,0.000048402864,0.000097763776,0.000099267534,0.0001705085,0.000057207963,0.00032146586],"category_scores_gemma":[0.000012347603,0.000071862414,0.00003789325,0.000065587985,0.000013066019,0.00020582216,0.00003927651,0.000070516835,0.000048150385],"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.00006254803,0.00006961438,0.00029329813,0.00016434949,0.00007767287,0.0000030893373,0.012338959,0.002131924,0.015736016,0.031743668,0.2332937,0.7040852],"study_design_scores_gemma":[0.0022698338,0.00093729387,0.0012662006,0.00021997782,0.000013768847,0.00022146563,0.00019365364,0.90251034,0.040764514,0.0014420034,0.04927848,0.000882474],"about_ca_topic_score_codex":0.0000073133697,"about_ca_topic_score_gemma":0.000019916019,"teacher_disagreement_score":0.90167725,"about_ca_system_score_codex":0.00001017812,"about_ca_system_score_gemma":0.0000062313925,"threshold_uncertainty_score":0.35198256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007742998,0.00018033283,0.98667234,0.0011583334,0.000613338,0.0002441722,0.0000011329964,0.000078937555,0.0033084047],"genre_scores_gemma":[0.98871857,0.000012813695,0.008469397,0.00045653633,0.00014643841,0.000047128913,0.0000013654347,0.0000041126523,0.0021436133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994582,0.000027196025,0.0001227299,0.00019143823,0.000078219,0.00012222957],"domain_scores_gemma":[0.9996901,0.00006476964,0.000039089617,0.000121702964,0.000039246144,0.000045091394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101738944,0.000065907494,0.00007550775,0.000032773598,0.00008142091,0.00011976717,0.00011234318,0.000028413742,0.00002472324],"category_scores_gemma":[0.00000760546,0.000050609648,0.000033277815,0.000067606285,0.000009236799,0.00012195527,0.000031502608,0.00003782051,0.0000108139675],"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.0000038033058,0.000059233134,0.00040700685,0.000051184477,0.000033798493,0.0000025009201,0.0030879504,0.00034578264,0.0011778097,0.14214481,0.068471745,0.7842144],"study_design_scores_gemma":[0.00084208883,0.00028943655,0.00026704927,0.000033864188,0.0000059507074,0.000085739135,0.00011493061,0.91090214,0.00094830734,0.0013948542,0.08489967,0.00021597811],"about_ca_topic_score_codex":0.000016780219,"about_ca_topic_score_gemma":0.000038997096,"teacher_disagreement_score":0.98097557,"about_ca_system_score_codex":0.000014206112,"about_ca_system_score_gemma":0.0000029985022,"threshold_uncertainty_score":0.20638014},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071194675,0.00027233313,0.98112506,0.006107933,0.0012616435,0.00038643501,0.000010677653,0.00010652109,0.010017445],"genre_scores_gemma":[0.8925922,0.000014508394,0.10124328,0.004000139,0.00052320806,0.000056806006,0.000021494787,0.0000074907,0.0015408732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901277,0.000115952316,0.0001902164,0.00028060534,0.00019333583,0.00020711399],"domain_scores_gemma":[0.997795,0.00042743603,0.000065313034,0.001594686,0.00007849103,0.000039065584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068502384,0.00008617725,0.00008682479,0.00000857793,0.0003817316,0.00010644567,0.0013573337,0.000039722046,0.000052622538],"category_scores_gemma":[0.00003232894,0.000052155207,0.000042664542,0.000175349,0.000024593992,0.00006724203,0.00044406267,0.00006880297,0.000086050546],"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.0000032935202,0.00006430462,0.000016802996,0.000001076989,0.000014401755,3.4745833e-7,0.00006428394,0.05501857,0.0000011884514,0.62441665,0.30753285,0.012866234],"study_design_scores_gemma":[0.00014338682,0.000039693918,0.000061433406,0.000016319169,0.0000017782489,0.000007184132,0.000017817267,0.9140213,0.000003372041,0.000464695,0.08515549,0.00006754467],"about_ca_topic_score_codex":0.00004461427,"about_ca_topic_score_gemma":0.00003767929,"teacher_disagreement_score":0.8918803,"about_ca_system_score_codex":0.000044221313,"about_ca_system_score_gemma":0.000007411808,"threshold_uncertainty_score":0.29360095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019530291,0.00015600216,0.98317033,0.00024098722,0.001200594,0.0002097876,3.4747845e-7,0.00018214597,0.0128867775],"genre_scores_gemma":[0.45154682,0.0000036654408,0.5440726,0.0003296757,0.000193443,0.00004503431,4.5743926e-7,0.00001025524,0.0037980413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900615,0.000039243776,0.00021547331,0.00031675486,0.00012500084,0.0002973581],"domain_scores_gemma":[0.9993768,0.00009585399,0.000055751716,0.00028276135,0.00011564496,0.00007321586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051112194,0.00011274633,0.00014967831,0.000059661503,0.00020966546,0.00026763655,0.00028274194,0.00006338054,0.000037345384],"category_scores_gemma":[0.000035142068,0.00009440211,0.00010624772,0.00017833078,0.000009534072,0.00035040695,0.00003849408,0.000073637806,0.00004938708],"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.0000031490947,0.000084832274,0.00047773545,0.00003698984,0.00006391677,0.0000052308146,0.0010608716,0.0025514169,0.0010082435,0.82068,0.002820646,0.17120695],"study_design_scores_gemma":[0.00034914672,0.00007601597,0.000012816075,0.00003288126,0.0000032787643,0.000053456402,0.00024075717,0.95895463,0.003911702,0.0043499786,0.031810433,0.00020492781],"about_ca_topic_score_codex":0.00005512052,"about_ca_topic_score_gemma":0.0000260307,"teacher_disagreement_score":0.9564032,"about_ca_system_score_codex":0.000040869654,"about_ca_system_score_gemma":0.000055578894,"threshold_uncertainty_score":0.38496062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023326102,0.0018491758,0.98318624,0.0011930894,0.009312193,0.0005456786,0.000003372486,0.000049852988,0.0036271103],"genre_scores_gemma":[0.9833641,0.00014657516,0.013352123,0.0008803541,0.0007311904,0.000011803466,0.0000010234852,0.000030509065,0.0014823398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698347,0.00009351193,0.0006073572,0.0007275016,0.00097369903,0.000614476],"domain_scores_gemma":[0.9967151,0.0005208086,0.00048891595,0.0018866822,0.00029002625,0.000098435004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015376903,0.00037376196,0.0003850735,0.00015510875,0.00053952594,0.00039257793,0.0046392046,0.0001890657,0.0000134507945],"category_scores_gemma":[0.000038222097,0.00020743103,0.00025932927,0.0005468581,0.0007483843,0.00027939634,0.0013705149,0.0005905412,0.000013961877],"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.000023271441,0.0001076408,0.0009190491,0.00009814634,0.00011150011,0.000012314788,0.0038778854,0.083696075,0.00054879824,0.14368464,0.0016097709,0.7653109],"study_design_scores_gemma":[0.0009855618,0.0004017702,0.0013780646,0.002388564,0.00004739627,0.00019083961,0.0000040013488,0.73603153,0.0055214604,0.15533991,0.095888436,0.0018224664],"about_ca_topic_score_codex":0.000027931364,"about_ca_topic_score_gemma":0.00019517251,"teacher_disagreement_score":0.9831308,"about_ca_system_score_codex":0.00017400252,"about_ca_system_score_gemma":0.0001964943,"threshold_uncertainty_score":0.8620873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005946122,0.00022716341,0.9810937,0.0062706526,0.00048700164,0.00024335619,3.8637222e-7,0.0002233188,0.0055082673],"genre_scores_gemma":[0.95860916,0.00001796507,0.040678106,0.00025608373,0.00005930723,0.00009398787,0.0000013246637,0.0000050427416,0.00027902686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933827,0.000021663005,0.00020515616,0.00018111266,0.000051377137,0.0002024395],"domain_scores_gemma":[0.9990561,0.00007482845,0.000050957307,0.0007380428,0.000056889723,0.000023186047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025889176,0.000069615766,0.000116025694,0.0001582879,0.00013026402,0.000073558236,0.0009387411,0.00008092113,0.0000028557772],"category_scores_gemma":[0.000011926096,0.00006328512,0.000037434267,0.00049371424,0.00003424059,0.00017441137,0.00020840924,0.000112800146,0.00000910139],"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.0000018675167,0.000051872685,0.00084966194,0.0000053425492,0.00000791878,0.0000020525813,0.00038742615,0.0084942635,0.00009837585,0.9780342,0.0007253055,0.0113417385],"study_design_scores_gemma":[0.0012782057,0.00019077754,0.0004535081,0.00020337115,0.000003431511,0.00006424873,0.0005386722,0.7323297,0.00032349184,0.13093233,0.13330245,0.0003797818],"about_ca_topic_score_codex":0.00007799838,"about_ca_topic_score_gemma":0.001267053,"teacher_disagreement_score":0.952663,"about_ca_system_score_codex":0.00008066034,"about_ca_system_score_gemma":0.000030673218,"threshold_uncertainty_score":0.25806922},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015670778,0.00023948525,0.9033705,0.00009240556,0.0019362175,0.00015524907,5.1026362e-8,0.00023091499,0.09240808],"genre_scores_gemma":[0.9886369,0.000002251678,0.009932542,0.0002476107,0.00027613883,0.000027485978,3.670284e-7,0.000008235963,0.0008684483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842155,0.00023745814,0.00040914942,0.00034040716,0.00014742189,0.00044400824],"domain_scores_gemma":[0.9992785,0.0001217377,0.00008445302,0.00039130863,0.000052095664,0.00007189638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008437394,0.00014163769,0.00022227778,0.00006059506,0.00014424168,0.00028882074,0.00035368613,0.00009705102,0.000028841941],"category_scores_gemma":[0.000018936526,0.00011778363,0.00006269861,0.0004217469,0.000009843543,0.00027826673,0.000058518293,0.00017141899,0.000024674815],"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.0000010283969,0.000008724028,0.0028407522,0.0000073655438,0.0000062501863,0.000019626928,0.000104332474,0.3679318,0.000002717686,0.6223899,0.006016518,0.0006709466],"study_design_scores_gemma":[0.00017827794,0.000025398534,0.00018995581,0.00012248135,9.555217e-7,0.0000747711,0.00021438909,0.9892451,0.000015253978,0.00025041413,0.009515754,0.00016721939],"about_ca_topic_score_codex":0.00009293185,"about_ca_topic_score_gemma":0.0005035225,"teacher_disagreement_score":0.98706985,"about_ca_system_score_codex":0.00007787083,"about_ca_system_score_gemma":0.00002512263,"threshold_uncertainty_score":0.4803077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017975799,0.000010490793,0.9303382,0.000070178,0.00037484232,0.00033660544,6.08508e-7,0.00026881916,0.06842047],"genre_scores_gemma":[0.8626736,5.622316e-7,0.13425973,0.00025396855,0.00010066238,0.00013825962,2.957878e-7,0.0000075196426,0.0025654382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912405,0.0000395005,0.00021686466,0.00028596437,0.00009938823,0.00023420263],"domain_scores_gemma":[0.9993769,0.0001191246,0.00008352577,0.00022582375,0.00014936291,0.00004525656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040407098,0.00010304995,0.00013518607,0.000047590776,0.0001456084,0.00013629886,0.0002883576,0.00005520609,0.000011480562],"category_scores_gemma":[0.0000826496,0.0000827275,0.000063128384,0.00015088002,0.000013837128,0.00022620366,0.00002695606,0.000059352496,0.000011976057],"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.0000051133557,0.0000307725,0.000041545904,0.00001969513,0.000011747878,0.0000026963148,0.0004634237,0.00003404625,0.00036541198,0.9849465,0.0023883057,0.0116907265],"study_design_scores_gemma":[0.00050862296,0.0009823076,0.00001831204,0.00016814667,0.000011784257,0.00015748442,0.00059695455,0.82501847,0.066583,0.03410709,0.071134195,0.0007136096],"about_ca_topic_score_codex":0.0000067399387,"about_ca_topic_score_gemma":0.000009725676,"teacher_disagreement_score":0.9508394,"about_ca_system_score_codex":0.000030400066,"about_ca_system_score_gemma":0.000048449856,"threshold_uncertainty_score":0.33735296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039591272,0.000059925434,0.98637325,0.00044036025,0.0012501772,0.00018361195,9.550654e-7,0.0002450041,0.0074876035],"genre_scores_gemma":[0.89360154,0.000002125431,0.09215865,0.0004927999,0.00026953776,0.000018615428,5.3397844e-7,0.00001039856,0.013445779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899536,0.0000299242,0.00024168339,0.00029967268,0.00011536171,0.0003179725],"domain_scores_gemma":[0.9993619,0.00011501756,0.000071825205,0.00030968888,0.00007523298,0.00006635205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028326563,0.000108992586,0.00013354249,0.00006428376,0.00021443432,0.00029478033,0.00036785117,0.000053747142,0.000084193256],"category_scores_gemma":[0.00003362046,0.00009048761,0.00009356169,0.00014092117,0.000006558868,0.00037079572,0.00008136589,0.00007915169,0.000080285026],"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.000021144513,0.00093912554,0.0013186574,0.00022046012,0.0001836375,0.00004550401,0.018574847,0.021568736,0.04194192,0.28608996,0.06513438,0.5639616],"study_design_scores_gemma":[0.00029219434,0.00006099063,0.000011792673,0.000022495922,0.0000013565044,0.000009980391,0.00015471771,0.96660745,0.00082744396,0.000072356335,0.031801637,0.0001375568],"about_ca_topic_score_codex":0.000030094998,"about_ca_topic_score_gemma":0.000066197164,"teacher_disagreement_score":0.94503874,"about_ca_system_score_codex":0.000035264464,"about_ca_system_score_gemma":0.0000037695115,"threshold_uncertainty_score":0.36899775},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043979706,0.000015120432,0.98302376,0.001243733,0.0019085668,0.0002027417,8.035437e-7,0.00016537643,0.0090419],"genre_scores_gemma":[0.97573876,1.0498011e-7,0.01658321,0.0029267091,0.00024352316,0.00004811833,0.0000022631657,0.000007947071,0.0044493773],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991424,0.00003826992,0.00019144722,0.00025101122,0.00015325035,0.00022360797],"domain_scores_gemma":[0.9992684,0.00006882604,0.000051801522,0.00034581628,0.00015021878,0.00011494397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040601366,0.000097167176,0.00012230736,0.00007243202,0.00005334767,0.00025862476,0.00040649434,0.0000608754,0.000011957731],"category_scores_gemma":[0.000016583,0.00007638273,0.00007849322,0.0001453376,0.000012257905,0.00032718884,0.000046516674,0.000056376317,0.00006861139],"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.000109045744,0.00020172457,0.009186868,0.000051470986,0.000076020886,0.000016167085,0.0017762526,0.025202697,0.0002411326,0.4655174,0.48491845,0.012702781],"study_design_scores_gemma":[0.00092735304,0.00017216589,0.0001365347,0.000017440214,0.0000019510983,0.000009978036,0.00005519319,0.8941767,0.00040284105,0.0017036677,0.1022162,0.00017995907],"about_ca_topic_score_codex":0.00010841669,"about_ca_topic_score_gemma":0.000061319515,"teacher_disagreement_score":0.9713408,"about_ca_system_score_codex":0.00007020555,"about_ca_system_score_gemma":0.00007046455,"threshold_uncertainty_score":0.31147972},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066664163,0.000071018316,0.8647348,0.00087185716,0.00084044295,0.000092985065,5.219211e-7,0.00024211081,0.12647983],"genre_scores_gemma":[0.96131223,0.000005003159,0.008336129,0.0006595673,0.00015745735,0.000010464724,2.3873667e-7,0.0000053828203,0.029513516],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991192,0.00003378779,0.00016520575,0.0002488102,0.00014431092,0.00028865688],"domain_scores_gemma":[0.9994321,0.000033013745,0.000029925714,0.0003720492,0.000054112024,0.00007878391],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018352098,0.000081041726,0.00010803488,0.00003852603,0.00012880165,0.0001591614,0.00036422926,0.000046945366,0.00089316047],"category_scores_gemma":[0.000007643803,0.00006395752,0.000059143193,0.00022535704,0.000008594943,0.00032157666,0.000110363864,0.00007187848,0.0014286585],"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.0000053899257,0.0007998418,0.004749123,0.00003993754,0.000060362727,0.00006994049,0.0073786117,0.0006055636,0.0010665074,0.42426553,0.5339653,0.02699391],"study_design_scores_gemma":[0.00025352486,0.000033973505,0.00013380215,0.000009640575,0.0000010219443,0.00003878198,0.000076407356,0.90965223,0.00022047535,0.0001807935,0.08929037,0.00010899846],"about_ca_topic_score_codex":0.00005449198,"about_ca_topic_score_gemma":0.00010515221,"teacher_disagreement_score":0.9546458,"about_ca_system_score_codex":0.000020331261,"about_ca_system_score_gemma":0.000003291221,"threshold_uncertainty_score":0.9993488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4878954,0.00010895706,0.48416585,0.016626216,0.0022204667,0.0033781608,0.0000028050426,0.00007370936,0.0055284346],"genre_scores_gemma":[0.99516386,0.0000018651505,0.0011359898,0.0028626416,0.00015963263,0.00008839776,4.5611415e-7,0.0000047083886,0.00058247015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984243,0.00046102033,0.0002638708,0.00021997716,0.0004229311,0.00020787932],"domain_scores_gemma":[0.99857664,0.00024201158,0.00011199788,0.0008954015,0.000151754,0.000022196396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015154453,0.00008916112,0.00009964291,0.000020141677,0.00018194884,0.0002389406,0.0010295354,0.00004122978,0.000027343485],"category_scores_gemma":[0.00009121497,0.000036877907,0.00005154514,0.0005846867,0.000022335431,0.00045129575,0.00009385409,0.00010266703,0.000018912006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028905433,0.00024467678,0.024342306,0.000022955728,0.000027108801,0.0000014528483,0.030164802,0.70059067,0.0001611554,0.0077166557,0.18811055,0.04858875],"study_design_scores_gemma":[0.00017168818,0.00004224668,0.016936474,0.000037437487,0.0000034913614,0.000005770486,0.00015273238,0.9728681,0.00003384239,0.000097505865,0.00958826,0.00006248034],"about_ca_topic_score_codex":0.00025402312,"about_ca_topic_score_gemma":0.0025150825,"teacher_disagreement_score":0.5072684,"about_ca_system_score_codex":0.000024860527,"about_ca_system_score_gemma":0.000015110508,"threshold_uncertainty_score":0.23041096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6652729,0.0002709449,0.26373738,0.00054670934,0.002116302,0.00016775663,2.8863292e-7,0.00026578258,0.06762191],"genre_scores_gemma":[0.99245465,0.00003433008,0.002221754,0.00024351536,0.00022845945,0.0000051236025,2.4539125e-7,0.000004750057,0.004807151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991339,0.000036541584,0.00024355545,0.0001926543,0.00015523071,0.00023813806],"domain_scores_gemma":[0.99943507,0.000041572293,0.00007570862,0.00034381374,0.000057332858,0.00004651716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017973335,0.00008694007,0.00015290431,0.00003214199,0.00007075326,0.00003804448,0.00037696873,0.00005046382,0.00025418098],"category_scores_gemma":[0.0000023885266,0.00006856546,0.00006071856,0.00030868023,0.000022425562,0.00021985211,0.000047670568,0.000072227704,0.00009515446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011726884,0.00012369135,0.0033196176,0.000047296457,0.00005492613,0.0000041006833,0.0007661438,0.75202936,0.00013405696,0.08806957,0.08887738,0.066562116],"study_design_scores_gemma":[0.0001629021,0.000101249905,0.0015767432,0.000027727656,0.0000013810873,0.000015890277,0.000013967503,0.99390453,0.00007439575,0.00004239819,0.003981815,0.00009701684],"about_ca_topic_score_codex":0.000005134679,"about_ca_topic_score_gemma":0.00000886118,"teacher_disagreement_score":0.32718176,"about_ca_system_score_codex":0.000017558501,"about_ca_system_score_gemma":0.0000057670195,"threshold_uncertainty_score":0.2796018},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007826683,0.00004128322,0.89234215,0.0004839148,0.00043084656,0.00007633773,5.1677965e-8,0.00018256308,0.0986162],"genre_scores_gemma":[0.9924189,0.0000054005322,0.005391691,0.0002870998,0.0000730593,0.000009683771,1.058603e-7,0.0000040589453,0.0018100037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994151,0.000026251872,0.00009907406,0.00018639944,0.0001226238,0.00015056434],"domain_scores_gemma":[0.99968225,0.000014641117,0.000022480388,0.00019629116,0.000037727157,0.000046614237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006629799,0.00006766911,0.000070671405,0.000045374705,0.00008698134,0.00009481822,0.00015830778,0.000028319027,0.00020008594],"category_scores_gemma":[0.0000010438357,0.000046987123,0.000030606167,0.00020405407,0.000011218914,0.00021670011,0.000009368492,0.000054406613,0.00013640738],"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.000036420897,0.0005654917,0.0018875638,0.000049709724,0.0001940112,0.00010930362,0.010880988,0.023786759,0.0012976174,0.5130811,0.1183879,0.32972318],"study_design_scores_gemma":[0.00047597507,0.00060051284,0.00059179484,0.00002289094,0.0000044892054,0.00031443013,0.00008747155,0.9621907,0.00071239343,0.00016648493,0.034586467,0.00024642688],"about_ca_topic_score_codex":0.00007071482,"about_ca_topic_score_gemma":0.00013660813,"teacher_disagreement_score":0.9845922,"about_ca_system_score_codex":0.000037888305,"about_ca_system_score_gemma":0.0000047292096,"threshold_uncertainty_score":0.21908008},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007887187,0.00041093287,0.9865558,0.00019375932,0.00038788776,0.00014325774,2.9553952e-8,0.00018145726,0.0042396667],"genre_scores_gemma":[0.9620619,0.00016096667,0.034086213,0.00031808988,0.000118430864,0.000016415737,7.1780256e-8,0.0000047061544,0.0032332307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999293,0.00004571625,0.00015255192,0.00022144422,0.00009282981,0.00019442174],"domain_scores_gemma":[0.99958295,0.000078102334,0.000036900077,0.00019170939,0.00004956382,0.00006075773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000236089,0.00008463293,0.00010648068,0.000035639216,0.00012846364,0.00016521885,0.00023034622,0.00004541591,0.00005109628],"category_scores_gemma":[0.000008522214,0.00006650674,0.000019589143,0.00016646582,0.000017539951,0.000404513,0.00005829007,0.000070979106,0.000043982298],"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.00004848989,0.00019272786,0.005363199,0.00011195309,0.00007533957,0.000032978856,0.003381582,0.058392476,0.00016980227,0.051453188,0.060038544,0.82073975],"study_design_scores_gemma":[0.00026395736,0.000063855514,0.000267573,0.000017139968,0.0000010201854,0.000041151387,0.000008510775,0.99628216,0.00006477998,0.000036438265,0.0028517493,0.00010167174],"about_ca_topic_score_codex":0.0000044853045,"about_ca_topic_score_gemma":0.0000011822503,"teacher_disagreement_score":0.9541747,"about_ca_system_score_codex":0.0000102205795,"about_ca_system_score_gemma":0.0000031653651,"threshold_uncertainty_score":0.27120662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6227013,0.0053470563,0.3699312,0.00056246994,0.0007518468,0.0001616175,0.0000010627298,0.00011173379,0.0004317185],"genre_scores_gemma":[0.9789729,0.00021587936,0.02011971,0.0005042125,0.00013901213,0.000024856809,0.0000017711351,0.000004630469,0.000017003365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865335,0.00020883902,0.00026819963,0.0004601865,0.00019238939,0.00021700855],"domain_scores_gemma":[0.9991545,0.00015232747,0.00014082382,0.00012516542,0.00020422728,0.00022295192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040767618,0.0001551132,0.0001765739,0.000059449518,0.00032945146,0.00055073644,0.00015501874,0.00006941189,0.000002984576],"category_scores_gemma":[0.00017925788,0.00012623885,0.000016705451,0.00014743452,0.00018053038,0.0035922446,0.00015443507,0.00015750836,0.0000024463857],"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.00006716091,0.00016299533,0.0005032439,0.000031658044,0.000023601122,0.000040193718,0.076931275,0.00043641686,0.00016153228,0.075011,0.000112324735,0.8465186],"study_design_scores_gemma":[0.0006420843,0.0008753854,0.00031848915,0.0000533243,0.000011783079,0.00080577336,0.027235035,0.96366024,0.00010489305,0.0030247115,0.002929022,0.0003392431],"about_ca_topic_score_codex":0.00006265031,"about_ca_topic_score_gemma":0.0000010262405,"teacher_disagreement_score":0.9632238,"about_ca_system_score_codex":0.000010883118,"about_ca_system_score_gemma":0.000047397323,"threshold_uncertainty_score":0.53107643},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002566987,0.000008597918,0.97066396,0.0024206487,0.00029301547,0.01806009,0.0000016994713,0.00008800913,0.0058969576],"genre_scores_gemma":[0.9806967,2.844435e-7,0.0024374416,0.0017278353,0.00027405974,0.014722667,9.95125e-7,0.000004252864,0.000135762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903506,0.00012024982,0.00025110185,0.0002261077,0.00018523702,0.00018221661],"domain_scores_gemma":[0.9994113,0.00020644537,0.00006207653,0.00026733047,0.000027508,0.000025345254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004290571,0.000091651505,0.0001264487,0.000044810087,0.00007310844,0.0002839688,0.00059099274,0.000055277,0.00005782538],"category_scores_gemma":[0.000014579299,0.00005430737,0.00005144926,0.00014406211,0.000010955114,0.00026679033,0.000028675651,0.00013940415,0.00006970395],"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.00040488582,0.0007222487,0.0026358522,0.000063814856,0.00020450358,0.00041987674,0.011507396,0.40142137,0.0056284415,0.5227558,0.02894598,0.025289824],"study_design_scores_gemma":[0.021259889,0.0021160922,0.0064823497,0.000957915,0.000021547025,0.00022044108,0.0023685896,0.513832,0.0071993745,0.19574007,0.2478743,0.0019274331],"about_ca_topic_score_codex":0.0019257461,"about_ca_topic_score_gemma":0.0011389203,"teacher_disagreement_score":0.97812974,"about_ca_system_score_codex":0.000034915305,"about_ca_system_score_gemma":0.00003573027,"threshold_uncertainty_score":0.29111648},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010147995,0.000025833802,0.63217086,0.00024158343,0.00075912254,0.000031931573,4.5676448e-8,0.000096838245,0.365659],"genre_scores_gemma":[0.97503847,0.0000016342698,0.013068268,0.0006662799,0.00005635557,0.000006165312,7.737887e-8,0.0000027290132,0.011160024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945885,0.00004438418,0.000106827116,0.00015174826,0.00009991802,0.00013829458],"domain_scores_gemma":[0.99962515,0.000014516226,0.00001897219,0.0002550488,0.000040216382,0.000046126774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021544116,0.00005136157,0.00006650421,0.000028848553,0.00005039567,0.0001080477,0.00022707775,0.000028915189,0.00021531062],"category_scores_gemma":[0.00001685199,0.0000389109,0.00004163013,0.00016183755,0.000006534625,0.00016631885,0.00002692663,0.000042480468,0.00024754382],"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":[1.9326453e-7,0.000008177713,0.00008676793,0.0000011830313,0.0000035442918,0.0000027433323,0.00010869777,0.000022722477,0.000034407967,0.97976315,0.014066454,0.0059019537],"study_design_scores_gemma":[0.00027525626,0.00009568698,0.00036920016,0.0000126110335,0.0000014914555,0.00014581799,0.00007957724,0.055567026,0.0032082647,0.016700348,0.92329645,0.0002482921],"about_ca_topic_score_codex":0.000035180066,"about_ca_topic_score_gemma":0.000013192043,"teacher_disagreement_score":0.97402364,"about_ca_system_score_codex":0.000015194691,"about_ca_system_score_gemma":0.000025685002,"threshold_uncertainty_score":0.31817576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89847976,0.00096958946,0.09240597,0.00043390415,0.00051627785,0.0007877256,0.0000060235902,0.00014319704,0.0062575755],"genre_scores_gemma":[0.9785558,0.0000856402,0.020298032,0.00013736442,0.0002853127,0.000023144632,0.0000014008857,0.000012308937,0.00060100114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870706,0.000008495605,0.00040321116,0.00045395625,0.00017056169,0.00025671785],"domain_scores_gemma":[0.9992347,0.000051671486,0.00020955424,0.00009672785,0.00032099592,0.00008640271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059174316,0.00015230858,0.0002749396,0.00008953971,0.0001782653,0.0004551262,0.00021563805,0.00009505496,0.000008336375],"category_scores_gemma":[0.00006757747,0.00014121039,0.000049786806,0.00015761063,0.00004955647,0.0009924032,0.00013757081,0.0000901937,0.00000161349],"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.00038005333,0.00050761196,0.021435961,0.0017788039,0.00041453066,0.0000047510894,0.02415279,0.003074198,0.5748577,0.12583517,0.07426572,0.1732927],"study_design_scores_gemma":[0.00091376,0.00020742114,0.00012278753,0.00006969249,0.0000127625935,0.00003028603,0.00025130826,0.99378264,0.0034268373,0.00026992802,0.0007591387,0.00015345874],"about_ca_topic_score_codex":0.000039880917,"about_ca_topic_score_gemma":0.0000026861605,"teacher_disagreement_score":0.9907084,"about_ca_system_score_codex":0.00002729258,"about_ca_system_score_gemma":0.000007963648,"threshold_uncertainty_score":0.5758393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31418717,0.0000550132,0.68143594,0.0004004583,0.0005178267,0.00010499437,2.9358594e-7,0.000033849352,0.0032644519],"genre_scores_gemma":[0.9983267,0.0000028428349,0.0012556964,0.00021514384,0.00014926527,0.000006849699,3.9588153e-7,0.0000054589314,0.000037614845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983442,0.00011562041,0.00057628215,0.0002726678,0.00042005975,0.00027120463],"domain_scores_gemma":[0.9986527,0.00039945976,0.00011379949,0.00062662695,0.00014756103,0.00005988505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007928361,0.000121358375,0.00041361077,0.00010612331,0.00010388705,0.00009976217,0.00063387136,0.00006989812,0.000011960617],"category_scores_gemma":[0.00005095662,0.000074362695,0.00021176274,0.001142366,0.000036283487,0.00012898943,0.000100898156,0.00015986749,0.0000057450948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059666927,0.000025591391,0.00028514653,0.0000071323548,0.00014533622,0.0000012263945,0.00020392404,0.5253921,0.00030280947,0.47338364,0.000065891465,0.00018125885],"study_design_scores_gemma":[0.0001752661,0.00012003824,0.0015186599,0.00018357657,0.00006833631,0.0000038034423,0.00014565633,0.9956584,0.001305062,0.0005821789,0.00012421611,0.000114781295],"about_ca_topic_score_codex":0.00042716932,"about_ca_topic_score_gemma":0.000114904324,"teacher_disagreement_score":0.68413955,"about_ca_system_score_codex":0.000048392285,"about_ca_system_score_gemma":0.00003317378,"threshold_uncertainty_score":0.30324227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002714124,0.00020007219,0.71010774,0.000065533844,0.0067351195,0.00031329747,0.0000014319616,0.0003861193,0.28218797],"genre_scores_gemma":[0.5189126,0.0020195614,0.12841578,0.001365065,0.020641243,0.000104666426,0.0010040017,0.00076017174,0.3267769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981431,0.000055856905,0.00050612155,0.00063168496,0.00034006988,0.00032320805],"domain_scores_gemma":[0.9984733,0.00014549698,0.0003692558,0.00065226795,0.00026785687,0.00009181565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001865127,0.0004118055,0.00050534296,0.00015079393,0.00028244613,0.000419358,0.0007156322,0.00051689375,0.00015604738],"category_scores_gemma":[0.000012631438,0.00036873794,0.00011945583,0.00012587353,0.00007940597,0.00030767987,0.00016674626,0.00043459653,0.00002745658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016234359,0.000010786818,0.000005772239,0.0000044875787,0.000035351128,0.00001294149,0.000036743608,0.63219255,5.4305726e-8,0.36354622,0.0018755029,0.00226334],"study_design_scores_gemma":[0.000568156,0.00031600703,0.0000029059795,0.00027264282,0.000029562936,0.00003895764,0.0000047614762,0.96576893,0.0000020948128,0.006766635,0.025683355,0.00054599106],"about_ca_topic_score_codex":0.000014347845,"about_ca_topic_score_gemma":0.0000046011255,"teacher_disagreement_score":0.581692,"about_ca_system_score_codex":0.00013294318,"about_ca_system_score_gemma":0.00008944861,"threshold_uncertainty_score":0.99987644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7775536,0.00011852875,0.045764703,0.00006589254,0.025960483,0.002293436,0.000062790714,0.00039249976,0.14778803],"genre_scores_gemma":[0.8553206,0.00032359175,0.0014629825,0.0000035413707,0.002195201,5.28778e-7,0.00014917165,0.000035541583,0.14050888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946333,0.0014906866,0.0005176738,0.0012527914,0.0013147754,0.0007907706],"domain_scores_gemma":[0.9953785,0.0006820677,0.0005836058,0.001018603,0.001943382,0.00039385396],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0021756364,0.000429456,0.0010382559,0.004298696,0.0013002793,0.00031304976,0.0022899199,0.0008276391,0.000058608868],"category_scores_gemma":[0.000108919776,0.00051690196,0.00037960804,0.005508963,0.000248367,0.0013458328,0.00031496363,0.0010765615,0.000016488026],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"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.14071587,0.004793074,0.008898779,0.008522208,0.046899892,0.030816026,0.06129282,0.08196033,0.23301466,0.2423843,0.08390445,0.056797594],"study_design_scores_gemma":[0.037436392,0.013131231,0.019948611,0.004372672,0.009599493,0.00035253837,0.04683295,0.39638174,0.26106656,0.0008422778,0.19892448,0.011111057],"about_ca_topic_score_codex":0.007355357,"about_ca_topic_score_gemma":0.0009933533,"teacher_disagreement_score":0.31442142,"about_ca_system_score_codex":0.0009064553,"about_ca_system_score_gemma":0.001029116,"threshold_uncertainty_score":0.9999999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006150612,0.000018563875,0.99155307,0.0008805651,0.0005734407,0.00018723146,0.000008773783,0.000104308114,0.0005234661],"genre_scores_gemma":[0.59879047,2.7283997e-7,0.40061373,0.0003351158,0.00019294668,0.0000059780905,0.000019191333,0.000003398435,0.00003892172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885637,0.00009295179,0.00025754145,0.0004339126,0.00010910999,0.00025014044],"domain_scores_gemma":[0.9988037,0.00021279785,0.000043241296,0.0008391094,0.000041582625,0.000059570393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013646305,0.000082016086,0.00013424915,0.00005553571,0.00008023621,0.00016896693,0.0011799455,0.000038034694,0.000004800821],"category_scores_gemma":[0.000025030915,0.00006868137,0.000028438375,0.00018562349,0.000006750433,0.00033320714,0.00023876318,0.000063403546,0.000009398662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011152891,0.00028053406,0.0004684639,0.000019853336,0.000013593291,0.0000043776436,0.0010536613,0.4263505,0.0004140649,0.21338265,0.009183708,0.34881744],"study_design_scores_gemma":[0.0002234521,0.000034754783,0.00016141217,0.000012125178,0.0000010376003,0.000014051475,0.00004878149,0.9767984,0.00020360558,0.000049129463,0.022355262,0.00009797563],"about_ca_topic_score_codex":0.00010554759,"about_ca_topic_score_gemma":0.00017498163,"teacher_disagreement_score":0.5926398,"about_ca_system_score_codex":0.000051180166,"about_ca_system_score_gemma":0.00001914821,"threshold_uncertainty_score":0.2800745},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09015478,0.0016045466,0.8730111,0.0052407826,0.0013256916,0.0005946707,0.0000026984778,0.0004770962,0.027588643],"genre_scores_gemma":[0.9891935,0.00004226204,0.0016855639,0.0005931768,0.0001353549,0.000015270618,2.497159e-7,0.0000072003013,0.008327451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989841,0.000048736303,0.00025298784,0.00033991292,0.0001295749,0.00024466697],"domain_scores_gemma":[0.99940103,0.00013743626,0.00007044874,0.00021497853,0.00005377895,0.00012232225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002660309,0.00013767785,0.00024491193,0.00007123822,0.00019211613,0.00026770253,0.00016143512,0.000057804176,0.000020247222],"category_scores_gemma":[0.000023068891,0.00010321179,0.000046194236,0.000104197425,0.00005305672,0.000392957,0.000082100516,0.0000756202,0.00001419579],"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.00022724248,0.00042333172,0.14168356,0.00020502543,0.0008477806,0.00021105265,0.020142518,0.009514917,0.003150887,0.37706006,0.10402308,0.34251055],"study_design_scores_gemma":[0.0018200829,0.00006832812,0.0017901608,0.000021476888,0.0000063207226,0.000054548367,0.00022001809,0.98865104,0.000028401182,0.00022479931,0.0069357506,0.00017909732],"about_ca_topic_score_codex":0.00013401659,"about_ca_topic_score_gemma":0.00007292752,"teacher_disagreement_score":0.9791361,"about_ca_system_score_codex":0.000016115011,"about_ca_system_score_gemma":0.000005930397,"threshold_uncertainty_score":0.42088544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073309295,0.00008066649,0.9249661,0.000043576827,0.0002699319,0.000052850442,0.0000062078557,0.00004689309,0.0012244891],"genre_scores_gemma":[0.9981872,8.2473224e-7,0.0016345839,0.00001335008,0.00009076708,5.893527e-7,0.000007909867,0.0000042211636,0.000060552793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913937,0.000105764855,0.00031166401,0.00019090406,0.000099002296,0.00015329345],"domain_scores_gemma":[0.9992026,0.00017862694,0.0001885276,0.00020202965,0.00019183455,0.000036389276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045754173,0.00008407006,0.00021283014,0.00007583751,0.00006963259,0.00003172249,0.00022468653,0.00005616267,0.0000027553908],"category_scores_gemma":[0.00005731895,0.00007972835,0.000048185724,0.0003904947,0.00003304772,0.0000758034,0.000090435096,0.00007822795,0.000006295714],"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.00003483497,0.00053062197,0.013292895,0.00061452994,0.00028196585,0.00000228321,0.0042331447,0.009179324,0.036711767,0.49033722,0.017417813,0.4273636],"study_design_scores_gemma":[0.00022464432,0.00010796823,0.00490958,0.00009747167,0.0000050315907,0.000015787717,0.000035125886,0.9842678,0.008838885,0.0004542672,0.000946663,0.00009677488],"about_ca_topic_score_codex":0.000035518777,"about_ca_topic_score_gemma":0.0000022560196,"teacher_disagreement_score":0.9750885,"about_ca_system_score_codex":0.000017540679,"about_ca_system_score_gemma":0.000015414236,"threshold_uncertainty_score":0.32512277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22886369,0.000390053,0.75158316,0.003173855,0.0011531139,0.00026277357,2.0354305e-7,0.0002589288,0.014314226],"genre_scores_gemma":[0.9969618,0.000084085805,0.00028763412,0.00094812515,0.0002224139,0.00001135902,7.9060875e-8,0.0000053717117,0.001479168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991839,0.000095788244,0.00015425027,0.0002709566,0.000120909026,0.00017420194],"domain_scores_gemma":[0.99954087,0.00016906111,0.00005032884,0.00013699573,0.000056798173,0.000045955687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038996042,0.000103169594,0.000100880556,0.00004018297,0.00025770874,0.00027113254,0.00011241593,0.00005840959,0.00007608058],"category_scores_gemma":[0.000025194722,0.00006609626,0.000023752247,0.00018537523,0.000022141658,0.00024985793,0.000058074926,0.00016220193,0.000014637584],"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.000050243012,0.00016137183,0.0066464576,0.00004675104,0.00017718233,0.000013407777,0.0061249193,0.0069060735,0.0012722529,0.56318635,0.10973164,0.30568334],"study_design_scores_gemma":[0.00012525325,0.000148314,0.0011844231,0.000031324817,0.0000022815068,0.00007826723,0.0001055709,0.9910543,0.000076520766,0.00032953153,0.0067671696,0.00009703071],"about_ca_topic_score_codex":0.00008566414,"about_ca_topic_score_gemma":0.00027162995,"teacher_disagreement_score":0.98414826,"about_ca_system_score_codex":0.000048628543,"about_ca_system_score_gemma":0.000003859446,"threshold_uncertainty_score":0.26953274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030712232,0.000069619324,0.939384,0.00028881384,0.00089478336,0.00006167215,1.45296175e-8,0.0001117827,0.05611812],"genre_scores_gemma":[0.9946507,0.000010319454,0.0023545928,0.00027436577,0.00011735987,0.000007715351,5.979439e-8,0.0000027074002,0.0025821403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994327,0.000040500905,0.00014286423,0.00016082247,0.0000650539,0.00015808258],"domain_scores_gemma":[0.9997175,0.00003323573,0.000020504734,0.00017699933,0.000020850186,0.00003091778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012637828,0.000051300878,0.00006606452,0.00006696518,0.000039237773,0.000081027756,0.00017048007,0.000043487606,0.00014080385],"category_scores_gemma":[0.0000063441967,0.000043791013,0.000026630521,0.0003134077,0.000005989004,0.00021759915,0.00003482443,0.000082736326,0.00013000263],"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.000008307783,0.00044206332,0.016794575,0.000013135629,0.00002771125,0.00008380785,0.0022443533,0.1923837,0.00019519134,0.3827196,0.08698171,0.31810585],"study_design_scores_gemma":[0.0001221178,0.000020893158,0.0008827582,0.000006723185,2.2914273e-7,0.000021910873,0.000011927735,0.99481565,0.000014996591,0.00010588495,0.0039379518,0.000058931633],"about_ca_topic_score_codex":0.00007701383,"about_ca_topic_score_gemma":0.00027978662,"teacher_disagreement_score":0.99157953,"about_ca_system_score_codex":0.000029837205,"about_ca_system_score_gemma":0.0000013184737,"threshold_uncertainty_score":0.17857456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019894227,0.0011351935,0.6972868,0.16790919,0.019354247,0.0035771106,0.00017130132,0.0015061612,0.08916578],"genre_scores_gemma":[0.98479855,0.00020918455,0.0066486713,0.0025246816,0.0010908643,0.00036288364,0.000041860585,0.000031769465,0.0042915265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978336,0.00020178316,0.00066303974,0.00047893394,0.0003726089,0.0004500146],"domain_scores_gemma":[0.9970652,0.0008367344,0.00031459957,0.0011914265,0.00046678144,0.00012527007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045771638,0.00025924452,0.00030863596,0.00013754722,0.00055717636,0.00031392148,0.0025863503,0.00013270215,0.00015823747],"category_scores_gemma":[0.00006805533,0.0002456072,0.00025001547,0.00036557147,0.00005568959,0.000446744,0.00018756693,0.00033218227,0.00025142875],"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.00011135306,0.000899998,0.00039615665,0.000012995681,0.00053355243,0.0000047394797,0.0011409976,0.090517424,0.0017390614,0.5483807,0.33694303,0.019320007],"study_design_scores_gemma":[0.0015055917,0.00024225515,0.00022263743,0.00005161918,0.00001495062,0.000036956833,0.000023334484,0.86508876,0.00023171313,0.0040170425,0.1282284,0.0003367635],"about_ca_topic_score_codex":0.00009318456,"about_ca_topic_score_gemma":0.000102579404,"teacher_disagreement_score":0.9649043,"about_ca_system_score_codex":0.00018782757,"about_ca_system_score_gemma":0.00001797626,"threshold_uncertainty_score":0.99999964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012186264,0.011022731,0.0670328,0.00075386086,0.13413446,0.008149668,0.00003765994,0.00068126945,0.7660013],"genre_scores_gemma":[0.98628813,0.00016236828,0.0011031403,0.00015431839,0.01008916,0.000042057647,0.000009366132,0.0001249721,0.0020265053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944192,0.0001938015,0.001348181,0.0017500985,0.00116124,0.0011274678],"domain_scores_gemma":[0.99609,0.0010278363,0.0010562766,0.0011718264,0.00030138897,0.0003526614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012708139,0.0009726319,0.0016270793,0.0008804681,0.00041116303,0.00041427327,0.0014048034,0.00089992385,0.000012567605],"category_scores_gemma":[0.000049305836,0.00096107187,0.0002715466,0.00046703516,0.00088272605,0.00022169149,0.0008443513,0.0013521621,0.0000047397025],"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.00038220326,0.00046658487,0.0005727292,0.0007453865,0.00065922434,0.00026149183,0.0073696696,0.011902862,0.00014444489,0.53592503,0.0014824724,0.4400879],"study_design_scores_gemma":[0.01928398,0.004489452,0.001443114,0.021288952,0.00044152743,0.0004940023,0.000056766497,0.49674276,0.0019268986,0.19574797,0.2505818,0.0075027784],"about_ca_topic_score_codex":0.0005341452,"about_ca_topic_score_gemma":0.0015588561,"teacher_disagreement_score":0.97410184,"about_ca_system_score_codex":0.00056584796,"about_ca_system_score_gemma":0.00078809634,"threshold_uncertainty_score":0.99928397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69898355,0.000039895447,0.30024937,0.000057147998,0.00021166024,0.000062930456,6.309613e-7,0.000022636968,0.0003721825],"genre_scores_gemma":[0.99146765,0.000013678224,0.007849802,0.00013961396,0.00007155769,0.0000027419512,2.4531812e-7,0.000004131037,0.0004505649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943054,0.000048881415,0.00016633098,0.00014381202,0.000100286896,0.00011015525],"domain_scores_gemma":[0.99948776,0.00010485331,0.000050174116,0.00022269311,0.00010626885,0.00002825434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008245594,0.00006404914,0.00010166451,0.00006184466,0.0001876518,0.0000340702,0.00013652773,0.000015226873,0.0000115942075],"category_scores_gemma":[0.000010566588,0.000041511168,0.000044816137,0.00019039592,0.000050581042,0.00036993102,0.00005995312,0.000044576584,0.0000039488878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003387707,0.00022081874,0.012801392,0.00004820901,0.0003892728,0.00007278649,0.048288535,0.5613855,0.15024133,0.17673637,0.0070034694,0.04277846],"study_design_scores_gemma":[0.00009626313,0.000024314244,0.002355626,0.000011420596,0.000003198205,0.00009153448,0.000054253916,0.9953296,0.0014734474,0.00026557696,0.0002208885,0.000073838695],"about_ca_topic_score_codex":0.0001532003,"about_ca_topic_score_gemma":0.0000049422324,"teacher_disagreement_score":0.43394414,"about_ca_system_score_codex":0.000007147246,"about_ca_system_score_gemma":0.000010539919,"threshold_uncertainty_score":0.16927764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07130962,0.0003486579,0.9190658,0.0018506757,0.0063513382,0.00020225959,3.505592e-7,0.00001805587,0.0008532768],"genre_scores_gemma":[0.98757136,0.0000042984952,0.0089164125,0.0014837604,0.0018496157,0.0000054051716,1.4840886e-7,0.0000063589273,0.00016261634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851495,0.00044866704,0.00030448052,0.000119034434,0.0003383335,0.0002745113],"domain_scores_gemma":[0.9990036,0.0000757559,0.00021127303,0.00051593676,0.0001223739,0.000071075694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002049695,0.00011074978,0.00012554773,0.000031057734,0.000659913,0.00025878876,0.0011774342,0.0000273891,0.000005331372],"category_scores_gemma":[0.00000580038,0.000045357512,0.00015198965,0.0003409943,0.000027391314,0.00021254686,0.00032261523,0.00029384607,0.000009657931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024121362,0.00024158353,0.0029691432,0.000018262466,0.0002790009,6.869176e-7,0.023120694,0.6487929,0.0012511323,0.06722589,0.19647329,0.059603255],"study_design_scores_gemma":[0.00024045509,0.00010028333,0.004884911,0.00005645788,0.000022905904,0.0004789357,0.00025736226,0.96789914,0.00018039867,0.00069718726,0.02503402,0.00014793749],"about_ca_topic_score_codex":0.0000089537025,"about_ca_topic_score_gemma":0.0000030634003,"teacher_disagreement_score":0.9162618,"about_ca_system_score_codex":0.00003318439,"about_ca_system_score_gemma":0.000021066491,"threshold_uncertainty_score":0.5075584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018078194,0.00002546633,0.94479674,0.004150215,0.0017215207,0.0003724103,4.711384e-7,0.00018204191,0.04694332],"genre_scores_gemma":[0.9166126,0.000001886692,0.028443374,0.0021008996,0.00077868474,0.00025845127,0.0000013153824,0.000012695284,0.051790085],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990892,0.000025628637,0.00021662822,0.00028406843,0.00011481755,0.00026967662],"domain_scores_gemma":[0.9992815,0.000053337168,0.00004773736,0.00038037793,0.0001547406,0.00008230692],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013248215,0.0001070869,0.00013416955,0.000054003674,0.00010150631,0.0003412903,0.00046297553,0.000061704726,0.00029654623],"category_scores_gemma":[0.0000067062256,0.00007464936,0.0001036785,0.00011925794,0.0000073097194,0.00053864263,0.00009156623,0.00005294979,0.0008852557],"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.0000030223152,0.000050198123,0.00014649711,0.000019070014,0.00003530779,0.0000020052714,0.0008917205,0.000060088732,0.00093524164,0.31690452,0.6496978,0.031254545],"study_design_scores_gemma":[0.00044184033,0.00013502956,0.00019304958,0.000028327082,0.000003180264,0.000034326833,0.000058209887,0.5441749,0.0029148674,0.00489767,0.44683915,0.00027941685],"about_ca_topic_score_codex":0.00009904369,"about_ca_topic_score_gemma":0.00003965023,"teacher_disagreement_score":0.91635334,"about_ca_system_score_codex":0.000022800368,"about_ca_system_score_gemma":0.000013354557,"threshold_uncertainty_score":0.99989265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40874952,0.00056679716,0.56793135,0.003041834,0.017951306,0.00020245486,2.946525e-7,0.000044878805,0.0015115838],"genre_scores_gemma":[0.9981032,0.00004651546,0.00015683389,0.00051687576,0.0011167346,0.0000047290105,8.5563094e-8,0.0000107185415,0.000044278866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828136,0.00021095265,0.0008029447,0.00015151495,0.00035477916,0.00019844809],"domain_scores_gemma":[0.9981769,0.0002276881,0.00068297243,0.00032122192,0.0005080391,0.000083224084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171491,0.00015436402,0.00031610436,0.00017480484,0.00014912788,0.00013272783,0.0007483424,0.00011321661,0.000025919853],"category_scores_gemma":[0.0002388768,0.00008896145,0.00027954314,0.00034387875,0.00007204805,0.00047889064,0.000081182996,0.0005066063,0.0000070851797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035339015,0.00034617854,0.00005426588,0.000024260751,0.00025659142,0.0000252668,0.0016112358,0.27376866,0.001904077,0.7091902,0.009609091,0.0028567635],"study_design_scores_gemma":[0.0128183365,0.01791925,0.0007845317,0.011469405,0.00019026131,0.0057118833,0.0054842304,0.5632355,0.11890506,0.24618822,0.015357035,0.0019362628],"about_ca_topic_score_codex":0.000026618687,"about_ca_topic_score_gemma":0.000011571754,"teacher_disagreement_score":0.58935374,"about_ca_system_score_codex":0.00012489289,"about_ca_system_score_gemma":0.00009012219,"threshold_uncertainty_score":0.36277428},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012255372,0.00013812567,0.9860873,0.0000682359,0.000919954,0.000344864,1.495027e-7,0.00017110098,0.000014889694],"genre_scores_gemma":[0.8156828,0.0000012420315,0.18381,0.000103311395,0.0003568513,0.000026105066,0.0000015859001,0.0000149909965,0.00000306617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870485,0.00010477192,0.00029984672,0.00037095716,0.00014103926,0.00037854724],"domain_scores_gemma":[0.9987001,0.00069167215,0.0001003524,0.00033410214,0.00006560181,0.00010821679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000720056,0.00016656691,0.00026580042,0.00008752717,0.00008691987,0.000091272566,0.00036418025,0.0000786635,3.4236612e-7],"category_scores_gemma":[0.0000400514,0.00016156344,0.000058301914,0.00041671834,0.00001285472,0.000071959985,0.000036346424,0.00013708348,0.0000010932002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031251784,0.000029348324,0.0000042725637,0.000017273474,0.00001075283,2.76036e-7,0.00004013431,0.96114707,0.00031979525,0.020191554,0.00036605817,0.017842215],"study_design_scores_gemma":[0.00037805206,0.0008283283,0.00016956322,0.000093952636,0.0000051294405,0.0000045875604,3.506718e-7,0.9960689,0.001193274,0.00014463172,0.0009436347,0.00016957392],"about_ca_topic_score_codex":0.0000021091541,"about_ca_topic_score_gemma":1.6012386e-7,"teacher_disagreement_score":0.80342746,"about_ca_system_score_codex":0.00004950696,"about_ca_system_score_gemma":0.00001747265,"threshold_uncertainty_score":0.6588366},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4033378,0.00026943628,0.59297925,0.00018894619,0.0028035147,0.00027467113,0.0000012667815,0.0000099245835,0.0001351648],"genre_scores_gemma":[0.99363524,0.0000013482755,0.0050181886,0.000062011415,0.0012484393,0.0000136627505,4.1049393e-7,0.000011832754,0.000008840609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982324,0.00021256233,0.00067577045,0.00017940305,0.00050532323,0.0001945006],"domain_scores_gemma":[0.9979844,0.00031329595,0.00053660205,0.00027688604,0.00079401,0.000094802395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038240303,0.00013839333,0.00035589488,0.00023023401,0.000092009665,0.00011601434,0.0003711059,0.000111220186,0.0000020432815],"category_scores_gemma":[0.00019270995,0.00009978229,0.00015153704,0.00014747465,0.000021226531,0.00013355585,0.000033098702,0.00038281854,3.777586e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052491836,0.000020406032,0.000073325224,0.00008888412,0.0000422883,0.0000014286111,0.0004572992,0.98343796,0.0016932782,0.0070215226,0.00015428646,0.006956843],"study_design_scores_gemma":[0.00094737654,0.00039989204,0.00004336032,0.00054596044,0.000026376305,0.00021581263,0.000049306047,0.99470097,0.00025117962,0.002309386,0.00041024742,0.000100109995],"about_ca_topic_score_codex":0.000017616077,"about_ca_topic_score_gemma":0.000052398318,"teacher_disagreement_score":0.59029746,"about_ca_system_score_codex":0.000029058267,"about_ca_system_score_gemma":0.0001167652,"threshold_uncertainty_score":0.40690038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081337065,0.00011429328,0.8992905,0.00025683327,0.005748836,0.00012035951,5.4591663e-7,0.00015744955,0.012974114],"genre_scores_gemma":[0.9947881,0.0000018654699,0.0022031148,0.00028535235,0.0013024239,0.00001320542,0.0000010366037,0.000009065888,0.0013958195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986713,0.00015882582,0.0002476935,0.00026501258,0.00019614349,0.00046103852],"domain_scores_gemma":[0.9993359,0.00016683317,0.00006780061,0.0002722932,0.000043105247,0.00011407298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008133246,0.0001478315,0.00018665382,0.00016620685,0.00012262975,0.00009963194,0.00024798783,0.00008826559,0.00006013682],"category_scores_gemma":[0.00002501091,0.00012301205,0.000079720725,0.00052302517,0.000016623766,0.0005201637,0.000088677014,0.00017251873,0.000037114027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008757961,0.00075275457,0.04269081,0.000020781785,0.000082404695,0.00002061033,0.0015510363,0.5065018,0.00042848522,0.40246013,0.0139175765,0.031486075],"study_design_scores_gemma":[0.00025468925,0.00005007634,0.0044720494,0.00003922315,0.0000014073103,0.000039359715,0.000015011291,0.99045163,0.000109206456,0.00024703328,0.004126506,0.00019380981],"about_ca_topic_score_codex":0.00020947897,"about_ca_topic_score_gemma":0.00015714139,"teacher_disagreement_score":0.9134511,"about_ca_system_score_codex":0.00008913717,"about_ca_system_score_gemma":0.000023262974,"threshold_uncertainty_score":0.50162864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048022736,0.0014747253,0.94665176,0.00024258926,0.0028169937,0.00041168023,0.00003985961,0.000097323136,0.00024234134],"genre_scores_gemma":[0.9907863,0.00069231057,0.008128075,0.000035327055,0.00016631038,0.00010146637,0.000022190727,0.000010636686,0.00005738975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99732053,0.0014588328,0.00055301347,0.00024779452,0.00015391728,0.00026590677],"domain_scores_gemma":[0.9957917,0.0015185081,0.00025733226,0.0017223503,0.0006563367,0.000053776672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009158924,0.00013926261,0.00036235392,0.00008185368,0.00038881684,0.000111192574,0.0014636266,0.00012337902,0.0000012929224],"category_scores_gemma":[0.0003644516,0.00012775001,0.000066222005,0.00037111106,0.0001427372,0.00032802523,0.00028841247,0.00012813,0.0000023242892],"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.00033005624,0.0025670584,0.27905506,0.00044901727,0.0010463102,0.0000019344639,0.021912133,0.108271234,0.0025786825,0.34162596,0.013512856,0.2286497],"study_design_scores_gemma":[0.0056644874,0.0014297401,0.554878,0.000501827,0.00007158688,0.000027602591,0.0007535572,0.3910456,0.0043614027,0.0056008003,0.034023076,0.0016423461],"about_ca_topic_score_codex":0.0011869393,"about_ca_topic_score_gemma":0.0063224984,"teacher_disagreement_score":0.94276357,"about_ca_system_score_codex":0.000047954418,"about_ca_system_score_gemma":0.00010209232,"threshold_uncertainty_score":0.5209494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061645256,0.000018293233,0.98625326,0.00021157399,0.00385698,0.0004354611,0.0000013751013,0.00018475966,0.0028737928],"genre_scores_gemma":[0.9957433,4.897842e-7,0.0010594085,0.00013941158,0.00015174311,0.000090578564,0.000005063383,0.0000073257524,0.002802717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990641,0.000062791754,0.00025030388,0.0002763228,0.00014239752,0.00020409215],"domain_scores_gemma":[0.9992597,0.00015241352,0.00008422498,0.0002922057,0.00015351741,0.00005794279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045416076,0.00010014186,0.00014485455,0.00006338733,0.00013793791,0.00021416438,0.0002842288,0.0000629034,0.000004162003],"category_scores_gemma":[0.000036437064,0.00007869735,0.00006277938,0.00009393592,0.000012456524,0.000105485386,0.000032076583,0.000043431737,0.00006409381],"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.0000073807964,0.000038816688,0.0000030220328,0.000026336713,0.0000130705075,3.444435e-7,0.000495655,0.22620296,0.0006582614,0.7655583,0.0019700227,0.005025856],"study_design_scores_gemma":[0.00033202468,0.00016667177,0.00002819091,0.000024293044,0.0000019709773,0.000009137304,0.00013324444,0.994267,0.00014260226,0.000101361125,0.0046792086,0.00011433028],"about_ca_topic_score_codex":0.000039719867,"about_ca_topic_score_gemma":0.000017144564,"teacher_disagreement_score":0.9895787,"about_ca_system_score_codex":0.00004156472,"about_ca_system_score_gemma":0.000012808692,"threshold_uncertainty_score":0.32091847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003015839,0.0019569239,0.979392,0.012042875,0.00019003313,0.000470934,5.2337964e-7,0.00043337108,0.0024975038],"genre_scores_gemma":[0.8184531,0.00032223805,0.18053469,0.00019546128,0.00020010263,0.00014969669,3.088572e-7,0.000007574207,0.0001368859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879956,0.00005750664,0.00026342005,0.00043225393,0.00012268325,0.00032459528],"domain_scores_gemma":[0.9988893,0.00064497284,0.00005351572,0.0002498185,0.00008886532,0.00007350697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076699647,0.00014892963,0.0002178462,0.000086721135,0.00016486617,0.00029410634,0.00043774297,0.00016990917,0.000010196415],"category_scores_gemma":[0.00021071626,0.00010816067,0.00005550603,0.00010922391,0.00008560831,0.000520233,0.00028668935,0.0001257351,0.000013373142],"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.000007706439,0.000037615428,0.000011607636,0.000020512674,0.000014185542,0.0000026234231,0.00020053532,0.00004087614,0.00019632887,0.4288381,0.00032317557,0.5703067],"study_design_scores_gemma":[0.0015424283,0.0019019862,0.00025574217,0.00031754395,0.000023337605,0.0006195167,0.0014791864,0.71188533,0.047125027,0.021205707,0.21251412,0.0011300934],"about_ca_topic_score_codex":0.0000016813336,"about_ca_topic_score_gemma":0.00002100016,"teacher_disagreement_score":0.8154372,"about_ca_system_score_codex":0.000039660415,"about_ca_system_score_gemma":0.000018169316,"threshold_uncertainty_score":0.44106638},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053595304,0.00003410457,0.93192863,0.00015429831,0.00009239911,0.00045973234,0.0000045050747,0.000064665044,0.013666376],"genre_scores_gemma":[0.93616736,0.0000105290055,0.06345597,0.00019800411,0.00004548287,0.00002385987,0.000002337413,0.000008799949,0.000087638284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999115,0.000005534354,0.00031419616,0.00021873512,0.00015587974,0.0001906708],"domain_scores_gemma":[0.99921966,0.00019712166,0.00012933019,0.00036018816,0.00004222995,0.000051488187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226759,0.00013958616,0.00029062497,0.00006702423,0.00008148027,0.00006821134,0.00026159515,0.000060235394,0.0000032075889],"category_scores_gemma":[0.000018848956,0.00010608573,0.00006688378,0.000106515065,0.000016822658,0.00009692759,0.000035105717,0.000052912426,0.0000037990505],"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.000011076438,0.00004941328,0.0000016154323,0.00007566692,0.000011677274,3.1244605e-7,0.0010508251,0.000072798815,0.0028262767,0.9899029,0.0005560217,0.005441374],"study_design_scores_gemma":[0.001403581,0.0008553351,0.0001160127,0.0002481488,0.000030302406,0.000024901847,0.0005161849,0.27253094,0.025265703,0.6972906,0.0012435035,0.00047478598],"about_ca_topic_score_codex":9.299171e-7,"about_ca_topic_score_gemma":6.504788e-7,"teacher_disagreement_score":0.88257205,"about_ca_system_score_codex":0.000009735842,"about_ca_system_score_gemma":0.000008849421,"threshold_uncertainty_score":0.43260506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050686937,0.000041168052,0.94839627,0.000060883616,0.00027049537,0.00029172367,0.000003936283,0.00011034695,0.00013824846],"genre_scores_gemma":[0.9880191,2.5387536e-7,0.011587699,0.000075772805,0.00017602356,0.00000927913,0.000015295858,0.000010033472,0.00010655374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991071,0.00006208648,0.00028970392,0.0002356581,0.0001664623,0.00013895748],"domain_scores_gemma":[0.9990687,0.00023005714,0.00018390644,0.00022869912,0.0002517523,0.000036931797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018327855,0.00010041446,0.00013656786,0.000107650194,0.000102872,0.000098967816,0.00018174804,0.000100568985,0.000018114679],"category_scores_gemma":[0.00009159608,0.00008778673,0.000055919125,0.0003034107,0.000013852331,0.000532038,0.000016909102,0.00008129797,0.0000031498726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007962164,0.000028006312,0.000047486785,0.000019919342,0.0000039078923,1.5243972e-7,0.00087069755,0.852862,0.00012634657,0.0006889843,0.000011539412,0.14533302],"study_design_scores_gemma":[0.00031051264,0.00013972473,0.00024726076,0.000048941805,0.000004186884,6.067058e-7,0.000020858452,0.99318165,0.00016445083,0.0024940756,0.0032870742,0.0001006773],"about_ca_topic_score_codex":0.000013230689,"about_ca_topic_score_gemma":0.0000151496615,"teacher_disagreement_score":0.93733215,"about_ca_system_score_codex":0.000034176242,"about_ca_system_score_gemma":0.000010769858,"threshold_uncertainty_score":0.3579839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118222736,0.0000117352,0.8735557,0.00029338276,0.0021468992,0.00042169416,0.0000018082922,0.0002264596,0.005119541],"genre_scores_gemma":[0.984014,8.9069954e-7,0.013122389,0.00038508954,0.00022162084,0.00008288503,0.0000049484274,0.000007297339,0.002160897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906427,0.00003272732,0.00022092248,0.000307766,0.00013486261,0.00023943043],"domain_scores_gemma":[0.9991234,0.000038227976,0.000066495806,0.00044442964,0.00022304198,0.00010439159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000206648,0.00009323836,0.00011717314,0.00007180772,0.00020399739,0.00025314247,0.000272859,0.000060460483,0.0001652321],"category_scores_gemma":[0.000011025442,0.00007192714,0.00006237507,0.00017418576,0.00001292706,0.0004840308,0.000041733794,0.000056004035,0.00012955414],"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.000012242242,0.00026374086,0.0003286884,0.000030260055,0.000042834996,0.0000035856613,0.0013134372,0.10706901,0.003939529,0.5057238,0.30941334,0.07185954],"study_design_scores_gemma":[0.00024859683,0.00011266722,0.0007745108,0.000009599025,0.0000022133984,0.000037548834,0.00019017715,0.97496814,0.00077712815,0.0010328798,0.021714682,0.00013185793],"about_ca_topic_score_codex":0.00034744706,"about_ca_topic_score_gemma":0.000030636147,"teacher_disagreement_score":0.8678991,"about_ca_system_score_codex":0.0000321097,"about_ca_system_score_gemma":0.00002522397,"threshold_uncertainty_score":0.29331037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6990764,0.007490034,0.21443371,0.006915901,0.013904762,0.0012116928,8.8413117e-7,0.00078491546,0.056181688],"genre_scores_gemma":[0.9989391,0.00013510174,0.0001566227,0.00013108781,0.000016682337,0.000038916027,1.3648409e-7,0.000004059195,0.0005782701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992985,0.000047204954,0.00015513354,0.00016330382,0.00013316849,0.00020266094],"domain_scores_gemma":[0.99935526,0.0001473888,0.000060244765,0.00026740838,0.000107222375,0.00006245348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002700441,0.0000809526,0.00008213846,0.000044061093,0.0005342533,0.0005017624,0.00036124128,0.000037128695,0.0000027744106],"category_scores_gemma":[0.000016113983,0.00005120713,0.000048527498,0.00035665656,0.000039649007,0.00023760572,0.000108105254,0.000102350175,0.000014899846],"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":[2.3231718e-7,0.000007767987,0.00082439923,0.0000024496237,0.0000062437184,6.8963e-7,0.000119315024,0.0000012357674,0.00001176405,0.9762963,0.00442654,0.018303072],"study_design_scores_gemma":[0.0002235891,0.00007693845,0.0040534865,0.000012093639,0.000002133368,0.000023001605,0.00020185305,0.025769094,0.00004798498,0.9574822,0.011964884,0.00014271306],"about_ca_topic_score_codex":0.00006809621,"about_ca_topic_score_gemma":0.0000041172657,"teacher_disagreement_score":0.2998627,"about_ca_system_score_codex":0.0000071037985,"about_ca_system_score_gemma":0.0000068120544,"threshold_uncertainty_score":0.48385063},"labels":[],"label_agreement":null},{"id":"W1973666239","doi":"10.1142/s0219265908002400","title":"AVERAGE-CASE \"MESSY\" BROADCASTING","year":2008,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Brandon University","funders":"","keywords":"Broadcasting (networking); Hypercube; Computer science; Upper and lower bounds; Network topology; Graph; Focus (optics); Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Combinatorics; Parallel computing","score_opus":0.022989138321411567,"score_gpt":0.22900563889527023,"score_spread":0.20601650057385867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973666239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0978548,0.00045675234,0.891582,0.00024170606,0.007541959,0.00008308167,2.4051187e-7,0.000082488434,0.00215698],"genre_scores_gemma":[0.9925744,0.00011741778,0.0039416268,0.00040411262,0.0023583302,0.0000035321696,2.5910856e-7,0.00001841957,0.0005819315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977549,0.0002546685,0.0010724766,0.00026054456,0.00030655242,0.00035089804],"domain_scores_gemma":[0.997657,0.00031382337,0.00085468433,0.0003421218,0.00063492934,0.00019743654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091558,0.00021407651,0.00040721332,0.00033494487,0.0003955965,0.0001724305,0.00055271987,0.00015734039,0.00009097923],"category_scores_gemma":[0.00014452674,0.0001798933,0.00035544691,0.00053426303,0.000049093887,0.0012315072,0.000119297976,0.0006804464,0.00002369576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029128612,0.0004992663,0.00384135,0.00005426943,0.00066674006,0.034775157,0.0058614654,0.72704333,0.000618862,0.012226659,0.113577254,0.10054433],"study_design_scores_gemma":[0.00079519866,0.00053609704,0.00018502153,0.00021031848,0.00001193432,0.29766682,0.00025604534,0.6880125,0.00021261201,0.00021552539,0.011623919,0.00027405383],"about_ca_topic_score_codex":0.000023787617,"about_ca_topic_score_gemma":0.000018308461,"teacher_disagreement_score":0.89471954,"about_ca_system_score_codex":0.00013985191,"about_ca_system_score_gemma":0.00006511947,"threshold_uncertainty_score":0.73358357},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9334664,0.00041478165,0.027481984,0.000104852574,0.022090554,0.00012280846,0.0000039015363,0.00002244876,0.01629232],"genre_scores_gemma":[0.99818194,0.00002423089,0.0014057782,0.000020848474,0.0002772095,7.6491733e-7,1.1604033e-7,0.0000067909273,0.00008234426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837077,0.00029445565,0.0007702472,0.00009288809,0.00033275608,0.00013889554],"domain_scores_gemma":[0.99808663,0.00016467954,0.0008061517,0.00025543722,0.0006167646,0.000070320566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014657222,0.00010665575,0.00041804486,0.00012816342,0.000042698346,0.00002084009,0.00067442557,0.00008308064,0.00007975892],"category_scores_gemma":[0.00010608486,0.00008179785,0.00021579265,0.00020880766,0.00011278482,0.0005996454,0.00009809409,0.00016731945,0.0000016275869],"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.00044954944,0.00012492154,0.00039249976,0.000022599712,0.000087439126,0.000015156342,0.0018542254,0.000015140259,0.0010257497,0.9944056,0.00030771727,0.0012993743],"study_design_scores_gemma":[0.0013748263,0.002874112,0.0012848488,0.00022674081,0.00003526319,0.0005671549,0.00090969517,0.00024361073,0.027115911,0.95776695,0.007400914,0.00019995426],"about_ca_topic_score_codex":0.0000058356263,"about_ca_topic_score_gemma":0.0000011255232,"teacher_disagreement_score":0.064715564,"about_ca_system_score_codex":0.000019231808,"about_ca_system_score_gemma":0.00011363486,"threshold_uncertainty_score":0.33356196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012182757,0.000043398883,0.7746634,0.004139727,0.0019807015,0.00004503349,5.124787e-8,0.00013780972,0.21777159],"genre_scores_gemma":[0.9832731,4.1371229e-7,0.0012454917,0.0010704665,0.00020408783,0.0000043028863,7.61736e-8,0.0000014619485,0.014200588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996233,0.00003636794,0.00006953675,0.00008451871,0.0001034485,0.000082856284],"domain_scores_gemma":[0.9995937,0.000025675447,0.000016315786,0.000272076,0.00005213813,0.00004014833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003110538,0.000031194133,0.00003546818,0.000010577956,0.000044779455,0.000116256866,0.0003957952,0.000014935841,0.000018127565],"category_scores_gemma":[0.000009520717,0.000015285455,0.000020075006,0.00010234347,0.0000087574435,0.0001192648,0.00006409161,0.000036078807,0.00032782473],"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":[4.5325513e-7,0.0000044284398,0.000057427616,2.9514618e-7,0.0000029911296,0.000001474446,0.00045764475,0.00015583265,0.000007245217,0.6925822,0.30210677,0.004623223],"study_design_scores_gemma":[0.000104335595,0.000034183722,0.0001406084,0.0000023990008,5.056681e-7,0.00003215145,0.00013871444,0.17069414,0.00014547039,0.004140407,0.8245084,0.000058683305],"about_ca_topic_score_codex":0.00005777717,"about_ca_topic_score_gemma":0.000031612144,"teacher_disagreement_score":0.9820548,"about_ca_system_score_codex":0.000010447205,"about_ca_system_score_gemma":0.00001700318,"threshold_uncertainty_score":0.42136332},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71408623,0.00069430534,0.27940705,0.002558114,0.00021731928,0.00009822097,4.77835e-7,0.000041998865,0.0028962486],"genre_scores_gemma":[0.9968008,0.000014880591,0.0021488217,0.00092313974,0.000027297066,0.000003776618,1.17030616e-7,0.000004068378,0.00007708921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939084,0.00005062904,0.00013382781,0.00019112995,0.00011262834,0.00012093818],"domain_scores_gemma":[0.99961895,0.00008584292,0.000095234645,0.00014798764,0.000023537757,0.000028471575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022611198,0.00008502756,0.000109195746,0.000017028062,0.00013547964,0.000105245,0.00020439159,0.000021340142,0.0000042685706],"category_scores_gemma":[0.000012101257,0.00005300475,0.000017592272,0.00007682092,0.00008805527,0.00020903345,0.000043762724,0.00006736375,0.0000012848751],"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.00039370815,0.0003629823,0.051370602,0.0013009143,0.0003131669,0.00009711452,0.15430418,0.007946841,0.011454058,0.67157537,0.03554623,0.06533483],"study_design_scores_gemma":[0.003296763,0.0011137616,0.07162573,0.0031997934,0.00008177715,0.0003123389,0.003349882,0.8272989,0.00955329,0.061605517,0.015649533,0.002912735],"about_ca_topic_score_codex":0.000043196495,"about_ca_topic_score_gemma":0.0000069149983,"teacher_disagreement_score":0.81935203,"about_ca_system_score_codex":0.000006651873,"about_ca_system_score_gemma":0.0000072514003,"threshold_uncertainty_score":0.2161471},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062774597,0.000048754744,0.988741,0.00014811507,0.0039160214,0.00043332062,9.45981e-7,0.00024024166,0.00019413215],"genre_scores_gemma":[0.41263065,0.0000011046728,0.5863282,0.00042995048,0.0005506002,0.000027094573,2.795244e-7,0.000010210415,0.000021910619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973104,0.00005746653,0.00040746576,0.0009664945,0.00051542855,0.00074273575],"domain_scores_gemma":[0.99826807,0.00017193223,0.00018716221,0.00062321645,0.00052574766,0.00022387107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352008,0.00022750643,0.00025657885,0.00030330298,0.00068102934,0.00084610935,0.0019674199,0.00006975234,0.000003737831],"category_scores_gemma":[0.000060306866,0.00020838634,0.00009123977,0.0011568412,0.00016917058,0.00092986826,0.0004796269,0.00011872051,0.000021490938],"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.000015398895,0.00024806047,0.0023741669,0.00035616066,0.00005903073,0.00002139223,0.010500876,0.08399566,0.0085654175,0.05814593,0.00342521,0.8322927],"study_design_scores_gemma":[0.00022524918,0.00018295216,0.0005450006,0.000074147436,0.0000023506818,0.000115526665,0.000012962472,0.9934111,0.00048495963,0.0013282303,0.0033205708,0.00029692758],"about_ca_topic_score_codex":0.000010774907,"about_ca_topic_score_gemma":0.0000012039266,"teacher_disagreement_score":0.9094155,"about_ca_system_score_codex":0.00011081882,"about_ca_system_score_gemma":0.00025606088,"threshold_uncertainty_score":0.84977484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23721552,0.00066517614,0.7297556,0.014425416,0.006030075,0.0009995812,4.947618e-7,0.0002068374,0.010701333],"genre_scores_gemma":[0.9980949,0.0000067130404,0.00053482625,0.0009631582,0.00013264788,0.000010903885,9.647307e-8,6.239626e-7,0.0002561337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990565,0.00005183861,0.00034261926,0.00008174787,0.00031092748,0.00015636513],"domain_scores_gemma":[0.9994286,0.00002825676,0.00018834007,0.00021312345,0.00010181801,0.000039915205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004855772,0.000060307684,0.000092550225,0.0000573653,0.00021953549,0.00040077567,0.0009531889,0.000044988814,0.000028300234],"category_scores_gemma":[0.00006938778,0.000029361947,0.000057476776,0.00044882632,0.00019534554,0.0036878053,0.0001482796,0.000064598855,0.00006356369],"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.000004422825,0.000027374645,0.00085809926,0.000018776747,0.000013440119,1.1841479e-7,0.0053147497,0.048886407,0.00037019828,0.853166,0.021452166,0.069888264],"study_design_scores_gemma":[0.00021177092,0.000086082844,0.002349101,0.000046068053,0.0000013352795,0.000012761709,0.00061077473,0.97741294,0.0017229607,0.008508136,0.008921545,0.00011654766],"about_ca_topic_score_codex":0.0003240229,"about_ca_topic_score_gemma":0.000004722176,"teacher_disagreement_score":0.9285265,"about_ca_system_score_codex":0.000012558848,"about_ca_system_score_gemma":0.00007485771,"threshold_uncertainty_score":0.3864689},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20443247,0.00007933457,0.7924663,0.0009203163,0.00048226575,0.00061795465,0.000017559125,0.0001637137,0.0008200979],"genre_scores_gemma":[0.99655825,0.000029732886,0.0029248358,0.00023658745,0.00012955,0.000053214513,0.000006890107,0.000014825701,0.00004609047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982142,0.000019247664,0.00042521607,0.0005859273,0.00027223845,0.00048317926],"domain_scores_gemma":[0.99880344,0.00008337289,0.0001667897,0.0001591273,0.00043492374,0.00035237125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017314943,0.00029377162,0.00037772616,0.0004524876,0.00017237336,0.00035017438,0.00034527737,0.0001338561,0.000012489654],"category_scores_gemma":[0.000020685531,0.00027532785,0.000038280206,0.00039543712,0.000046805268,0.0003125873,0.000029757672,0.00024349024,0.0000044421768],"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.000039489485,0.000104843726,0.0027741166,0.00024234742,0.00005500693,0.000025502955,0.0014842994,0.0038565372,0.0047924705,0.9529838,0.0005742935,0.03306729],"study_design_scores_gemma":[0.0005425323,0.00069352874,0.0076972474,0.00018845413,0.000006239603,0.000060411396,0.000049624432,0.9886169,0.0013251726,0.00021457674,0.00026582982,0.00033949802],"about_ca_topic_score_codex":0.0033985858,"about_ca_topic_score_gemma":0.00030374728,"teacher_disagreement_score":0.98476034,"about_ca_system_score_codex":0.00013518716,"about_ca_system_score_gemma":0.00023361889,"threshold_uncertainty_score":0.9999699},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045335896,0.00009058464,0.9505792,0.00011248758,0.001098963,0.00019884553,0.0000022529337,0.00008258734,0.00249918],"genre_scores_gemma":[0.93410236,8.4790616e-7,0.065040946,0.00015453235,0.00018586584,0.000054463788,2.8254266e-7,0.0000069405196,0.00045376664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924034,0.00003455779,0.00022641184,0.0001548604,0.00008792465,0.00025588798],"domain_scores_gemma":[0.9991079,0.0003639344,0.00008212017,0.00030318997,0.000071695424,0.00007116157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035677946,0.0000945318,0.0001761244,0.00008583269,0.000048065715,0.000026342874,0.0003536467,0.000050628143,0.000025956957],"category_scores_gemma":[0.00013653316,0.00006878561,0.00012335995,0.00010259543,0.000020097723,0.00012847835,0.00008346501,0.000046655605,0.000014011716],"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.000061427876,0.00056671235,0.007879076,0.0003125213,0.00021451298,0.0000014639419,0.007854545,0.0007687322,0.008565647,0.78171134,0.013321178,0.17874286],"study_design_scores_gemma":[0.0009056657,0.00030580946,0.004504223,0.00024877046,0.000027275875,0.00009200791,0.00056494673,0.75385743,0.21928136,0.0021142028,0.01744457,0.00065376604],"about_ca_topic_score_codex":0.000045379875,"about_ca_topic_score_gemma":0.000040663028,"teacher_disagreement_score":0.88876647,"about_ca_system_score_codex":0.00001351792,"about_ca_system_score_gemma":0.000010046538,"threshold_uncertainty_score":0.28049955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74580723,0.0032489223,0.24868906,0.00002784877,0.00043305397,0.0003125401,0.000002189033,0.00011584474,0.0013633333],"genre_scores_gemma":[0.9925203,0.00010596242,0.00674033,0.00016497732,0.00019808914,0.000054881715,0.0000013325458,0.000021693782,0.00019244694],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984425,0.00005819438,0.00035458172,0.0006013549,0.00012518285,0.00041819888],"domain_scores_gemma":[0.9992204,0.000051929506,0.00016592183,0.0003565761,0.000086050815,0.00011915522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004323367,0.00024995068,0.0002749404,0.00010092472,0.00041795333,0.00026272738,0.00038793727,0.00011008226,0.000006334858],"category_scores_gemma":[0.0000033702395,0.00020461941,0.000044817883,0.00023308251,0.00008134765,0.00014505384,0.0001231037,0.00019007415,0.000024077553],"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.0012040135,0.0007373639,0.0778369,0.0024130435,0.0006355641,0.00012224878,0.14045092,0.006862024,0.40697166,0.08170445,0.02313284,0.25792897],"study_design_scores_gemma":[0.008590977,0.0066289254,0.061866757,0.0049056243,0.00010837211,0.008932366,0.0057017244,0.17717887,0.35569337,0.002928913,0.35855597,0.008908136],"about_ca_topic_score_codex":0.000043918968,"about_ca_topic_score_gemma":0.0000073599394,"teacher_disagreement_score":0.3354231,"about_ca_system_score_codex":0.00002036587,"about_ca_system_score_gemma":0.00001740718,"threshold_uncertainty_score":0.83441377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54526234,0.0002463798,0.44868177,0.0012026804,0.002990356,0.00008354009,6.451327e-8,0.000031969033,0.0015009043],"genre_scores_gemma":[0.9948198,0.0000151841505,0.0011649007,0.0011179467,0.002825293,2.7828756e-7,6.3354584e-8,0.000011324871,0.00004516342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783105,0.0004535733,0.00066793413,0.00013483396,0.000500311,0.00041231528],"domain_scores_gemma":[0.9969587,0.00197402,0.00033003886,0.00036405324,0.00030355653,0.00006967131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013130725,0.00015299415,0.00022219599,0.00007754637,0.0005983755,0.00017967963,0.0010262247,0.000057135258,0.000017478698],"category_scores_gemma":[0.00017226944,0.000076738885,0.0001730642,0.00042383777,0.00003935972,0.0003161731,0.00015328085,0.00068181806,0.000023445695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078393676,0.00034323748,0.011417885,0.00008494777,0.00090102036,0.0003154303,0.07649403,0.43252727,0.012481338,0.16678174,0.0789016,0.21896759],"study_design_scores_gemma":[0.0016885224,0.0028215637,0.013414889,0.002630952,0.000104785664,0.007708488,0.012994115,0.9162961,0.004994735,0.0065820296,0.029796634,0.0009671683],"about_ca_topic_score_codex":0.0000668911,"about_ca_topic_score_gemma":0.00005200784,"teacher_disagreement_score":0.48376885,"about_ca_system_score_codex":0.00021016225,"about_ca_system_score_gemma":0.000059702932,"threshold_uncertainty_score":0.4602281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008558357,0.00006497869,0.9967384,0.00013919901,0.0006105887,0.00076145184,3.061257e-7,0.00016056224,0.0006686788],"genre_scores_gemma":[0.9228997,0.000004079865,0.075807355,0.00024087784,0.000112175134,0.00018584613,8.7935774e-7,0.000009236769,0.0007398189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895537,0.000095817195,0.00032884654,0.00025681744,0.00011442518,0.0002487368],"domain_scores_gemma":[0.9990795,0.00028736878,0.000112279966,0.0002447634,0.00022330972,0.000052755106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048152928,0.0001105862,0.00023977763,0.00008362463,0.00013900522,0.00004304533,0.00029239518,0.000079762074,0.000017393393],"category_scores_gemma":[0.000029735971,0.0000893225,0.00012361097,0.00022983458,0.000032102194,0.00024163729,0.000027934484,0.00006116916,0.000005156439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047760174,0.000419291,0.0005349194,0.000050944618,0.00013758519,0.0000072410494,0.00049788784,0.9004769,0.002225097,0.034542613,0.023724811,0.036905162],"study_design_scores_gemma":[0.0010861354,0.0004110293,0.000034917186,0.00001860518,0.000004062999,0.000027322774,0.000017664172,0.9947137,0.0010395779,0.00024855993,0.002289545,0.00010883358],"about_ca_topic_score_codex":0.00004615196,"about_ca_topic_score_gemma":0.000007720649,"teacher_disagreement_score":0.9220439,"about_ca_system_score_codex":0.00002888029,"about_ca_system_score_gemma":0.000040403804,"threshold_uncertainty_score":0.36424658},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027425477,0.000025292125,0.9514172,0.000077388526,0.0011985163,0.00015411573,2.511105e-7,0.00006508561,0.019636646],"genre_scores_gemma":[0.9767232,2.581799e-7,0.022909358,0.00012053431,0.00018760427,0.0000046576083,4.238505e-8,0.0000060338643,0.000048311525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807876,0.00028398688,0.00030809292,0.00045321736,0.00036506407,0.0005108652],"domain_scores_gemma":[0.9984297,0.00034211893,0.00012494993,0.00076987647,0.00020104185,0.0001322831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016886417,0.0001476401,0.00020940638,0.00003706408,0.0004874973,0.00021268777,0.0016858667,0.000038428218,0.000035739562],"category_scores_gemma":[0.000092244474,0.00008481988,0.00006798605,0.0013163147,0.0018024932,0.00022647712,0.00043723843,0.00015705547,0.000034675984],"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.0000039529605,0.000026987376,0.00016043652,0.0000044551616,0.0000036589545,0.0000020555897,0.0003225763,0.0031289586,0.00009148071,0.9921148,0.0000641438,0.0040764823],"study_design_scores_gemma":[0.00018133648,0.00024582833,0.00023816321,0.00012404744,0.000006041123,0.0001692581,0.00000434965,0.97358006,0.0016576658,0.022803467,0.00081721676,0.00017253988],"about_ca_topic_score_codex":0.0000011973653,"about_ca_topic_score_gemma":7.59378e-7,"teacher_disagreement_score":0.9704511,"about_ca_system_score_codex":0.00003127771,"about_ca_system_score_gemma":0.00018642747,"threshold_uncertainty_score":0.6641362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0917272,0.000118223616,0.88771176,0.012458797,0.0014759316,0.00023363972,0.0000025071186,0.0007389106,0.0055330493],"genre_scores_gemma":[0.9766152,0.0000033266745,0.0026647171,0.020593382,0.00007020351,0.000010345304,0.0000082897695,0.0000037785935,0.000030747462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987307,0.000033073342,0.000448989,0.0001620639,0.00033710527,0.0002880366],"domain_scores_gemma":[0.9991332,0.00001564011,0.0003403026,0.00027950585,0.00015070158,0.00008064036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027053786,0.00015498207,0.00015295162,0.00026783158,0.0002964957,0.00084452913,0.000500467,0.00006868154,0.000006462099],"category_scores_gemma":[0.0000178941,0.00014088069,0.000083205574,0.000547448,0.00002622402,0.0049997186,0.00003158125,0.00016186264,0.000099928526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004899506,0.000121480334,0.0026595253,0.00028224417,0.00005347736,0.000028999879,0.023367016,0.010021196,0.0031696372,0.09491909,0.20164941,0.66367894],"study_design_scores_gemma":[0.0046457094,0.00060589967,0.055656455,0.0015720206,0.000044622815,0.00082444545,0.002464675,0.6368509,0.0045910124,0.023240466,0.26573497,0.0037688438],"about_ca_topic_score_codex":0.000016262426,"about_ca_topic_score_gemma":0.0000026906773,"teacher_disagreement_score":0.885047,"about_ca_system_score_codex":0.000051166175,"about_ca_system_score_gemma":0.000031263444,"threshold_uncertainty_score":0.81438136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016607061,0.0005861125,0.9455669,0.00026564897,0.0014660697,0.00009079989,7.1370145e-8,0.000164696,0.035252642],"genre_scores_gemma":[0.9970448,0.00006498198,0.001119808,0.00040451204,0.00056046405,0.000011458197,5.701139e-7,0.000006651728,0.00078675675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990347,0.00006755792,0.00023122858,0.00024424505,0.00010803137,0.0003142402],"domain_scores_gemma":[0.9994668,0.00011202446,0.000052881915,0.00028048514,0.00003662394,0.000051213632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003163528,0.000092038885,0.00012882697,0.0000731139,0.00006660203,0.00012042335,0.00038352137,0.00007495757,0.000021956683],"category_scores_gemma":[0.000019829731,0.000084463776,0.000037269503,0.000681875,0.000011216278,0.00025575492,0.00008520542,0.00016982514,0.00003030525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002155108,0.00010831846,0.073194794,0.000010028293,0.000018338673,0.00032100425,0.00093447475,0.6202612,0.00003167215,0.029581448,0.020049777,0.2554674],"study_design_scores_gemma":[0.0002132307,0.000029377274,0.0034212433,0.000060501712,6.6044873e-7,0.00008073795,0.000022652986,0.9628114,0.000003444055,0.00032335223,0.032909892,0.00012348412],"about_ca_topic_score_codex":0.00005830083,"about_ca_topic_score_gemma":0.0005784458,"teacher_disagreement_score":0.98043776,"about_ca_system_score_codex":0.00003296925,"about_ca_system_score_gemma":0.000014756868,"threshold_uncertainty_score":0.34443328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044135083,0.0017088867,0.99102545,0.00041224554,0.0005287311,0.0008598307,0.00000775188,0.00016734026,0.0008762789],"genre_scores_gemma":[0.97610366,0.000034622888,0.02211463,0.0010304052,0.00027430564,0.00017012685,0.00003079081,0.000019295525,0.00022216461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983203,0.0000537649,0.00042806822,0.00069628045,0.00011505485,0.00038656747],"domain_scores_gemma":[0.9989544,0.00007763565,0.00021725739,0.00045207256,0.00020200691,0.00009658307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041580037,0.0002501755,0.00032481464,0.000135801,0.00036963384,0.00036052262,0.00044560846,0.00018894859,0.0000037826758],"category_scores_gemma":[0.000008234502,0.0002159324,0.00009936638,0.00033417178,0.000042411826,0.00016427728,0.000025291085,0.00012739614,0.000005987471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003335168,0.00086226274,0.0002441165,0.000413455,0.00009082621,0.00000543309,0.0025707826,0.740523,0.018648082,0.17722699,0.03251764,0.02656391],"study_design_scores_gemma":[0.0009988907,0.00034763466,0.000029749168,0.00008200894,0.000005272085,0.00005631457,0.00014468648,0.9433951,0.0010306948,0.00020065726,0.053326983,0.00038201327],"about_ca_topic_score_codex":0.000008767473,"about_ca_topic_score_gemma":0.0000017023164,"teacher_disagreement_score":0.9716902,"about_ca_system_score_codex":0.000048280897,"about_ca_system_score_gemma":0.000029445855,"threshold_uncertainty_score":0.8805468},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011766749,0.0000031467096,0.9826073,0.00024201152,0.0023280308,0.00019173868,5.7646986e-7,0.0001546189,0.0027058371],"genre_scores_gemma":[0.8360686,1.9503426e-7,0.1594135,0.00026286056,0.000248011,0.00003776094,6.6552525e-7,0.000005799397,0.0039626337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992936,0.0000107329315,0.00016624936,0.0002382478,0.00007164033,0.00021951477],"domain_scores_gemma":[0.9993585,0.00012997678,0.00005761404,0.00031462262,0.00007855689,0.00006075525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002650259,0.000082762934,0.00010463653,0.00003087926,0.000142936,0.00014629927,0.0003608882,0.000062334424,0.00001802724],"category_scores_gemma":[0.00007089293,0.000065291235,0.000072658455,0.0000664768,0.0000137558845,0.00013859906,0.00006743685,0.00010187662,0.000045004075],"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.000008148322,0.000078641475,0.0012804302,0.000027774586,0.000021490916,0.000010203619,0.0008701115,0.00065061636,0.0037366985,0.9449174,0.0082069095,0.04019158],"study_design_scores_gemma":[0.00030532837,0.000036482783,0.0002703101,0.000007897435,0.0000016080667,0.000032440585,0.000021917826,0.9861214,0.00015644643,0.0007835397,0.012152618,0.00011000914],"about_ca_topic_score_codex":0.000023952802,"about_ca_topic_score_gemma":0.00023739364,"teacher_disagreement_score":0.9854708,"about_ca_system_score_codex":0.0000069646007,"about_ca_system_score_gemma":0.000019146762,"threshold_uncertainty_score":0.26624992},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33483374,0.000021648564,0.6596841,0.00066074455,0.0043022037,0.00006562462,9.84385e-7,0.000025800158,0.00040514654],"genre_scores_gemma":[0.96032774,0.0000059192307,0.039071552,0.00022899918,0.0003448478,0.0000018951558,0.0000010684939,0.0000072221555,0.000010749924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974271,0.00008270416,0.0007891811,0.00037042896,0.0010678858,0.0002627019],"domain_scores_gemma":[0.9960333,0.000704636,0.0008283022,0.0003797569,0.0019017202,0.0001522801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016833905,0.00017582774,0.00029783702,0.0011353688,0.0002868967,0.0007018773,0.002235435,0.00005426259,0.0000190813],"category_scores_gemma":[0.0004228954,0.00015295923,0.0001329493,0.00085398444,0.00031520618,0.0016782882,0.0003207488,0.00024102589,0.000009835271],"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.00005833291,0.00018579263,0.009511861,0.000011508765,0.00016009429,0.000021903174,0.0009378355,0.016222196,0.0020894604,0.83209425,0.00057748676,0.13812928],"study_design_scores_gemma":[0.00093336,0.00054445205,0.047264967,0.00039299595,0.0000109489565,0.00042857093,0.000015262005,0.9041505,0.0009341277,0.044473406,0.0006191938,0.00023223402],"about_ca_topic_score_codex":0.000036841033,"about_ca_topic_score_gemma":0.00005472729,"teacher_disagreement_score":0.8879283,"about_ca_system_score_codex":0.00010169494,"about_ca_system_score_gemma":0.00020049578,"threshold_uncertainty_score":0.6768219},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047641937,0.00034823464,0.9894517,0.0001978694,0.003051506,0.00015474424,1.4377089e-7,0.00002739798,0.002004201],"genre_scores_gemma":[0.94047165,0.00001736456,0.057872407,0.0001105702,0.0014244916,0.000004286153,8.097989e-8,0.000010578463,0.00008856506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998088,0.0004386546,0.00059710117,0.00018594299,0.00042623223,0.00026409546],"domain_scores_gemma":[0.99856114,0.000492355,0.0003074624,0.0001975296,0.00025603018,0.00018545457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030529632,0.00015573834,0.0003793483,0.00016695015,0.00014598152,0.00031532111,0.0005270939,0.00012952274,0.0000038970334],"category_scores_gemma":[0.00013519704,0.00011858546,0.00014083015,0.00020327336,0.00004432472,0.000744213,0.00007934553,0.00034481366,0.000011060176],"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.0002414286,0.00023810014,0.000039409868,0.000017071361,0.00012846896,0.000039782946,0.0019170493,0.008659678,0.0010514121,0.9651892,0.0038171958,0.018661201],"study_design_scores_gemma":[0.009338463,0.0037958708,0.00027121004,0.00041505895,0.00014727362,0.0035518166,0.0008306757,0.67317873,0.006578697,0.28757676,0.0132297585,0.0010856718],"about_ca_topic_score_codex":0.0000016694535,"about_ca_topic_score_gemma":7.84003e-8,"teacher_disagreement_score":0.93570745,"about_ca_system_score_codex":0.00008898596,"about_ca_system_score_gemma":0.000108937624,"threshold_uncertainty_score":0.4835775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.972546,0.0023071154,0.022682665,0.00008300146,0.0015173275,0.0001238235,0.000008869414,0.00009331625,0.0006378701],"genre_scores_gemma":[0.9995534,0.0001958061,0.00007279737,0.00007599027,0.000012737012,0.000015096114,0.0000070718374,0.0000084756675,0.000058622805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989239,0.00011792087,0.0002519536,0.00023045542,0.00018888645,0.00028691415],"domain_scores_gemma":[0.9993346,0.0000677,0.00010702523,0.00026769607,0.00009131084,0.00013170492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030554223,0.00015168023,0.00023703008,0.00012576328,0.00015833284,0.00005531882,0.00021965212,0.00010977807,0.000004136116],"category_scores_gemma":[0.000006189017,0.00013734038,0.00009904664,0.0006353954,0.00004357628,0.0004417639,0.000031158677,0.000115607276,0.0000018507635],"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.000009457255,0.00027353858,0.030422399,0.000024779758,0.000047195874,0.0000012187343,0.0008287895,0.000009388226,0.00593174,0.95669496,0.002112191,0.0036443146],"study_design_scores_gemma":[0.0063813403,0.0022447652,0.22381458,0.00027321972,0.00019856075,0.00022857402,0.00061786536,0.04785588,0.09545004,0.6095253,0.010860977,0.002548875],"about_ca_topic_score_codex":0.00017380845,"about_ca_topic_score_gemma":0.000017038383,"teacher_disagreement_score":0.34716967,"about_ca_system_score_codex":0.000017883931,"about_ca_system_score_gemma":0.000010284969,"threshold_uncertainty_score":0.5600578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7895103,0.000006909343,0.19465178,0.00054734416,0.00089801534,0.00020874702,7.376578e-7,0.00008062394,0.014095549],"genre_scores_gemma":[0.9984266,0.0000046617256,0.0009303552,0.00012773513,0.00018988148,0.000026545533,7.357416e-7,0.0000031489358,0.00029031464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993553,0.000018259434,0.00020699005,0.00015017852,0.00015187795,0.00011735912],"domain_scores_gemma":[0.9992239,0.00008484279,0.00009169773,0.0004971279,0.000080986785,0.000021437523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003678999,0.000055813252,0.00006349854,0.000029266354,0.0001377515,0.000045023997,0.0005092189,0.0000263625,0.000043211217],"category_scores_gemma":[0.00000418101,0.000033240776,0.000031156214,0.00017470951,0.000020830059,0.000106709944,0.00006434481,0.00013414508,0.000036996295],"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.000012290796,0.000080555445,0.018394876,0.000018549914,0.000024715153,3.023644e-7,0.0014325583,0.0016666467,0.025732355,0.86742824,0.011173422,0.07403549],"study_design_scores_gemma":[0.000157937,0.000120983044,0.005658801,0.000011941871,0.0000010890004,0.000011937434,0.00009967985,0.89835393,0.018900413,0.000103891274,0.076496445,0.00008297458],"about_ca_topic_score_codex":0.000038339273,"about_ca_topic_score_gemma":0.00005194863,"teacher_disagreement_score":0.89668727,"about_ca_system_score_codex":0.00000669189,"about_ca_system_score_gemma":0.000010115104,"threshold_uncertainty_score":0.13555196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025914747,0.00030568123,0.9645409,0.00017686644,0.0020649952,0.00019293216,2.4378545e-7,0.00011771753,0.006685917],"genre_scores_gemma":[0.9983908,0.00005453669,0.000570522,0.0001737659,0.0004987392,0.000022851546,0.0000023101709,0.000014272248,0.00027218403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826825,0.00019644412,0.00060121034,0.00037534928,0.0001791948,0.00037958202],"domain_scores_gemma":[0.999059,0.00016514763,0.00024710537,0.00036392975,0.00010401987,0.000060798637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423078,0.0001640757,0.00027634058,0.00017501369,0.000086278626,0.00010887172,0.0004003095,0.00019494716,0.00005365675],"category_scores_gemma":[0.000030652966,0.0001627343,0.00010757418,0.0007971967,0.00003087065,0.00047141843,0.00010476596,0.0003555616,0.0000129370155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010589892,0.000078170226,0.003938099,0.000010508291,0.000019236952,0.000011260937,0.001428355,0.8899768,0.000029582863,0.021693934,0.0020466268,0.08075683],"study_design_scores_gemma":[0.00034977598,0.00008905622,0.0014733104,0.00014838544,0.0000032664557,0.000032764463,0.00015554923,0.9970757,0.000016212562,0.00012923781,0.00037000695,0.00015677571],"about_ca_topic_score_codex":0.000083496314,"about_ca_topic_score_gemma":0.00024835102,"teacher_disagreement_score":0.97247607,"about_ca_system_score_codex":0.000102062426,"about_ca_system_score_gemma":0.000006708976,"threshold_uncertainty_score":0.66361123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33931947,0.000005926081,0.64691794,0.00034693084,0.0006151618,0.000115231436,2.5189303e-7,0.000059361857,0.012619752],"genre_scores_gemma":[0.99210495,0.0000012199049,0.005995282,0.0006368677,0.00023458942,0.000010395688,6.914563e-7,0.0000043263603,0.0010117013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889344,0.00008904189,0.0003261172,0.00023304335,0.00021867812,0.00023969525],"domain_scores_gemma":[0.99884903,0.00032116708,0.00013542201,0.00047396185,0.00018058681,0.00003983051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609003,0.000107327054,0.00020930168,0.0001720122,0.00013813267,0.0001820647,0.00060436415,0.00003953389,0.0001780364],"category_scores_gemma":[0.000015650156,0.00006172703,0.00014229321,0.0009060945,0.00003340227,0.00025169944,0.00018506679,0.000114936556,0.00009850087],"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.000012659353,0.00042432843,0.011741569,0.000059210586,0.0018566205,0.0000054365396,0.0068986462,0.107025295,0.0011738087,0.25487638,0.03665572,0.57927036],"study_design_scores_gemma":[0.000047635483,0.00013301107,0.0036086016,0.000024372686,0.000016909173,0.0000037326909,0.00009116387,0.9949015,0.000495944,0.00004302849,0.0005498722,0.00008426735],"about_ca_topic_score_codex":0.00020260489,"about_ca_topic_score_gemma":0.000009072793,"teacher_disagreement_score":0.88787615,"about_ca_system_score_codex":0.00002363227,"about_ca_system_score_gemma":0.000007373777,"threshold_uncertainty_score":0.2517155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008007931,0.00039748466,0.98719096,0.0005130446,0.0031077,0.00018898181,0.000012657034,0.00004256324,0.0005386463],"genre_scores_gemma":[0.32634854,0.00012000721,0.66792107,0.0005493379,0.0029363725,0.000024158444,0.0000025212028,0.00005012826,0.0020478538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982056,0.000111971036,0.0006374826,0.00026715643,0.0004099772,0.00036779238],"domain_scores_gemma":[0.9982991,0.00023831832,0.0005259089,0.00033120153,0.00046123817,0.00014421297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081360707,0.00020215998,0.00044689086,0.0001809402,0.0002483625,0.00012026645,0.00075129373,0.00011169652,0.000023115803],"category_scores_gemma":[0.00006353108,0.00015638617,0.000415391,0.0002706128,0.000065767614,0.00093057705,0.00008556167,0.00025766893,0.000012522139],"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.00019968365,0.0007982615,0.0006492293,0.000073337535,0.001181039,0.0009250247,0.009027844,0.006323574,0.0017493943,0.008590041,0.17713183,0.79335076],"study_design_scores_gemma":[0.002424169,0.0015648406,0.00076678325,0.00010858128,0.000032566302,0.0041566333,0.00019065237,0.92884594,0.0032041117,0.0011261182,0.057078436,0.0005011819],"about_ca_topic_score_codex":0.000017667388,"about_ca_topic_score_gemma":0.0000022719232,"teacher_disagreement_score":0.92252237,"about_ca_system_score_codex":0.00008169075,"about_ca_system_score_gemma":0.00012497335,"threshold_uncertainty_score":0.63772434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017899156,0.0000787721,0.9728822,0.00033200422,0.00046414702,0.00013251205,3.9113463e-8,0.00007793441,0.00813323],"genre_scores_gemma":[0.9578711,0.0000020441187,0.029137624,0.00017999749,0.00016937703,0.000012892821,8.515915e-8,0.0000029645087,0.012623954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995373,0.000011997061,0.00013291341,0.00013009776,0.00005649977,0.00013122869],"domain_scores_gemma":[0.99978447,0.000025139201,0.000019661973,0.00011432025,0.000028212748,0.000028216999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010184776,0.000043639953,0.000070711336,0.00004020696,0.00006014893,0.000035526897,0.00018219634,0.000021664926,0.000009453823],"category_scores_gemma":[0.00001729851,0.000031980395,0.000027136695,0.00011175417,0.000004913861,0.00019858113,0.000034572415,0.000031292857,0.000015309914],"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.000054663986,0.0001213127,0.0113843605,0.000099292236,0.000034257468,0.000052761545,0.019088158,0.013369317,0.0041838256,0.35910848,0.27060512,0.32189846],"study_design_scores_gemma":[0.0005434234,0.00011185124,0.0007242928,0.000063984706,5.033861e-7,0.00013445101,0.00011157436,0.9543934,0.0023412376,0.0006987942,0.040693313,0.00018320142],"about_ca_topic_score_codex":0.00029203453,"about_ca_topic_score_gemma":0.00009701665,"teacher_disagreement_score":0.9437446,"about_ca_system_score_codex":0.000015332073,"about_ca_system_score_gemma":0.00003658019,"threshold_uncertainty_score":0.13041227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6144162,0.00043145308,0.37964758,0.0010081352,0.004181665,0.0000747647,4.940922e-7,0.000036630143,0.00020308797],"genre_scores_gemma":[0.9497287,0.0002098698,0.043517638,0.0010769365,0.005411803,0.000002434728,0.0000018293468,0.000014769966,0.00003601049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809235,0.000055669323,0.00074829336,0.00026532603,0.00042841432,0.00040991814],"domain_scores_gemma":[0.9990226,0.00017420595,0.0002905463,0.00012361072,0.00024548022,0.00014352922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011594828,0.00019577245,0.00030681936,0.00031588905,0.0000925251,0.00030839565,0.0006858693,0.000089304755,0.0000063221714],"category_scores_gemma":[0.00001413539,0.00018429414,0.00008544432,0.0002386465,0.000027058975,0.0006159546,0.0002535881,0.00042815483,0.0000050260824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012043337,0.00008087783,0.002443428,0.000015299478,0.00012997277,0.000047332534,0.0032261868,0.74718094,0.00018724981,0.0012927993,0.0009284432,0.24434702],"study_design_scores_gemma":[0.0010671162,0.00020251829,0.0038719056,0.0006329712,0.0000071692043,0.00081264717,0.00005363941,0.9697834,0.00007391804,0.000022388134,0.023259353,0.0002129709],"about_ca_topic_score_codex":0.0000217939,"about_ca_topic_score_gemma":0.000036442216,"teacher_disagreement_score":0.33612993,"about_ca_system_score_codex":0.00027659093,"about_ca_system_score_gemma":0.000037529306,"threshold_uncertainty_score":0.7515297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044390947,0.000021330909,0.85899186,0.00021777263,0.001249243,0.000054372536,4.2475268e-8,0.00014058898,0.094933815],"genre_scores_gemma":[0.9941374,9.251111e-7,0.0037404173,0.00064962957,0.00006617136,0.0000045942006,1.7706266e-7,0.000002762427,0.0013979211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935657,0.00006164667,0.00015676618,0.00018180483,0.00008548391,0.00015773546],"domain_scores_gemma":[0.9996361,0.000059343824,0.000028915776,0.00022106503,0.000020969612,0.00003358432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035656724,0.000054964923,0.00008301196,0.00008523684,0.000040522358,0.00009525337,0.00028935497,0.000029953726,0.000025909954],"category_scores_gemma":[0.00001280504,0.000045210407,0.000031718577,0.00025237998,0.0000069098196,0.00022995727,0.000065082335,0.00006807459,0.00007709138],"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.0000015641513,0.000024337036,0.008179658,0.000007798514,0.000003956985,0.0000054567495,0.00064655114,0.0007284112,0.00016319776,0.9319859,0.008910144,0.04934303],"study_design_scores_gemma":[0.00022603395,0.000046435798,0.003741462,0.000032211417,3.705889e-7,0.000024689365,0.00003401805,0.96337146,0.00010607651,0.0064193467,0.025860585,0.00013734294],"about_ca_topic_score_codex":0.00008345242,"about_ca_topic_score_gemma":0.00009112248,"teacher_disagreement_score":0.962643,"about_ca_system_score_codex":0.0000093782155,"about_ca_system_score_gemma":0.0000057701764,"threshold_uncertainty_score":0.1843627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026962257,0.000013830092,0.99583316,0.00023016006,0.0006193175,0.00016227915,0.0000036681101,0.00016043462,0.00028093136],"genre_scores_gemma":[0.83381796,5.2162414e-7,0.1632313,0.0006031472,0.00031582298,0.000018113382,0.000019934627,0.0000044876406,0.001988714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993464,0.000008409281,0.00018177833,0.00019004333,0.00008766267,0.00018574075],"domain_scores_gemma":[0.9995487,0.000041365405,0.000036883634,0.00020670846,0.000118962336,0.000047409627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032265674,0.00006494571,0.00007257984,0.000033592627,0.00010130971,0.00017641466,0.00019694136,0.000051520106,0.0000064772075],"category_scores_gemma":[0.00001638658,0.000052575288,0.000057012086,0.00009757494,0.000004739388,0.00037784848,0.00003607791,0.00003248867,0.000011769774],"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.000026504946,0.0001043818,0.00030403395,0.00002418706,0.000043429678,0.000005411203,0.0014020515,0.12935412,0.0037622978,0.5734932,0.20025072,0.09122972],"study_design_scores_gemma":[0.00014234419,0.000024061865,0.000022238588,0.0000029519474,0.0000011541284,0.0000053512254,0.000009291642,0.99461824,0.00053753774,0.0008564764,0.0037015853,0.00007875329],"about_ca_topic_score_codex":0.000012418289,"about_ca_topic_score_gemma":0.00011804262,"teacher_disagreement_score":0.8652641,"about_ca_system_score_codex":0.00003670153,"about_ca_system_score_gemma":0.000016108514,"threshold_uncertainty_score":0.2143958},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55362296,0.0025333264,0.36496326,0.0141416965,0.00029135996,0.0015200563,0.000009108197,0.0013267812,0.061591484],"genre_scores_gemma":[0.9540349,0.00034980493,0.044455398,0.00032238127,0.0000495756,0.000076593904,0.0000026604282,0.000009649002,0.00069900154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888605,0.00005406295,0.00031182452,0.00033418866,0.00017844305,0.00023544452],"domain_scores_gemma":[0.9986383,0.00024440076,0.00010068874,0.00077954546,0.00013528604,0.000101796875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039237732,0.00015578076,0.00023292983,0.00021640373,0.00047343204,0.00048357487,0.0013618415,0.00006746488,0.000034296234],"category_scores_gemma":[0.000031156767,0.00014204971,0.000105957806,0.00095495954,0.000100506964,0.00033333592,0.00016293082,0.00023835078,0.0000456619],"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.0001230668,0.0005742102,0.016469909,0.000083770276,0.0015207045,0.0000038656995,0.032806285,0.004173867,0.00418262,0.1611706,0.0036184194,0.77527267],"study_design_scores_gemma":[0.00089032936,0.0005304977,0.03137627,0.00024761452,0.00028961897,0.00010939931,0.0004811761,0.91039735,0.0019273666,0.012365405,0.040388588,0.0009963588],"about_ca_topic_score_codex":0.000100733916,"about_ca_topic_score_gemma":0.00003060004,"teacher_disagreement_score":0.90622354,"about_ca_system_score_codex":0.00004380054,"about_ca_system_score_gemma":0.0000203924,"threshold_uncertainty_score":0.5792619},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44238576,0.00012066155,0.48019424,0.00462561,0.00045609823,0.00031974196,7.0987227e-7,0.00008588475,0.07181127],"genre_scores_gemma":[0.9984638,0.000018214881,0.00077470054,0.00050028256,0.000018035184,0.000003077171,3.9346656e-7,0.0000019218867,0.00021955009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957603,0.00007327942,0.00012224296,0.000091824615,0.00007249044,0.00006411098],"domain_scores_gemma":[0.99921024,0.00027883775,0.00006448076,0.0003596953,0.000071315444,0.000015425487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004096472,0.000041892567,0.000071911294,0.000024292993,0.000114691225,0.0000490644,0.0002109266,0.000022427515,0.0000029146104],"category_scores_gemma":[0.000015784071,0.000025190468,0.00001794145,0.000080944,0.000028064265,0.00008550242,0.00007936147,0.000058345322,0.0000076738925],"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.0000022847369,0.00000831417,0.0004303523,0.0000026517755,0.0000048987317,7.320237e-8,0.0007696212,0.00040645455,0.00010059604,0.9790644,0.00025054225,0.018959798],"study_design_scores_gemma":[0.00024185554,0.00015825132,0.019194685,0.00011509712,0.0000032818184,0.000016725424,0.0003263358,0.9657904,0.0018840483,0.006851211,0.0053062923,0.00011183458],"about_ca_topic_score_codex":0.00020987468,"about_ca_topic_score_gemma":0.00023593816,"teacher_disagreement_score":0.9722132,"about_ca_system_score_codex":0.000006188066,"about_ca_system_score_gemma":0.0000026126995,"threshold_uncertainty_score":0.10272374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10147263,0.00005836201,0.8168203,0.0028387115,0.000380073,0.00017632046,6.142166e-7,0.000084639716,0.07816833],"genre_scores_gemma":[0.9967089,0.0000020916455,0.00030781195,0.0003455725,0.00007034957,0.0000068521413,8.813702e-7,0.0000019949844,0.002555505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948925,0.000084655614,0.00009180764,0.00015157336,0.00010289473,0.00007981034],"domain_scores_gemma":[0.99960816,0.00015329494,0.000026546211,0.00016420177,0.000034579487,0.000013241598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013941666,0.000046824807,0.00005293142,0.00001981386,0.00013259557,0.000103373925,0.000105544954,0.000024292856,0.000026143603],"category_scores_gemma":[0.0000039667793,0.000026049282,0.000021491185,0.00010129122,0.000014012964,0.00014515583,0.000019883144,0.000052912026,0.000011297003],"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.0000070473034,0.000018969,0.0002489911,0.000002280566,0.0000040563427,0.000002996702,0.00034083676,0.0015819877,0.0006623907,0.9525319,0.042959735,0.0016388296],"study_design_scores_gemma":[0.00064771203,0.0001821352,0.014506675,0.00008935359,0.0000056752497,0.00005420205,0.0005851038,0.9182413,0.011302037,0.045293964,0.008854915,0.00023692982],"about_ca_topic_score_codex":0.00029567158,"about_ca_topic_score_gemma":0.000055743505,"teacher_disagreement_score":0.9166593,"about_ca_system_score_codex":0.0000068594745,"about_ca_system_score_gemma":0.0000038183507,"threshold_uncertainty_score":0.106225885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005610955,0.00016073538,0.97833794,0.00020510191,0.006414063,0.0003930571,9.714411e-7,0.00037489898,0.008502261],"genre_scores_gemma":[0.97640216,0.0000040156688,0.015846554,0.0013877563,0.004499964,0.00009578462,0.0000038803723,0.000022126365,0.0017377529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807876,0.00013293342,0.00033902877,0.0003941426,0.00017005626,0.0008850704],"domain_scores_gemma":[0.9985947,0.00023730495,0.00011327851,0.00070382026,0.000106700034,0.0002441984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008156116,0.00021219031,0.0002487854,0.00003942939,0.0002747071,0.00021130584,0.0007530801,0.0001206251,0.0000751334],"category_scores_gemma":[0.000013135945,0.00017050646,0.00012321169,0.0002889602,0.000018562667,0.0007012931,0.00010084723,0.0001381594,0.00013937432],"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.00011854891,0.0002637863,0.001364238,0.00003412556,0.000103241735,0.0000012344827,0.0016333698,0.18222375,0.00038772725,0.44527003,0.319787,0.048812963],"study_design_scores_gemma":[0.0007006564,0.0009185604,0.00057834253,0.00014401397,0.000011340754,0.000024637242,0.0001332278,0.8952772,0.0033219694,0.0039205872,0.09423032,0.0007391587],"about_ca_topic_score_codex":0.000017041793,"about_ca_topic_score_gemma":0.0000558818,"teacher_disagreement_score":0.9707912,"about_ca_system_score_codex":0.00004903683,"about_ca_system_score_gemma":0.000020592037,"threshold_uncertainty_score":0.69530517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007464906,0.000041332132,0.9902489,0.00046518916,0.00062983675,0.0014572458,0.000006910427,0.001550233,0.0048538293],"genre_scores_gemma":[0.97499263,0.0000087840945,0.022229677,0.0004921894,0.0008285946,0.0008262922,0.00003619372,0.000027669917,0.0005579683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982785,0.00004138566,0.0004500785,0.00059072924,0.00021555233,0.00042374112],"domain_scores_gemma":[0.99870265,0.00015462813,0.00019637049,0.00046663915,0.00037016318,0.00010953471],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001887666,0.00025452801,0.00026269586,0.00012594507,0.00023945369,0.0014371057,0.0007151865,0.0001356934,0.000007769072],"category_scores_gemma":[0.000005539724,0.0002364805,0.00019224362,0.0003763232,0.000041956802,0.0012469857,0.00010871744,0.00015811274,0.000111678266],"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.000015519947,0.00012082837,0.00018521745,0.000021663367,0.000045914163,0.0000010449056,0.000052550906,0.0021779505,0.00018353999,0.19623706,0.39075065,0.41020805],"study_design_scores_gemma":[0.00046375178,0.0013544491,0.0006267666,0.00019414653,0.000005643713,0.00009765767,0.000033299548,0.6875526,0.0021394454,0.0728164,0.23389843,0.000817424],"about_ca_topic_score_codex":0.000019340294,"about_ca_topic_score_gemma":0.0000030982403,"teacher_disagreement_score":0.97424614,"about_ca_system_score_codex":0.00010704574,"about_ca_system_score_gemma":0.000024119188,"threshold_uncertainty_score":0.9995995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3515978,0.0005358895,0.64192134,0.00036959356,0.00444881,0.00051938376,0.000015318918,0.000011805201,0.00058004947],"genre_scores_gemma":[0.9983144,0.000034624463,0.0009487919,0.00003256199,0.0005160469,0.000015665022,0.000001965606,0.000007199141,0.00012876594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852616,0.00009965237,0.0008403076,0.00015611059,0.0002573842,0.0001203966],"domain_scores_gemma":[0.9975616,0.00026095106,0.0010359434,0.00011857105,0.00096876547,0.000054215154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051169423,0.00012326143,0.00032488536,0.00023647727,0.000040498053,0.000114862225,0.00041454894,0.000074146265,0.000008103537],"category_scores_gemma":[0.00002816173,0.00009553571,0.0001204505,0.00006902193,0.00006838098,0.00064710807,0.00004561127,0.00011069655,0.0000017555275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046714064,0.00032803803,0.0027358294,0.00014419692,0.0015989222,0.00001825045,0.005472685,0.690674,0.030108096,0.21339786,0.0056441156,0.049410857],"study_design_scores_gemma":[0.0018018247,0.00086803595,0.0035422621,0.0018747705,0.000015448484,0.00014577474,0.002926712,0.9846619,0.002360623,0.00058573077,0.00096752145,0.00024941014],"about_ca_topic_score_codex":0.000030163397,"about_ca_topic_score_gemma":0.0000011751661,"teacher_disagreement_score":0.6467166,"about_ca_system_score_codex":0.0000802556,"about_ca_system_score_gemma":0.00007393767,"threshold_uncertainty_score":0.38958332},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864225,0.000040535237,0.0075885444,0.0018200486,0.00036083057,0.0005233125,0.0000146932625,0.00016825636,0.0030612876],"genre_scores_gemma":[0.76533073,0.000014810921,0.23386508,0.00013277474,0.00044382413,0.000100615944,0.0000030220547,0.000040857914,0.00006828431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733275,1.8428427e-8,0.0006864406,0.0005927111,0.0008783173,0.0005097346],"domain_scores_gemma":[0.9971736,0.00010184478,0.00037203258,0.00011626287,0.002004969,0.00023128741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066601025,0.0003749243,0.0004637376,0.00010330445,0.00013753903,0.00027727295,0.0016614803,0.00022684822,0.0000051544976],"category_scores_gemma":[0.00014431818,0.00028017454,0.00044838642,0.00049305457,0.00025886163,0.0013007321,0.00019537177,0.00041985052,0.0000027452704],"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.00011156332,0.0001701188,0.00018168135,0.000108105516,0.00029111846,5.4093e-7,0.00036737949,0.00069005915,0.070764035,0.9263415,0.00064045674,0.00033346328],"study_design_scores_gemma":[0.009272745,0.010025224,0.003173074,0.0026221261,0.000440737,0.0007759284,0.010782894,0.6761131,0.23708798,0.042550866,0.0042441147,0.0029111973],"about_ca_topic_score_codex":0.00001790135,"about_ca_topic_score_gemma":0.0000011291872,"teacher_disagreement_score":0.8837906,"about_ca_system_score_codex":0.00021956764,"about_ca_system_score_gemma":0.00009001791,"threshold_uncertainty_score":0.9999651},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025103128,0.0007255623,0.94496083,0.013545722,0.00036247697,0.00041400184,0.000024865047,0.0007515178,0.014111906],"genre_scores_gemma":[0.9834931,0.00006863464,0.01544513,0.00052881986,0.0000762776,0.000038955506,0.00004107382,0.000010462439,0.00029757895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846196,0.00017792739,0.00040857174,0.00032783323,0.00028569417,0.00033802798],"domain_scores_gemma":[0.9958372,0.00018018727,0.00019254202,0.003178331,0.0004960495,0.00011569975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052442536,0.00018464989,0.00023047342,0.000061312356,0.0006525004,0.00054647215,0.0022294128,0.000086462634,0.000016473095],"category_scores_gemma":[0.00005929469,0.00015375768,0.00008567124,0.000582739,0.00012823408,0.0006124238,0.00029141305,0.00033285972,0.000059963582],"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.00009618867,0.0014664235,0.013761501,0.00004361788,0.00024303338,0.0000556766,0.008395608,0.017356742,0.0014557872,0.8961886,0.034002878,0.026933935],"study_design_scores_gemma":[0.0029515577,0.00093068444,0.13068375,0.00076454773,0.00005715042,0.0007427272,0.0010031019,0.7252421,0.0015364805,0.02838599,0.10581994,0.0018819699],"about_ca_topic_score_codex":0.00015923755,"about_ca_topic_score_gemma":0.00045481886,"teacher_disagreement_score":0.95838994,"about_ca_system_score_codex":0.00018514851,"about_ca_system_score_gemma":0.0001374808,"threshold_uncertainty_score":0.6270056},"labels":[],"label_agreement":null},{"id":"W1992656560","doi":"10.1142/s0219265903000726","title":"MESSY BROADCASTING IN MULTIDIMENSIONAL DIRECTED TORI","year":2003,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Vertex (graph theory); Computer network; Set (abstract data type); Torus; Process (computing); Broadcast communication network; Atomic broadcast; State (computer science); Distributed computing; Theoretical computer science; Graph; Algorithm; Mathematics","score_opus":0.011940612037317232,"score_gpt":0.2341054699327961,"score_spread":0.22216485789547888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992656560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092350446,0.0007883131,0.8915865,0.0002158158,0.011760651,0.00012357581,1.9453357e-7,0.000086771026,0.0030877294],"genre_scores_gemma":[0.9899442,0.000050818027,0.008915365,0.00022739827,0.0006167383,0.0000044100348,3.036983e-7,0.000015042172,0.00022567877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974915,0.0004950549,0.0010844852,0.00026391112,0.000312701,0.00035234212],"domain_scores_gemma":[0.99807763,0.00042330488,0.00063459197,0.00024248578,0.00048508702,0.00013688675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017901065,0.00019611647,0.00040093096,0.00041336223,0.00011030435,0.00012829993,0.00035730223,0.00016247347,0.00007461615],"category_scores_gemma":[0.0004088836,0.00016786579,0.00021726551,0.0007446763,0.000022556254,0.0008320612,0.000056208784,0.00064403465,0.000008349351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037886403,0.0009951368,0.020830734,0.000055523742,0.0004626402,0.00078135927,0.00336284,0.73033047,0.003855491,0.14887781,0.035919707,0.054149423],"study_design_scores_gemma":[0.0020932923,0.00053678267,0.0024569961,0.0007541453,0.000015370477,0.0035915938,0.00049669226,0.9595735,0.00108646,0.0011495611,0.027775217,0.0004703729],"about_ca_topic_score_codex":0.000025660254,"about_ca_topic_score_gemma":0.0000751729,"teacher_disagreement_score":0.8975938,"about_ca_system_score_codex":0.00023359897,"about_ca_system_score_gemma":0.00007358663,"threshold_uncertainty_score":0.6845368},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44338208,0.000010146922,0.038212333,0.011497024,0.013037581,0.00025851137,0.0000049643772,0.00015663281,0.49344072],"genre_scores_gemma":[0.9950773,0.0000020532066,0.001859942,0.00016144008,0.00020379026,0.000009160379,1.6355753e-7,0.0000033793874,0.002682785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992222,0.0000028569495,0.00019832024,0.00017633373,0.00029343856,0.000106821666],"domain_scores_gemma":[0.9989501,0.000019043047,0.00018216787,0.00012525923,0.0006914052,0.00003202124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024204268,0.00007339052,0.00008227866,0.00005102532,0.00006405169,0.00018211534,0.0019537583,0.00004523121,0.000101656464],"category_scores_gemma":[0.00009844478,0.000050218558,0.00006688383,0.0001257023,0.00005474088,0.00042287793,0.00031990465,0.00021001438,0.000017468585],"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.0000027252058,0.00001428626,0.0026365768,0.000004868224,0.000011403169,8.417567e-8,0.00020772564,0.0000030320996,0.04026818,0.9531149,0.0021751376,0.0015610374],"study_design_scores_gemma":[0.0010008268,0.0001531762,0.01859619,0.000346917,0.00001611786,0.00031045897,0.0004180388,0.39729914,0.22822781,0.18380517,0.1690813,0.0007448584],"about_ca_topic_score_codex":0.00002430665,"about_ca_topic_score_gemma":0.000010972379,"teacher_disagreement_score":0.76930976,"about_ca_system_score_codex":0.000011394996,"about_ca_system_score_gemma":0.000031033294,"threshold_uncertainty_score":0.36306015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22207993,0.00003478969,0.77590483,0.00012164825,0.0011173239,0.00013810206,2.0954363e-7,0.000089004396,0.00051414006],"genre_scores_gemma":[0.9991956,0.000003333613,0.000225814,0.00008595335,0.000116955554,0.000008174009,0.0000015746537,0.000005938969,0.00035665373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991726,0.000109249304,0.00020427119,0.00025376028,0.000120021614,0.00014009692],"domain_scores_gemma":[0.9995115,0.00008953461,0.000060530067,0.0001796094,0.00011290331,0.000045943107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040946086,0.00008267419,0.00012123916,0.000083589635,0.00007127565,0.0001484061,0.00014666576,0.00006062303,0.0000024896235],"category_scores_gemma":[0.00008530347,0.00006994661,0.0000091894935,0.00028758022,0.000015817444,0.000096994496,0.000062476145,0.000065836815,0.000023285971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045132524,0.00006350668,0.0024174792,0.00003551645,0.000005648309,0.0000031168092,0.002082203,0.5232148,0.0006703976,0.46787986,0.00034056458,0.003282402],"study_design_scores_gemma":[0.0002694764,0.00005518217,0.0026900861,0.000050111707,7.4494324e-7,0.000025722069,0.000112030575,0.996383,0.00008329836,0.000029479817,0.00020687444,0.00009396456],"about_ca_topic_score_codex":0.00008592088,"about_ca_topic_score_gemma":0.000053260177,"teacher_disagreement_score":0.77711564,"about_ca_system_score_codex":0.000035875935,"about_ca_system_score_gemma":0.000009047789,"threshold_uncertainty_score":0.285234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105091006,0.000075361895,0.766263,0.0013390586,0.000668785,0.00009124152,3.724068e-8,0.00022028624,0.12625124],"genre_scores_gemma":[0.99391943,0.0000016347681,0.004258335,0.00079955504,0.00003855327,0.0000011949234,7.404994e-8,0.0000011792811,0.0009800212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994628,0.000027253263,0.00013723681,0.00015063611,0.0000742628,0.00014784683],"domain_scores_gemma":[0.9997376,0.000024385226,0.000022634575,0.00016838704,0.000018958117,0.000028010281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001972947,0.00004776714,0.00006838739,0.000077119796,0.000031664928,0.00008209314,0.00023670061,0.000025361069,0.000014269709],"category_scores_gemma":[0.0000095536525,0.00003991898,0.000027276428,0.00033234674,0.0000031875365,0.00022082777,0.000022361219,0.00006208852,0.000031729378],"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.0000017718763,0.000032519114,0.001530073,0.0000017114252,0.0000016251869,0.000019059757,0.00066538417,0.001183474,0.00043072287,0.9115366,0.0048796595,0.079717435],"study_design_scores_gemma":[0.00050062896,0.00019689708,0.017733525,0.00007179067,6.7957274e-7,0.00009089228,0.00016457042,0.93950397,0.0005032526,0.03314346,0.0077830083,0.00030731855],"about_ca_topic_score_codex":0.000040443945,"about_ca_topic_score_gemma":0.000034514323,"teacher_disagreement_score":0.9383205,"about_ca_system_score_codex":0.000013722295,"about_ca_system_score_gemma":0.0000071563186,"threshold_uncertainty_score":0.16278487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05156034,0.00002188098,0.9466566,0.00037859936,0.00062073994,0.00031485836,0.0000013115186,0.00007661105,0.00036909696],"genre_scores_gemma":[0.9109321,0.000006241694,0.08794358,0.00092215894,0.00007720442,0.0000690089,0.0000022735342,0.0000010411122,0.00004639414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892306,0.000037970287,0.0003964855,0.00021490589,0.00020515895,0.00022241879],"domain_scores_gemma":[0.9990832,0.00015803344,0.00015280662,0.00023059617,0.0003060329,0.00006932861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008766975,0.00009347036,0.00016285882,0.00019467331,0.0003568734,0.0010177206,0.000455681,0.00005481545,0.000012718434],"category_scores_gemma":[0.000039643022,0.00006859702,0.0000808564,0.0009658109,0.000102335645,0.0047444953,0.000084790496,0.000055082593,0.000029359371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028802197,0.000024357805,0.0064004273,0.00002421434,0.00004273053,8.5845684e-8,0.0025847706,0.8053033,0.00001341832,0.009120902,0.0038446852,0.17263824],"study_design_scores_gemma":[0.00013018264,0.000044511737,0.022550208,0.000005679515,0.000005466222,0.0000031233099,0.00007913462,0.97348255,0.000013550905,0.00019868897,0.0033871364,0.00009977979],"about_ca_topic_score_codex":0.00025187808,"about_ca_topic_score_gemma":0.000023943645,"teacher_disagreement_score":0.8593718,"about_ca_system_score_codex":0.000017988725,"about_ca_system_score_gemma":0.000020584754,"threshold_uncertainty_score":0.9813903},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046826355,0.000077224286,0.9466472,0.0007502865,0.0048606684,0.00051403674,0.000006033984,0.00018118923,0.0001369915],"genre_scores_gemma":[0.9441834,0.000010683629,0.05414355,0.001304578,0.00018354584,0.000110905225,5.9476866e-7,0.000021322077,0.00004141582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978619,0.00044209498,0.00040502046,0.00065534667,0.00018845119,0.00044715678],"domain_scores_gemma":[0.9971198,0.0019098624,0.00011363443,0.0005994369,0.00009388026,0.00016338675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011659977,0.00026745655,0.00045474642,0.0003160065,0.00020437424,0.00015564433,0.0006298142,0.00017075487,0.0000011803032],"category_scores_gemma":[0.000031522322,0.0002610488,0.00013647153,0.0004205991,0.00006311285,0.00027038326,0.0000102386875,0.00040984913,0.0000048529587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021135404,0.00012897883,0.000040088467,0.000016350074,0.00004459656,0.000011788359,0.0012457551,0.93943256,0.00004174477,0.005068638,0.0006679356,0.05309019],"study_design_scores_gemma":[0.0023739184,0.00066677615,0.00009328474,0.00015800809,0.000008983874,0.0000933011,0.0000946784,0.99411356,0.0002851459,0.0010228088,0.0007965842,0.000292956],"about_ca_topic_score_codex":0.00013976313,"about_ca_topic_score_gemma":0.0003946531,"teacher_disagreement_score":0.89735705,"about_ca_system_score_codex":0.00011778436,"about_ca_system_score_gemma":0.000048286987,"threshold_uncertainty_score":0.99998415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96226984,0.0006938395,0.035663933,0.00051488716,0.00016977853,0.00016743779,0.0000016972903,0.0000505861,0.0004679905],"genre_scores_gemma":[0.9949809,0.00007649072,0.004207615,0.00006423369,0.00002885651,0.0000052074447,2.3077806e-7,0.0000046891814,0.00063178275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924546,0.000051351235,0.00025143544,0.00013504065,0.00017640025,0.0001403122],"domain_scores_gemma":[0.9994201,0.000054422588,0.00010325777,0.00033576298,0.000054163673,0.000032297576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024269502,0.000093012866,0.00018644526,0.00001856795,0.00015189617,0.000044845627,0.00034583552,0.000041547355,0.0000063672455],"category_scores_gemma":[0.000032350374,0.00004779463,0.00005715143,0.000101417405,0.0001977622,0.00015964339,0.00013324824,0.000077039884,0.0000058858714],"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.00000922633,0.00012068515,0.0014211673,0.00024073657,0.00008220951,0.000016175365,0.03012715,0.000488734,0.0018914388,0.9630229,0.0024459157,0.00013368537],"study_design_scores_gemma":[0.00031554984,0.00028073092,0.000714951,0.00023524516,0.000017809552,0.00033720655,0.0037789294,0.91922826,0.0029082587,0.07075357,0.0010614393,0.0003680695],"about_ca_topic_score_codex":0.000015187654,"about_ca_topic_score_gemma":0.0000023106784,"teacher_disagreement_score":0.9187395,"about_ca_system_score_codex":0.000006231907,"about_ca_system_score_gemma":0.000012353566,"threshold_uncertainty_score":0.19490084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19514562,0.00009693728,0.8022128,0.001397615,0.00072357006,0.00015310558,3.0049574e-7,0.00010616963,0.00016390119],"genre_scores_gemma":[0.9025987,0.000009540032,0.09690431,0.000041180272,0.00038704058,0.0000062108475,8.102259e-8,0.0000054240377,0.00004753728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852455,0.000021014925,0.00045286593,0.0002936239,0.00037263284,0.00033531582],"domain_scores_gemma":[0.9983155,0.00006384813,0.00038425662,0.00029607984,0.00089089497,0.000049424725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047368,0.00013004827,0.0003289133,0.0006560467,0.00025964953,0.00025072607,0.0010753662,0.00009264827,4.2596986e-7],"category_scores_gemma":[0.000007962066,0.00008749694,0.000050356943,0.0010888244,0.00026927717,0.0005852782,0.00010898347,0.0001387773,0.0000029938258],"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.000109461886,0.0002215487,0.0005172918,0.000106431304,0.000084599305,0.0002836003,0.00040696055,0.027273364,0.0061447155,0.81279606,0.0140397195,0.13801624],"study_design_scores_gemma":[0.0011642728,0.0017731641,0.00023910274,0.00019851793,0.000011242375,0.005560486,0.00006552336,0.98499054,0.00061673706,0.0016675189,0.0034989,0.00021400221],"about_ca_topic_score_codex":0.000007989826,"about_ca_topic_score_gemma":0.000006103078,"teacher_disagreement_score":0.9577172,"about_ca_system_score_codex":0.00007251821,"about_ca_system_score_gemma":0.00020716163,"threshold_uncertainty_score":0.35680217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007152444,0.00016552296,0.99189323,0.000060432427,0.00016735644,0.0004824274,3.942763e-7,0.000025484795,0.000052733525],"genre_scores_gemma":[0.95199585,0.000012841272,0.04772059,0.000057311114,0.00006754534,0.00001485529,0.0000010281544,0.0000026771027,0.0001273047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941427,0.00004187269,0.00018660615,0.0001897643,0.00007248248,0.00009500643],"domain_scores_gemma":[0.99948686,0.0002094675,0.000086292974,0.00016175616,0.000023964009,0.000031636573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034404808,0.000066530985,0.00010568559,0.000029389208,0.000067061825,0.000049145063,0.00006445245,0.00004355238,7.760102e-7],"category_scores_gemma":[0.000009445043,0.000054427866,0.000016332699,0.00004163593,0.000010927807,0.00010507114,0.0000103384145,0.00002265138,0.0000010715364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014965254,0.000021463851,0.00009084384,0.000009678539,0.0000050225253,1.0938582e-7,0.00014354473,0.9508418,0.00022992767,0.036334243,0.0001477725,0.01216066],"study_design_scores_gemma":[0.00027809653,0.00026844596,0.001700488,0.000024180323,0.000002578645,0.000001623849,0.000014340316,0.9966059,0.00005685941,0.000343193,0.0006430281,0.00006127352],"about_ca_topic_score_codex":0.000006112021,"about_ca_topic_score_gemma":4.0006125e-7,"teacher_disagreement_score":0.9448434,"about_ca_system_score_codex":0.0000130844555,"about_ca_system_score_gemma":0.0000035521057,"threshold_uncertainty_score":0.2219504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11877528,0.0055572665,0.86924464,0.003347707,0.002827442,0.00016661215,1.3091045e-7,0.000023111861,0.00005781924],"genre_scores_gemma":[0.9882709,0.00009637447,0.005880574,0.00065719103,0.0050270497,0.0000015051528,3.5914525e-8,0.000008530492,0.000057876452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998888,0.00022624698,0.00037313506,0.00009081289,0.00018273349,0.00023904812],"domain_scores_gemma":[0.99846476,0.0009455571,0.00017212171,0.00021378319,0.00015953126,0.000044258035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038653081,0.00009753463,0.00019334226,0.000027887616,0.0005874953,0.00020274692,0.00069494004,0.00003312953,7.1950234e-7],"category_scores_gemma":[0.00007549494,0.0000432043,0.000085360596,0.00009774567,0.000057034325,0.00032127116,0.00014836759,0.00020063022,0.0000015511071],"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.000106495514,0.00006273109,0.0014194417,0.00009820733,0.00034248113,0.0000032767307,0.01710557,0.21666127,0.0017954255,0.073321,0.018719653,0.67036444],"study_design_scores_gemma":[0.00027870206,0.00020468619,0.0003685549,0.0001286632,0.000020866244,0.000522517,0.00038978606,0.98015535,0.00010658149,0.0023507045,0.015385276,0.00008831401],"about_ca_topic_score_codex":0.000023762952,"about_ca_topic_score_gemma":0.0000029472155,"teacher_disagreement_score":0.8694956,"about_ca_system_score_codex":0.00001639423,"about_ca_system_score_gemma":0.000021729853,"threshold_uncertainty_score":0.4518598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39873633,0.00002140904,0.59760433,0.00010730425,0.0014138429,0.0009201824,0.000001158996,0.0002134888,0.0009819552],"genre_scores_gemma":[0.9955783,9.159138e-7,0.003636198,0.000073189105,0.00014718679,0.00014474569,7.0787047e-7,0.000009624271,0.00040912462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989628,0.0000238423,0.00030846577,0.00024219342,0.00022955371,0.00023310524],"domain_scores_gemma":[0.9991048,0.00006596594,0.00010351737,0.0004198741,0.00022333434,0.00008250542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010489978,0.00012874787,0.00017626397,0.00006626749,0.000072899886,0.000104245715,0.00047326533,0.00008712892,0.000115729956],"category_scores_gemma":[0.000010564992,0.000098988596,0.00009350436,0.00014720057,0.000025737583,0.0003015845,0.00008155736,0.000088905756,0.00015349119],"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.00076002727,0.0027059386,0.09819162,0.0010103545,0.0007818651,0.0001582259,0.010536608,0.17910546,0.031896107,0.08750374,0.014514153,0.5728359],"study_design_scores_gemma":[0.00045659998,0.0010585055,0.000775301,0.00008160722,0.0000026252842,0.00001292812,0.00011030765,0.95528704,0.041336663,0.00016460409,0.0004946167,0.00021919228],"about_ca_topic_score_codex":0.0002980795,"about_ca_topic_score_gemma":0.000014421103,"teacher_disagreement_score":0.7761816,"about_ca_system_score_codex":0.000034543125,"about_ca_system_score_gemma":0.000040781306,"threshold_uncertainty_score":0.40366375},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121388115,0.00008428798,0.8738828,0.00008772932,0.002039665,0.00036939158,0.000052906358,0.00015626621,0.0019388406],"genre_scores_gemma":[0.9982453,0.0000079721585,0.00060909544,0.00008790057,0.000059749393,0.00007411757,0.000009871643,0.000020517924,0.00088548113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972737,0.00035773552,0.0007780234,0.000576566,0.0006996392,0.0003143757],"domain_scores_gemma":[0.9979535,0.00018955993,0.00034786874,0.00072486984,0.0005737687,0.00021046429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000712218,0.00031413653,0.0007470095,0.00081938464,0.00021320785,0.0002913184,0.00034637298,0.00018972594,0.00003070691],"category_scores_gemma":[0.000009471041,0.00023802574,0.00020851378,0.0015085492,0.00006967725,0.0005820605,0.0000036302547,0.00031995904,0.000038293747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062981,0.0015931195,0.0012143933,0.00008512605,0.0019860736,0.00001747182,0.019727051,0.95701164,0.00096355716,0.008054251,0.0054551587,0.0032623727],"study_design_scores_gemma":[0.0010901212,0.0011087568,0.00026343335,0.0003063107,0.0002534873,0.000036614118,0.006231069,0.9827221,0.0054594167,0.000012666355,0.0021180885,0.0003979341],"about_ca_topic_score_codex":0.00028840493,"about_ca_topic_score_gemma":0.0011582742,"teacher_disagreement_score":0.87685716,"about_ca_system_score_codex":0.00016033818,"about_ca_system_score_gemma":0.00008245995,"threshold_uncertainty_score":0.9706408},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05148584,0.00006290989,0.93512034,0.00025048232,0.010446948,0.00008629166,9.8449775e-8,0.000023995332,0.0025230714],"genre_scores_gemma":[0.9861191,0.00004063374,0.013457096,0.000089900415,0.0002575666,8.9119345e-7,2.6430715e-7,0.000006003168,0.000028549086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988607,0.00013655153,0.0004931575,0.00009732887,0.000289866,0.00012236295],"domain_scores_gemma":[0.9990552,0.00013220406,0.000386939,0.00013067691,0.00022647541,0.00006849746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045893775,0.00007765767,0.00018578646,0.0003098079,0.00008304159,0.0000507159,0.00030464403,0.000064492975,0.000006820141],"category_scores_gemma":[0.00019352442,0.000068268375,0.00007599059,0.00053326046,0.00001338544,0.0004978493,0.000026270074,0.00019769094,0.0000025725224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029055009,0.00010757407,0.00036304505,0.0000021372105,0.000008736005,0.000058773232,0.00036099183,0.8340936,0.000015542491,0.16289936,0.0012512074,0.00080999284],"study_design_scores_gemma":[0.0022187305,0.00062809815,0.00025344192,0.00013881076,0.0000031039103,0.00035588728,0.00001963631,0.97387975,0.00010395741,0.021834282,0.0004222223,0.00014207845],"about_ca_topic_score_codex":0.0000066351504,"about_ca_topic_score_gemma":2.6268907e-7,"teacher_disagreement_score":0.93463326,"about_ca_system_score_codex":0.00007831062,"about_ca_system_score_gemma":0.00008135652,"threshold_uncertainty_score":0.27839038},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082007265,0.000017349135,0.98667353,0.00044056657,0.0021076314,0.00019906575,6.9911965e-7,0.000096333315,0.0022641085],"genre_scores_gemma":[0.9671034,3.3282905e-7,0.031615194,0.0004869,0.00030672006,0.00003325296,0.0000058989917,0.0000067093692,0.00044155263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990734,0.00003488618,0.00023373791,0.0002462184,0.00010727009,0.00030447586],"domain_scores_gemma":[0.9993785,0.00015521454,0.00005041654,0.00022230121,0.0001383766,0.000055165936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000438457,0.00008378388,0.000101210986,0.00007038817,0.0001834408,0.00012257717,0.00023056827,0.0000648997,0.000031028467],"category_scores_gemma":[0.000034457276,0.00007434513,0.000049843435,0.0002499965,0.000022918442,0.00031963276,0.00009447535,0.00013703073,0.000013130273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044901108,0.00006193329,0.00010465088,0.000001974086,0.0000037692557,0.000001085516,0.000058568065,0.8335431,0.0005175443,0.16120432,0.003504322,0.0009941988],"study_design_scores_gemma":[0.00034073117,0.00003913289,0.000045936733,0.000010164222,0.0000016921913,0.000022401815,0.000011745698,0.99362427,0.000101514794,0.0005811979,0.0051185736,0.00010262024],"about_ca_topic_score_codex":0.00009009186,"about_ca_topic_score_gemma":0.0010794608,"teacher_disagreement_score":0.9589027,"about_ca_system_score_codex":0.00002599003,"about_ca_system_score_gemma":0.000024406578,"threshold_uncertainty_score":0.30317065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2321785,0.00063899887,0.765705,0.00005256944,0.0010453456,0.000102728525,9.759519e-8,0.00003095696,0.0002458335],"genre_scores_gemma":[0.9866389,0.000044136264,0.012814897,0.00008857394,0.00022921948,0.0000015525802,1.4432017e-7,0.0000137448005,0.00016885709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983213,0.00012986353,0.00065379177,0.00021017126,0.00026193695,0.00042292543],"domain_scores_gemma":[0.9978606,0.0006627518,0.00088992,0.00019697624,0.0003306212,0.000059139868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108033,0.00015129162,0.00033090977,0.00009344605,0.00032128918,0.00007254837,0.00023260262,0.00007866576,0.000003933896],"category_scores_gemma":[0.0005549443,0.00012868691,0.000079114914,0.00038046952,0.000047668396,0.0004899176,0.000044171244,0.00058971945,0.0000015252492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081000195,0.00008044549,0.0021429213,0.000016438651,0.000037537015,0.000021561216,0.0010832882,0.987774,0.0053669624,0.00056982064,0.0020163804,0.0008096059],"study_design_scores_gemma":[0.00060861674,0.0011423783,0.00130783,0.00063737866,0.000006395835,0.002449228,0.000038855906,0.99130505,0.0016876813,0.00033419085,0.00031884847,0.00016353348],"about_ca_topic_score_codex":0.000037868787,"about_ca_topic_score_gemma":0.000008645183,"teacher_disagreement_score":0.7544604,"about_ca_system_score_codex":0.00017498725,"about_ca_system_score_gemma":0.00017530199,"threshold_uncertainty_score":0.52476996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6078762,0.00006180698,0.3860312,0.00038923844,0.0052564763,0.00010026909,8.2220305e-7,0.000017430504,0.00026658602],"genre_scores_gemma":[0.9839533,0.00008184552,0.012677124,0.00035687725,0.0028407397,0.0000030098763,0.0000026179112,0.000015734404,0.00006873658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977153,0.00008586818,0.0010436708,0.00026392456,0.00058402517,0.00030719116],"domain_scores_gemma":[0.9978242,0.00045023556,0.0008550752,0.0001702323,0.0006359136,0.00006435426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106181,0.00020083052,0.00037451208,0.00029725835,0.00017139602,0.00023045356,0.00075680064,0.00008486543,0.0000030416597],"category_scores_gemma":[0.000021239042,0.0001689754,0.00015339801,0.00013532328,0.0000546176,0.00052875665,0.00022168549,0.00030572072,0.000001199569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006456924,0.0003501074,0.1024862,0.00027506106,0.00056413683,0.000032422402,0.000775194,0.55943155,0.00032861528,0.0117406845,0.008076813,0.31529355],"study_design_scores_gemma":[0.0015928604,0.0005746795,0.022635031,0.0013099929,0.000016115073,0.00038136405,0.000018232873,0.97088605,0.00034080338,0.00028169487,0.0017739945,0.00018915841],"about_ca_topic_score_codex":0.000015349242,"about_ca_topic_score_gemma":0.0000044714066,"teacher_disagreement_score":0.41145456,"about_ca_system_score_codex":0.00013065977,"about_ca_system_score_gemma":0.00005519196,"threshold_uncertainty_score":0.68906164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05643754,0.0001397016,0.9360683,0.00038089,0.006255041,0.000049777354,4.5605847e-7,0.00001462331,0.00065368187],"genre_scores_gemma":[0.96480644,0.000051975305,0.03471721,0.00012689726,0.00027576674,0.0000010645051,2.5747508e-7,0.0000035375676,0.000016844022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851966,0.00009443447,0.0005880714,0.00020278421,0.000444148,0.00015087453],"domain_scores_gemma":[0.99731076,0.00018672133,0.0005283384,0.00022484858,0.001659804,0.00008952381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015605912,0.000105706145,0.00017979192,0.00053908577,0.0001436814,0.00044754843,0.0012974489,0.000033588,0.000011352615],"category_scores_gemma":[0.000133867,0.00008312525,0.00009560046,0.00047952254,0.00024665147,0.0018169876,0.00016540519,0.00013491156,0.0000018319063],"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.000020775236,0.00019884134,0.0022655944,0.00000743978,0.00018215607,0.000011946577,0.002351158,0.046246488,0.0023238398,0.75160795,0.0005857408,0.19419804],"study_design_scores_gemma":[0.0007763456,0.00051444053,0.0037652806,0.00021878946,0.00000858898,0.0021906006,0.00020234573,0.95408344,0.006866826,0.021602752,0.009503144,0.00026743708],"about_ca_topic_score_codex":0.00000883515,"about_ca_topic_score_gemma":0.0000042968595,"teacher_disagreement_score":0.9083689,"about_ca_system_score_codex":0.000083209416,"about_ca_system_score_gemma":0.00019363669,"threshold_uncertainty_score":0.431572},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1735107,0.000008950297,0.82410014,0.000110884845,0.0005744306,0.00037382098,3.8986278e-7,0.000023851246,0.0012968186],"genre_scores_gemma":[0.8837615,6.305206e-7,0.11582622,0.00005807034,0.000052377374,0.000039230916,5.722086e-7,0.0000032869214,0.0002581081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.000044892164,0.00017866462,0.00017444187,0.00016039632,0.000108638116],"domain_scores_gemma":[0.99928015,0.00016593047,0.00007447658,0.00021811674,0.00022931422,0.000032023603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015324833,0.00005908412,0.00009880157,0.00004160524,0.000042535143,0.00009003577,0.00015166034,0.000053540098,0.000044564185],"category_scores_gemma":[0.00003905149,0.000045962206,0.000030935462,0.000061781015,0.000013959634,0.0002607205,0.00002629001,0.000049403705,0.0000037785553],"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.000095535026,0.00028232048,0.0007566337,0.00013158302,0.00014046833,0.0000016086223,0.0024763048,0.018265102,0.1940256,0.2144286,0.01193166,0.5574646],"study_design_scores_gemma":[0.0003466562,0.00009405394,0.0005799943,0.000009949701,0.000007566857,0.000014688761,0.000010168447,0.9858967,0.008617448,0.0034451222,0.0009078018,0.00006985291],"about_ca_topic_score_codex":0.00003786453,"about_ca_topic_score_gemma":0.00003039501,"teacher_disagreement_score":0.9676316,"about_ca_system_score_codex":0.0000069807693,"about_ca_system_score_gemma":0.00004880754,"threshold_uncertainty_score":0.18742844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047260015,0.000036527825,0.94353974,0.000109625784,0.000061190134,0.00019886835,3.5723025e-7,0.00010807849,0.05121964],"genre_scores_gemma":[0.70948446,0.000003689801,0.2902048,0.00013079135,0.00007990482,0.000009347101,9.0116305e-7,0.0000075239473,0.00007859762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989937,0.000010470093,0.00032981264,0.0001964126,0.00022340841,0.00024622606],"domain_scores_gemma":[0.9991624,0.000069623835,0.00021546878,0.0004597417,0.000041437135,0.000051333613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024094655,0.00013694738,0.00027973822,0.000032226613,0.00007805109,0.00007381788,0.00042125388,0.000049013317,0.0000068427967],"category_scores_gemma":[0.0000044390526,0.0000983093,0.00005239173,0.00025800374,0.000026811862,0.00010401218,0.000049135433,0.00008936079,0.0000133908225],"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.000009665377,0.00003318774,0.000009909572,0.000031601787,0.000020997048,0.0000023941645,0.001501104,0.008164874,0.0001812424,0.9865325,0.000886928,0.0026255874],"study_design_scores_gemma":[0.0015166921,0.0007810554,0.0005564193,0.00071855687,0.000057760288,0.0001130205,0.0016379294,0.63030505,0.0014387416,0.35927287,0.0026314845,0.0009704034],"about_ca_topic_score_codex":0.0000022820832,"about_ca_topic_score_gemma":0.0000035752664,"teacher_disagreement_score":0.70475847,"about_ca_system_score_codex":0.00001116876,"about_ca_system_score_gemma":0.000016717528,"threshold_uncertainty_score":0.40089366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010070831,0.000023315375,0.9927475,0.00063498406,0.0017241861,0.00039855277,4.2086356e-7,0.00014016483,0.0042302003],"genre_scores_gemma":[0.5200674,1.00631674e-7,0.4775141,0.001301872,0.0004204992,0.00001152601,0.0000012320561,0.0000052751316,0.0006780168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986064,0.00044217997,0.00025732757,0.00023787681,0.00011877494,0.0003374543],"domain_scores_gemma":[0.9977894,0.0016470851,0.00011023476,0.00025464577,0.000088299195,0.00011033856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018819553,0.000117201365,0.00018714217,0.0001028022,0.00013259977,0.00009554663,0.00025969007,0.00006452265,0.000034823504],"category_scores_gemma":[0.0001365794,0.00009521128,0.00007886765,0.00018465778,0.000009080168,0.00022618256,0.00002653007,0.00007255533,0.000048097554],"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.00007803719,0.00010752859,0.00010920784,0.000020817457,0.00003775109,0.0000012423076,0.0015037133,0.08455322,0.001963902,0.71381426,0.03326134,0.16454901],"study_design_scores_gemma":[0.000637155,0.00019307798,0.0001563273,0.000016425009,0.0000044376475,0.000013759189,0.000041220854,0.9911095,0.0045929295,0.00087089837,0.0022301928,0.00013409117],"about_ca_topic_score_codex":0.00010692227,"about_ca_topic_score_gemma":0.000009179867,"teacher_disagreement_score":0.90655625,"about_ca_system_score_codex":0.000044588833,"about_ca_system_score_gemma":0.00006890194,"threshold_uncertainty_score":0.38826036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011467615,0.00034671105,0.91177285,0.002491754,0.00077763107,0.0006846744,0.000018803437,0.00017596192,0.07226398],"genre_scores_gemma":[0.976462,0.00001532799,0.017617723,0.0001128313,0.0004899187,0.00007297152,0.000012751135,0.000020458334,0.00519603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805397,0.00021207146,0.0004050802,0.0003197375,0.0005926526,0.00041647517],"domain_scores_gemma":[0.99809855,0.0003409711,0.0001272602,0.00093442283,0.0004415187,0.00005729097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012089389,0.00014824381,0.00020281631,0.00005063817,0.0003345239,0.0007076703,0.0012765785,0.000081525264,0.000082325416],"category_scores_gemma":[0.00007666941,0.00009157105,0.000059880822,0.00068515673,0.000104301944,0.00022373641,0.00027022196,0.0003070134,0.0003319123],"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.0000016040125,0.00005717829,0.00015415164,0.000029427194,0.000019681387,0.0000064052388,0.0031876964,0.00031162964,0.00021343482,0.94803256,0.047157925,0.0008283262],"study_design_scores_gemma":[0.00036706362,0.00008388327,0.00035761142,0.0004301572,0.00001016052,0.000026062215,0.0015410256,0.70819557,0.00045631797,0.23128176,0.056896213,0.0003541663],"about_ca_topic_score_codex":0.0008502133,"about_ca_topic_score_gemma":0.00045896237,"teacher_disagreement_score":0.9649944,"about_ca_system_score_codex":0.000041869393,"about_ca_system_score_gemma":0.00007632867,"threshold_uncertainty_score":0.6824081},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93082005,0.00013580348,0.06400832,0.0011894964,0.0013379122,0.00008727647,2.7464841e-7,0.000010606876,0.0024102377],"genre_scores_gemma":[0.99902457,0.0000075729226,0.00043309244,0.00033085878,0.00012208187,1.3441591e-7,1.5835175e-8,0.000005317218,0.00007634159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854803,0.00044747788,0.00044621658,0.00007148191,0.00032457613,0.00016219002],"domain_scores_gemma":[0.99843764,0.00062095595,0.00031060792,0.00041442586,0.000188541,0.00002784215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023713491,0.00009305331,0.00016004378,0.000029177578,0.00027261188,0.000040755076,0.001565978,0.000029137358,0.00002692636],"category_scores_gemma":[0.00007146659,0.000035141875,0.00014863649,0.00024932093,0.00006803198,0.00014315608,0.00020380782,0.00031712218,0.000005163783],"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.00037868146,0.0009255902,0.020923248,0.00009788052,0.0012146988,0.000049825823,0.21033655,0.22847477,0.03228618,0.42440417,0.05770036,0.023208061],"study_design_scores_gemma":[0.001042557,0.0009805931,0.017122494,0.0017916396,0.00009066124,0.0014793384,0.008910666,0.9143553,0.039543204,0.012846184,0.001426015,0.00041136626],"about_ca_topic_score_codex":0.0000777484,"about_ca_topic_score_gemma":0.0000069087355,"teacher_disagreement_score":0.68588054,"about_ca_system_score_codex":0.000025619376,"about_ca_system_score_gemma":0.00003455207,"threshold_uncertainty_score":0.2910003},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79459697,0.011551432,0.13687079,0.011770952,0.0008609541,0.00030294585,0.0000040372593,0.0027492184,0.041292727],"genre_scores_gemma":[0.9939638,0.00003075198,0.0030062133,0.00011828543,0.000057362227,0.000020367488,2.6513916e-7,0.000010892722,0.0027920757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989574,0.000032882228,0.00029602923,0.00034366062,0.00011498578,0.00025503995],"domain_scores_gemma":[0.99933136,0.000031399537,0.00012065168,0.00042526217,0.000052261174,0.00003907533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013247773,0.00013000729,0.00024062107,0.00023961048,0.00008383843,0.000033797973,0.00047548817,0.00024038005,0.00004345304],"category_scores_gemma":[0.000052874748,0.00010357062,0.000044009317,0.0003919993,0.00013794219,0.000082352286,0.00034193028,0.00012433705,0.00001053404],"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.000018322975,0.00013306926,0.00059806596,0.00008676877,0.00010723044,0.000031034622,0.0015309916,0.000081485494,0.13383247,0.5632058,0.0075987466,0.29277605],"study_design_scores_gemma":[0.00091800094,0.00064490724,0.00007005371,0.00047619408,0.000020461506,0.0005432608,0.00066028454,0.24709089,0.14396296,0.0020487122,0.6028094,0.00075482123],"about_ca_topic_score_codex":0.0000405233,"about_ca_topic_score_gemma":0.000012912283,"teacher_disagreement_score":0.5952107,"about_ca_system_score_codex":0.000018385888,"about_ca_system_score_gemma":0.000005440072,"threshold_uncertainty_score":0.42234874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08194342,0.000048040038,0.9168921,0.000047115464,0.000570693,0.00014215338,0.000065421795,0.000064901644,0.00022615609],"genre_scores_gemma":[0.99956286,0.000015488831,0.00022470647,0.000030635987,0.0000290769,0.0000407702,0.000017282235,0.0000058936275,0.0000732702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984241,0.00026657587,0.0005047027,0.00037177844,0.00020982926,0.00022299902],"domain_scores_gemma":[0.99903524,0.00012238145,0.00012729253,0.0005069122,0.00008849158,0.000119665165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046351616,0.00015411871,0.00046457478,0.00039762282,0.00011155799,0.0001116081,0.00029521566,0.00011672663,0.000007428206],"category_scores_gemma":[0.0000032557798,0.00013532578,0.00013082118,0.0010342774,0.000038219176,0.00025736887,0.0000015558367,0.000128586,0.0000057332113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019455681,0.00014602237,0.00078643515,0.000020467261,0.00013043304,0.0000021965423,0.00023060926,0.9925844,0.00016631917,0.004709496,0.000045239496,0.001158925],"study_design_scores_gemma":[0.00041952782,0.0001735041,0.0030694332,0.000034467463,0.000067460496,0.000011279709,0.00019105451,0.9953744,0.00004309803,0.000041239357,0.00042181753,0.00015274066],"about_ca_topic_score_codex":0.0007939708,"about_ca_topic_score_gemma":0.00041848898,"teacher_disagreement_score":0.91761947,"about_ca_system_score_codex":0.00004059597,"about_ca_system_score_gemma":0.000016934766,"threshold_uncertainty_score":0.5518425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17400773,0.0005684719,0.76261014,0.002078416,0.0017392421,0.00030716517,3.9965857e-7,0.00017249589,0.05851596],"genre_scores_gemma":[0.9971072,0.0000035706364,0.0017485813,0.000040280567,0.000103866856,0.000010716428,1.3042113e-7,0.0000015554191,0.000984066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992294,0.00007391854,0.00027866464,0.00014383762,0.00009169814,0.00018250143],"domain_scores_gemma":[0.9992961,0.000280486,0.00006601513,0.00029112742,0.000056677243,0.000009561977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005798131,0.00005369384,0.000102360325,0.000015035422,0.00008032096,0.000054947777,0.0004188489,0.000035701345,0.0000054924567],"category_scores_gemma":[0.000032927124,0.000030723495,0.0000377746,0.00024116992,0.00005141829,0.000117445525,0.000088878944,0.000058768506,0.000004055789],"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.000008467929,0.00004150796,0.042122178,0.000008872611,0.0000038722246,0.0000012619942,0.0001596766,0.048046336,0.000028241184,0.89915633,0.0037395693,0.006683708],"study_design_scores_gemma":[0.00051723456,0.000113584836,0.09666122,0.000041196214,0.0000017230461,0.00001044408,0.00046598533,0.76657176,0.0013791805,0.11107001,0.022918036,0.00024963304],"about_ca_topic_score_codex":0.0012156711,"about_ca_topic_score_gemma":0.0041283066,"teacher_disagreement_score":0.8230995,"about_ca_system_score_codex":0.000018677893,"about_ca_system_score_gemma":0.000015411648,"threshold_uncertainty_score":0.2303692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030168798,0.000003297498,0.96871024,0.00096346624,0.001000286,0.00018069842,1.6187617e-7,0.00022403989,0.025900908],"genre_scores_gemma":[0.974668,5.4745666e-8,0.020825908,0.003471914,0.0006039521,0.00001985123,0.000001810025,0.000008809255,0.0003996673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889004,0.0001087419,0.00021440689,0.00034882364,0.00017194344,0.00026606282],"domain_scores_gemma":[0.99903524,0.0003156989,0.000054720444,0.0004466394,0.000045809473,0.000101910846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058049307,0.00012045946,0.00013816166,0.000073412906,0.0001524075,0.00028449585,0.00038718755,0.00005798647,0.000048476235],"category_scores_gemma":[0.000032530537,0.0000964665,0.000057679834,0.0003239381,0.000006802148,0.00013862643,0.0000575687,0.0000790788,0.0002203937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005332224,0.000012763199,0.00013386013,0.0000026280968,0.0000032181956,1.3763162e-7,0.000047013356,0.8735745,0.000002983875,0.10454222,0.0012239575,0.020451408],"study_design_scores_gemma":[0.00014002874,0.00012288743,0.00078870635,0.000011146154,9.646935e-7,4.1526113e-7,0.0000029891876,0.9776402,0.00008474693,0.001356796,0.01971497,0.00013613961],"about_ca_topic_score_codex":0.000012326251,"about_ca_topic_score_gemma":0.000019314044,"teacher_disagreement_score":0.97165114,"about_ca_system_score_codex":0.000026158901,"about_ca_system_score_gemma":0.000013805908,"threshold_uncertainty_score":0.39337897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002616789,0.000009378076,0.97549385,0.0002535271,0.00020535315,0.0005027891,0.00000154159,0.00021466783,0.020702094],"genre_scores_gemma":[0.72731566,0.0000028534844,0.27146655,0.00023642193,0.00025648874,0.00013480852,0.0000013190787,0.000015147478,0.00057072885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986921,0.00003977209,0.00030533102,0.00032968787,0.00028132022,0.0003518076],"domain_scores_gemma":[0.99890226,0.00017464136,0.00010265163,0.0006346286,0.000056293928,0.00012952727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038029917,0.00017894416,0.00025951042,0.000043300603,0.00015715408,0.00015407232,0.00050933135,0.000056117635,0.000019305879],"category_scores_gemma":[0.000021631382,0.00015196949,0.00007036664,0.00038063966,0.000024936855,0.00013669296,0.000108658074,0.000117647374,0.0006949909],"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.0000042220936,0.0001170289,0.0000013309051,0.000051981602,0.000034876095,0.0000019863844,0.019029686,0.046307575,0.0015211676,0.8969357,0.028107565,0.0078868605],"study_design_scores_gemma":[0.00013877903,0.00006782607,0.0000064615347,0.000038421655,0.000008237952,0.000007804981,0.00013765221,0.94538087,0.0008085574,0.0508917,0.0022540416,0.00025965777],"about_ca_topic_score_codex":0.00000719075,"about_ca_topic_score_gemma":0.0000041523003,"teacher_disagreement_score":0.8990733,"about_ca_system_score_codex":0.000047615507,"about_ca_system_score_gemma":0.0000056503586,"threshold_uncertainty_score":0.89329344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014907349,0.0013454388,0.90252507,0.0016826416,0.08963841,0.00074081065,5.145142e-7,0.00008671107,0.0024896667],"genre_scores_gemma":[0.68348384,0.000006559142,0.0015237216,0.000049550395,0.31460774,0.000026051997,1.6791938e-7,0.000015311269,0.000287073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970566,0.00036088147,0.0011676159,0.00033218818,0.00074280845,0.00033991717],"domain_scores_gemma":[0.9978822,0.00012044588,0.00085007964,0.00020702364,0.00076042337,0.00017981953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018197909,0.00021468049,0.0005064123,0.00053323567,0.00015257229,0.00082035846,0.0006631155,0.000115279996,0.000017895085],"category_scores_gemma":[0.000053043565,0.00016389426,0.00008238002,0.0006646157,0.00002064894,0.0022132557,0.000038848906,0.00034539215,0.00018963596],"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.00018145553,0.00021984104,0.00017192384,0.0008212767,0.00004092215,0.000117387404,0.0029466865,0.25202435,0.0023157133,0.0021558534,0.65828764,0.08071692],"study_design_scores_gemma":[0.0011834324,0.002567961,0.00013328333,0.006803359,0.000018073657,0.0018352562,0.0037462984,0.26227427,0.0017479406,0.00018040082,0.7187652,0.00074453885],"about_ca_topic_score_codex":0.000037447157,"about_ca_topic_score_gemma":0.000002398436,"teacher_disagreement_score":0.90100133,"about_ca_system_score_codex":0.00040234238,"about_ca_system_score_gemma":0.00012317003,"threshold_uncertainty_score":0.7910735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014051367,0.000013728219,0.9963369,0.00030361628,0.0004492626,0.00069393776,0.000004366602,0.000114062146,0.0006789842],"genre_scores_gemma":[0.91329706,0.000002067558,0.08512467,0.00053637,0.00013278364,0.0004984678,0.000014434165,0.000007714983,0.00038644962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931604,0.000032099433,0.00020485962,0.00014007675,0.00009373996,0.00021320446],"domain_scores_gemma":[0.99929947,0.00008838343,0.00008870759,0.00039039162,0.00008052581,0.000052552197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066036,0.00008656316,0.00008547825,0.00007085351,0.00016533441,0.000057673846,0.00032654646,0.000053746837,0.000012889712],"category_scores_gemma":[0.000012065323,0.000073044124,0.000054332355,0.0001121129,0.000010027852,0.00039307968,0.0000811371,0.00006642938,0.000019625386],"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.000011054973,0.000245932,0.00018186415,0.000009005738,0.000019125877,4.587317e-8,0.0024182233,0.00013213363,0.010445464,0.97236145,0.0059997546,0.008175936],"study_design_scores_gemma":[0.003375311,0.0009915009,0.0034032124,0.000116413554,0.0000138310725,0.00007342081,0.0028792096,0.8873075,0.074641086,0.0018707716,0.024506072,0.0008216521],"about_ca_topic_score_codex":0.000105790736,"about_ca_topic_score_gemma":0.000087540044,"teacher_disagreement_score":0.9704907,"about_ca_system_score_codex":0.000048118694,"about_ca_system_score_gemma":0.000012029397,"threshold_uncertainty_score":0.2978653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13330865,0.00007149108,0.8608753,0.00090573047,0.0009548264,0.0009367156,0.00000387227,0.00084033055,0.0021030596],"genre_scores_gemma":[0.9846832,0.0000034812956,0.013431872,0.0012620757,0.00049166905,0.00006722518,0.000006660505,0.000018287836,0.000035490324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983956,0.00007275593,0.00042017855,0.00046748476,0.00024573665,0.00039820682],"domain_scores_gemma":[0.9990851,0.00011471187,0.0001389165,0.00046346264,0.00011445546,0.00008330002],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021813199,0.00025478497,0.00030212486,0.0001718752,0.00011122262,0.0012985449,0.0006012197,0.00016873375,0.0000029799583],"category_scores_gemma":[0.000010351638,0.00021976662,0.00011686883,0.00044261245,0.000035429504,0.0013781809,0.00011390197,0.0002860921,0.00003052803],"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.00014190639,0.0011043379,0.030545983,0.00013104586,0.000292152,0.0002209592,0.002257991,0.04582201,0.014649663,0.14210382,0.3469634,0.41576672],"study_design_scores_gemma":[0.00064231234,0.000740941,0.0035053047,0.0009145593,0.000005188032,0.00014589477,0.000025448833,0.95157987,0.0014457139,0.032364942,0.007714585,0.0009152569],"about_ca_topic_score_codex":0.00012587305,"about_ca_topic_score_gemma":0.00004423813,"teacher_disagreement_score":0.90575784,"about_ca_system_score_codex":0.00011080159,"about_ca_system_score_gemma":0.000027564787,"threshold_uncertainty_score":0.9997382},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021666156,0.00010022956,0.9724277,0.0016665603,0.0014200561,0.00030807004,2.904544e-7,0.0003451688,0.0020657268],"genre_scores_gemma":[0.95474374,0.0000013168113,0.03942327,0.0048520206,0.0007699745,0.000043108666,0.000004115451,0.000027521786,0.00013491961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806803,0.00004865195,0.00047055737,0.00056109746,0.00021857648,0.00063309976],"domain_scores_gemma":[0.99887496,0.00031567874,0.00026263515,0.0003109958,0.0001231945,0.00011252634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010598038,0.00023896222,0.0002340451,0.00019787693,0.00043299905,0.00044288984,0.0005090905,0.0001171559,0.000006758544],"category_scores_gemma":[0.00008868874,0.00022358145,0.00012949601,0.0004076752,0.00003454524,0.00051993836,0.00006666643,0.00028169557,0.000014552647],"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.00086626766,0.0003877451,0.001070496,0.00044231585,0.00020874792,0.00008913003,0.0048365192,0.2954029,0.012398119,0.1519223,0.026289757,0.5060857],"study_design_scores_gemma":[0.00087927724,0.00017007247,0.00029792488,0.00027751006,0.000006776704,0.000054822285,0.000107157044,0.994694,0.00022868696,0.0007918069,0.0021112347,0.0003807187],"about_ca_topic_score_codex":0.000021355085,"about_ca_topic_score_gemma":0.000016333715,"teacher_disagreement_score":0.9330776,"about_ca_system_score_codex":0.000117563424,"about_ca_system_score_gemma":0.000025486528,"threshold_uncertainty_score":0.91173863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6247039,0.00006063456,0.36492723,0.0034009775,0.005139065,0.00007603072,8.730935e-8,0.000027357451,0.0016647205],"genre_scores_gemma":[0.9894088,0.00000534737,0.005220638,0.0012327717,0.004097503,4.2523865e-7,4.4672824e-8,0.000009029388,0.000025466583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998482,0.00030384574,0.00047448432,0.00010030694,0.00035733893,0.0002820331],"domain_scores_gemma":[0.99766815,0.0014489698,0.0003097904,0.00038112307,0.00013729237,0.000054682234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050720274,0.00011355457,0.00016354275,0.00004400009,0.00054415665,0.0002282242,0.0015359124,0.000044633623,0.000014047351],"category_scores_gemma":[0.00012600138,0.000053257845,0.0001287025,0.00024067407,0.000040132123,0.0002358253,0.00019341367,0.0009872145,0.000017910561],"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.00008064714,0.00015661637,0.0029473423,0.000021716462,0.00023631664,0.00011056736,0.02128683,0.2003109,0.021962631,0.5639356,0.025156694,0.16379416],"study_design_scores_gemma":[0.00034682313,0.00029193566,0.0014502329,0.00030020447,0.00001574087,0.0018431209,0.00038128239,0.9783885,0.0004622311,0.005729654,0.010589817,0.00020048073],"about_ca_topic_score_codex":0.00003722649,"about_ca_topic_score_gemma":0.000028222948,"teacher_disagreement_score":0.77807754,"about_ca_system_score_codex":0.000020895977,"about_ca_system_score_gemma":0.000024078612,"threshold_uncertainty_score":0.42890105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03934047,0.000043165062,0.9495192,0.00031455152,0.002107925,0.00013852167,4.2782096e-7,0.00027836728,0.008257363],"genre_scores_gemma":[0.8328283,5.843762e-7,0.16620207,0.000429752,0.000509207,0.000003066876,2.5939957e-7,0.0000062986624,0.000020516514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976408,0.00013901228,0.0002652609,0.00047888572,0.0006251077,0.00085093826],"domain_scores_gemma":[0.99850124,0.00017348389,0.00008233516,0.0006794509,0.00020703897,0.00035642376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021559559,0.00018343395,0.00022485592,0.00012815972,0.0006318884,0.00052362465,0.001524851,0.000047166723,0.00003202104],"category_scores_gemma":[0.000034688113,0.0001278208,0.000046044195,0.0012409716,0.0014961652,0.001325051,0.00067701837,0.00020848023,0.00007309689],"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.0000061865385,0.000043760756,0.0009765665,0.000005350221,0.000003856386,0.0000024291887,0.0007540183,0.00011944955,0.000057782672,0.9892471,0.0001045199,0.008679009],"study_design_scores_gemma":[0.00044477973,0.00043994465,0.005015957,0.000087813685,0.000006542292,0.00044112152,0.000054585747,0.9647613,0.00193462,0.023724534,0.0025288775,0.0005599248],"about_ca_topic_score_codex":0.000009891728,"about_ca_topic_score_gemma":9.871058e-7,"teacher_disagreement_score":0.9655225,"about_ca_system_score_codex":0.000066694556,"about_ca_system_score_gemma":0.00008446854,"threshold_uncertainty_score":0.5512683},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74311477,0.000447392,0.24806255,0.0029958142,0.0020717534,0.00043349576,0.0000027450203,0.000017811075,0.0028536664],"genre_scores_gemma":[0.9985993,0.000013887316,0.0008055232,0.00010240242,0.00037372054,0.000020109032,0.0000029759915,0.000006876742,0.00007523679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964795,0.00092582934,0.0008851471,0.0001265906,0.0014675284,0.00011537353],"domain_scores_gemma":[0.9955978,0.00016661835,0.0007704057,0.00090198225,0.0025180152,0.000045222147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038496521,0.000101232545,0.0001885766,0.0001447042,0.00013837384,0.0002642898,0.0033215506,0.00005413004,0.0000031936645],"category_scores_gemma":[0.000056103043,0.000058603488,0.00012391817,0.00033885296,0.00005205596,0.00046885145,0.00013461038,0.00022068465,0.000005736017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015393938,0.00014380612,0.0007127379,0.0000020222458,0.000057766367,1.0811347e-7,0.00058109435,0.96499693,0.00017118236,0.029473193,0.00077231386,0.0030734474],"study_design_scores_gemma":[0.00043530308,0.00004346792,0.020431751,0.00011750292,0.000018606208,0.0001151649,0.00042831918,0.97586703,0.00009733135,0.00006644447,0.002311439,0.000067632966],"about_ca_topic_score_codex":0.00008184608,"about_ca_topic_score_gemma":0.000029697276,"teacher_disagreement_score":0.2554845,"about_ca_system_score_codex":0.0001962753,"about_ca_system_score_gemma":0.00013119387,"threshold_uncertainty_score":0.61723226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012488172,0.0000019543268,0.75914365,0.0005519576,0.0023317456,0.000021761078,2.6757242e-8,0.00013390875,0.2253268],"genre_scores_gemma":[0.9818315,1.7295619e-7,0.010835482,0.0003758181,0.00015258897,0.0000018865362,4.190984e-8,0.000001178474,0.006801322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997453,0.000005667975,0.000051975006,0.00008225847,0.000047080553,0.00006771887],"domain_scores_gemma":[0.9997192,0.000013492372,0.000009694794,0.00021008047,0.000021278276,0.000026233796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009204397,0.00002405437,0.000028335546,0.000016375427,0.00003094603,0.000072265546,0.00023638183,0.000021421569,0.00016206056],"category_scores_gemma":[0.0000050614017,0.000017535373,0.000018060035,0.000060604423,0.0000048502557,0.00012421148,0.00003510689,0.000062606276,0.0002642957],"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":[9.980333e-8,0.000004402733,0.00014735275,3.7132276e-7,0.0000011020953,9.653785e-7,0.000053253316,0.0000052792793,0.0016430677,0.9748839,0.013292753,0.0099674165],"study_design_scores_gemma":[0.00013805706,0.00003331475,0.0012121288,0.0000025797096,4.7410998e-7,0.00008463862,0.000017568651,0.42795357,0.003919719,0.009070288,0.55741787,0.00014980244],"about_ca_topic_score_codex":0.000021035286,"about_ca_topic_score_gemma":0.000050911825,"teacher_disagreement_score":0.96934336,"about_ca_system_score_codex":0.0000014640507,"about_ca_system_score_gemma":0.0000054080774,"threshold_uncertainty_score":0.33970746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.650614,0.000915606,0.34334454,0.001285247,0.0026670087,0.00049671653,0.000004795456,0.000043760665,0.0006283159],"genre_scores_gemma":[0.9946325,0.0000126883015,0.004073011,0.00015123791,0.0009569188,0.000026641968,8.964637e-7,0.000027427352,0.00011870474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958465,0.0006291314,0.0018391102,0.00039805874,0.00075659924,0.00053058134],"domain_scores_gemma":[0.99706554,0.00042616707,0.001064658,0.0007379522,0.00047887623,0.00022681567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012792178,0.00034593075,0.0009179104,0.0010642898,0.000094961164,0.000315541,0.0016123422,0.00024546,0.000021346792],"category_scores_gemma":[0.00023405622,0.00024590662,0.00038256694,0.0006461089,0.00007676293,0.00039323352,0.00028593434,0.0011924137,0.000008975865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078755163,0.001276437,0.017521191,0.0019433136,0.0010599117,0.00079016,0.050604805,0.716323,0.04053848,0.020797264,0.011975675,0.13638216],"study_design_scores_gemma":[0.020359335,0.007325164,0.041198563,0.018241938,0.00013766876,0.051031616,0.00495426,0.75436974,0.0075568417,0.05574829,0.03524503,0.003831568],"about_ca_topic_score_codex":0.0007743247,"about_ca_topic_score_gemma":0.0002689902,"teacher_disagreement_score":0.34401846,"about_ca_system_score_codex":0.00014086533,"about_ca_system_score_gemma":0.00011481856,"threshold_uncertainty_score":0.99999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008593903,0.00006817611,0.98547006,0.0016459427,0.0020388125,0.0014558419,0.000019105375,0.00025073474,0.00045741381],"genre_scores_gemma":[0.96281856,0.0000056043777,0.034812424,0.00075388,0.0003640195,0.00011687903,0.000023485884,0.000027565451,0.0010775811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981097,0.00013111925,0.00046467935,0.0005773263,0.00020968374,0.00050748826],"domain_scores_gemma":[0.99854875,0.00046708,0.00016497957,0.0003762915,0.00028231207,0.00016061215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090706884,0.00023558957,0.00045231206,0.0000944137,0.0002885274,0.00032385922,0.00034322022,0.00011789577,0.0000060775055],"category_scores_gemma":[0.00004903249,0.00019795423,0.00019087097,0.00010684531,0.000017293452,0.00018852041,0.000041774707,0.00006959968,0.000009478119],"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.00035452744,0.00019920505,0.000021410111,0.0011278348,0.00020073626,0.0000043672057,0.0014202935,0.0459179,0.004969639,0.88890964,0.03828758,0.01858684],"study_design_scores_gemma":[0.0021715676,0.00039961713,0.00002007589,0.00017835503,0.000017893875,0.000020117854,0.000050248214,0.96877134,0.0018207196,0.0006515198,0.025621785,0.0002767539],"about_ca_topic_score_codex":0.00008061533,"about_ca_topic_score_gemma":0.000024307674,"teacher_disagreement_score":0.95422465,"about_ca_system_score_codex":0.00008631347,"about_ca_system_score_gemma":0.000039938706,"threshold_uncertainty_score":0.8072339},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016640726,0.0019065043,0.96646416,0.0041358266,0.0004997556,0.0012765412,0.0000049506302,0.00047315698,0.008598396],"genre_scores_gemma":[0.95693046,0.00026330355,0.04152774,0.00046194252,0.0002083124,0.00032128158,0.000016209102,0.000023678662,0.00024707228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974572,0.00065086415,0.00074658706,0.00039129035,0.00029990062,0.00045415096],"domain_scores_gemma":[0.9947178,0.000667457,0.00057595444,0.0034263947,0.0005015041,0.00011088832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012353023,0.00022838946,0.00040183694,0.00007627964,0.00059966475,0.00013411015,0.0022310338,0.00013739553,0.000026866235],"category_scores_gemma":[0.000045496905,0.00020563103,0.00011009266,0.0012915254,0.00010886428,0.00058455736,0.000544896,0.00048985385,0.00002726374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010886853,0.0006344982,0.005097426,0.000083697785,0.00026432163,7.642979e-7,0.0011671485,0.853803,0.0004712715,0.11620766,0.004185439,0.017975906],"study_design_scores_gemma":[0.0005091622,0.00008872349,0.0018277979,0.00014485882,0.000015105008,0.000013523801,0.00006864462,0.94732046,0.00015786817,0.00030066542,0.04929508,0.00025808488],"about_ca_topic_score_codex":0.0016027896,"about_ca_topic_score_gemma":0.01761546,"teacher_disagreement_score":0.94028974,"about_ca_system_score_codex":0.00015087023,"about_ca_system_score_gemma":0.0001373881,"threshold_uncertainty_score":0.98298407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5501235,0.00009509868,0.44908264,0.00016016484,0.000086188666,0.00025282736,0.0000012579782,0.00006792304,0.00013041131],"genre_scores_gemma":[0.99683046,0.000027450096,0.0029702026,0.000057847355,0.00006380366,0.000026270855,8.3173984e-7,0.0000111634545,0.000011941153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985544,0.000012659659,0.0003645039,0.00046461853,0.0001806529,0.00042317656],"domain_scores_gemma":[0.99922574,0.00006281926,0.00006634743,0.000101519756,0.00026303556,0.0002805197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013746256,0.00023222338,0.00035527558,0.0005081145,0.00009848322,0.00014163375,0.00028973861,0.00012661426,0.0000017351833],"category_scores_gemma":[0.000044589477,0.00021736996,0.000029807614,0.00039226023,0.000034180768,0.00019971062,0.000051686227,0.000296709,8.878729e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037675054,0.000066038025,0.008529099,0.0004640787,0.00004454075,0.00004316115,0.008040517,0.8148731,0.00081862474,0.14004138,0.000012757854,0.027028996],"study_design_scores_gemma":[0.00030930678,0.00015438437,0.0022016887,0.00031680678,0.000002706594,0.00006543005,0.000020797595,0.9961463,0.00009349874,0.0004369393,0.000010118858,0.00024198397],"about_ca_topic_score_codex":0.0026013057,"about_ca_topic_score_gemma":0.0011124967,"teacher_disagreement_score":0.44670698,"about_ca_system_score_codex":0.00007152366,"about_ca_system_score_gemma":0.00020610463,"threshold_uncertainty_score":0.886409},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002723296,0.0003451262,0.9930269,0.0012279189,0.0015608139,0.0005016419,0.000007742383,0.00023178227,0.00037476336],"genre_scores_gemma":[0.5148204,0.000028598806,0.4826022,0.00085743295,0.00059059047,0.00015775002,0.000005460214,0.000032085667,0.00090551475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983458,0.000063296146,0.00034599076,0.0005753368,0.00021453897,0.0004550435],"domain_scores_gemma":[0.99895835,0.0002209504,0.00010776035,0.00042720264,0.000116326475,0.00016941554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000277893,0.00021839638,0.00027474097,0.0001456076,0.00026131177,0.0002133297,0.00047171803,0.000099808836,0.0000121419225],"category_scores_gemma":[0.000020604088,0.00019410887,0.0001423476,0.00026534757,0.00007072223,0.00010829022,0.00013355273,0.00011825635,0.000032382428],"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.000028418519,0.00057924434,0.000063121624,0.00009434238,0.00028291022,0.00006646606,0.005007192,0.023349172,0.00022466251,0.06858613,0.04745033,0.854268],"study_design_scores_gemma":[0.001049234,0.00016065653,0.00005843106,0.000024156949,0.0000081550015,0.00006884555,0.000041891286,0.98800844,0.000039731403,0.00068386295,0.009599156,0.000257467],"about_ca_topic_score_codex":0.000031886375,"about_ca_topic_score_gemma":0.0000033545637,"teacher_disagreement_score":0.9646592,"about_ca_system_score_codex":0.000032647393,"about_ca_system_score_gemma":0.000008054433,"threshold_uncertainty_score":0.79155296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01809174,0.00022328332,0.9665574,0.00021436736,0.012789699,0.0014230233,0.00013431608,0.00041230116,0.00015391406],"genre_scores_gemma":[0.9967193,0.000011250014,0.0005872929,0.00008524822,0.00031551128,0.0003255872,0.000041510684,0.0000512232,0.00186305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971356,0.00034232409,0.0007533106,0.00074459426,0.00055534317,0.0004688402],"domain_scores_gemma":[0.9978372,0.00020588361,0.0002657755,0.00058516196,0.00082722324,0.00027878286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000983911,0.00038655123,0.0004725874,0.00043884822,0.0005176384,0.0006869053,0.00041199086,0.00030456393,0.0000039444167],"category_scores_gemma":[0.000033588047,0.0003317031,0.00013770293,0.00076364825,0.00004851529,0.00034175406,0.0000069462367,0.00033219028,0.000048615442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007583775,0.0002744808,0.00000609704,0.00010584571,0.00008465489,0.0000042728166,0.005189297,0.98298776,0.00090531143,0.006416737,0.0014321194,0.0025175563],"study_design_scores_gemma":[0.0010930607,0.00047096558,0.0000061430806,0.0002608427,0.000028438131,0.0002256953,0.0029914153,0.99118197,0.00072868617,0.00003930843,0.002599949,0.00037354528],"about_ca_topic_score_codex":0.00010448721,"about_ca_topic_score_gemma":0.0002024666,"teacher_disagreement_score":0.97862756,"about_ca_system_score_codex":0.00035373386,"about_ca_system_score_gemma":0.00012706866,"threshold_uncertainty_score":0.9999135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06666799,0.000003155088,0.9273188,0.0012445956,0.00062991225,0.00013180787,8.0069816e-7,0.000066863104,0.0039360537],"genre_scores_gemma":[0.99246925,3.9769668e-7,0.006265239,0.0010433919,0.00020595027,0.000008911719,9.608611e-7,0.0000035616222,0.0000023369766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808836,0.0003633861,0.00029879203,0.00040975458,0.00054525776,0.0002944386],"domain_scores_gemma":[0.9968385,0.0021028887,0.00010475904,0.00067601976,0.00018009206,0.00009775402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030108744,0.00011863003,0.00016878796,0.000066797336,0.00045630537,0.00022735955,0.001501932,0.000040568957,0.000070361115],"category_scores_gemma":[0.00008073933,0.00007435753,0.00007759631,0.00050141604,0.0016979523,0.00026530784,0.00035402837,0.00020759126,0.000040706465],"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.00000460747,0.000043298234,0.000022114971,0.0000026920575,0.0000023971093,3.9605706e-7,0.000121436766,0.019586703,0.00005958147,0.9773785,0.00015436449,0.002623899],"study_design_scores_gemma":[0.000059989816,0.00012433002,0.0006530226,0.000028147742,9.902996e-7,0.000009534322,0.0000021260907,0.62684953,0.00042582696,0.37176076,0.000022691202,0.000063061765],"about_ca_topic_score_codex":0.0000039570264,"about_ca_topic_score_gemma":3.7445216e-7,"teacher_disagreement_score":0.9258013,"about_ca_system_score_codex":0.00003754769,"about_ca_system_score_gemma":0.000024975008,"threshold_uncertainty_score":0.62561756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15575106,0.000016018428,0.8259506,0.00017450786,0.00015468786,0.00012323335,2.8736473e-8,0.00014329585,0.017686533],"genre_scores_gemma":[0.9841148,5.1138767e-7,0.014494423,0.00021153282,0.00006832324,0.000017520464,1.18016175e-7,0.000005685802,0.0010870515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992281,0.000049331567,0.000118610595,0.00026607758,0.00013512393,0.00020275493],"domain_scores_gemma":[0.99954754,0.00004673378,0.00004784332,0.0002443821,0.000049550417,0.00006394846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003716656,0.00008750684,0.000112244685,0.000033625827,0.00009978323,0.00024341748,0.00018208535,0.000031267544,0.000007730763],"category_scores_gemma":[0.0000070913507,0.000055779263,0.000017837483,0.00014247555,0.000013206084,0.00006942066,0.00006561886,0.0000745646,0.000020189149],"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.00005419356,0.0001840972,0.00064281205,0.00008831654,0.00007774878,0.000008469554,0.0077267815,0.057202306,0.0042419555,0.38321835,0.0011090466,0.5454459],"study_design_scores_gemma":[0.00030834248,0.00021346698,0.00013944178,0.000041293344,0.0000018263843,0.00002919077,0.00006179375,0.9927199,0.00093683606,0.00029073496,0.0051284614,0.00012869468],"about_ca_topic_score_codex":0.00011481972,"about_ca_topic_score_gemma":0.00008019599,"teacher_disagreement_score":0.9355176,"about_ca_system_score_codex":0.000011441196,"about_ca_system_score_gemma":0.000010616934,"threshold_uncertainty_score":0.23472804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011220958,0.0000849137,0.97697115,0.0004941405,0.0054534134,0.000548414,0.0000013919597,0.00081130373,0.004414311],"genre_scores_gemma":[0.98708785,0.000004029889,0.010414724,0.0003282046,0.00030374932,0.00007454298,0.0000010349006,0.00002528476,0.0017605709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977023,0.00023668057,0.0005916425,0.0005873913,0.00038871416,0.00049328856],"domain_scores_gemma":[0.9975603,0.00035067936,0.00017399807,0.0015280594,0.00021964301,0.00016730167],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040733023,0.0002616267,0.00032862797,0.00023618226,0.0004541554,0.0007236007,0.0014101899,0.00014274938,0.00006208128],"category_scores_gemma":[0.000022191298,0.00023568797,0.00017674113,0.0005621355,0.000029754015,0.00050879153,0.000026959246,0.00033140328,0.001249952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015575426,0.0005882541,0.00013194694,0.00020751587,0.00045282659,0.00003431882,0.008456872,0.6453752,0.0014987946,0.060672425,0.02328541,0.2592809],"study_design_scores_gemma":[0.00042902093,0.0001615415,0.00009886207,0.00017872006,0.000007725163,0.00017566232,0.00066260854,0.9930244,0.00030271828,0.00077428325,0.0038019356,0.0003825011],"about_ca_topic_score_codex":0.00042502832,"about_ca_topic_score_gemma":0.000004675407,"teacher_disagreement_score":0.9758669,"about_ca_system_score_codex":0.00011194023,"about_ca_system_score_gemma":0.000037171092,"threshold_uncertainty_score":0.9995277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153181385,0.00008150444,0.9788712,0.00019588471,0.001483769,0.0035181632,0.000013969648,0.00044734165,0.00007000305],"genre_scores_gemma":[0.67049557,4.3924047e-7,0.3285544,0.000060596205,0.00021548227,0.00057808147,0.000011876784,0.00002428631,0.00005925578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975988,0.00017948038,0.0007071488,0.00074517267,0.00021471326,0.0005546762],"domain_scores_gemma":[0.99794453,0.00064700964,0.0002665943,0.0006177532,0.00036536367,0.0001587348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007186423,0.00033305978,0.00047423528,0.0002498787,0.00063291925,0.00093376986,0.00063850766,0.00018488236,0.000001957145],"category_scores_gemma":[0.00007745094,0.0002854597,0.00020843066,0.00027050258,0.00008516887,0.00017590648,0.000023768427,0.00029235767,0.000002652667],"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.000112573805,0.00030639613,0.00009725104,0.00081505254,0.00040213874,0.0000018176163,0.005979435,0.3202409,0.00048146452,0.004904768,0.00020154046,0.66645664],"study_design_scores_gemma":[0.0011821983,0.00040217658,0.0000102035165,0.00021186222,0.00002176163,0.00012906184,0.0019331574,0.99463564,0.00014500906,0.00033120788,0.0006696643,0.00032803605],"about_ca_topic_score_codex":0.0006544304,"about_ca_topic_score_gemma":0.000026789183,"teacher_disagreement_score":0.6743948,"about_ca_system_score_codex":0.00008129697,"about_ca_system_score_gemma":0.000073397845,"threshold_uncertainty_score":0.99995977},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018378269,0.003132637,0.9760919,0.00038209886,0.00044068173,0.000595814,6.640404e-7,0.0001313717,0.00084651815],"genre_scores_gemma":[0.9756855,0.0000018518616,0.021955747,0.000100268946,0.0019279595,0.000042352574,7.0507934e-7,0.000031548,0.00025411753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667037,0.0002589659,0.0014155465,0.00035917113,0.000815775,0.00048017933],"domain_scores_gemma":[0.9962429,0.00026740629,0.0018378334,0.00017779777,0.00127428,0.00019982568],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020999294,0.0002687068,0.0005087543,0.0003665175,0.0005427317,0.0016077254,0.00076462264,0.00015428095,0.0000058484893],"category_scores_gemma":[0.000039351275,0.00020305629,0.00020756583,0.00044022247,0.00003643082,0.0010394998,0.000065875865,0.00040021702,0.0000064897863],"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.00021265578,0.00037722546,0.0007747527,0.003974315,0.0002293406,0.000042717453,0.013453899,0.2779384,0.015339676,0.0021993702,0.010604708,0.6748529],"study_design_scores_gemma":[0.0005595473,0.00042463196,0.00010207961,0.0020252473,0.000026301625,0.00068992574,0.0008516063,0.98533,0.0005274096,0.0006604518,0.008525276,0.00027753614],"about_ca_topic_score_codex":0.000022650423,"about_ca_topic_score_gemma":0.0000013751707,"teacher_disagreement_score":0.95730716,"about_ca_system_score_codex":0.00018127012,"about_ca_system_score_gemma":0.00028643996,"threshold_uncertainty_score":0.9994287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047227394,0.00046954965,0.9215216,0.00054275274,0.0004622859,0.00009985165,5.420476e-8,0.00028101105,0.029395472],"genre_scores_gemma":[0.9775017,0.000007388869,0.02191465,0.0001196459,0.000031188625,0.000009294966,5.5491803e-8,0.0000021403018,0.0004139421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994774,0.000027183843,0.00011547855,0.00012277073,0.000058007932,0.00019919142],"domain_scores_gemma":[0.999719,0.000056986442,0.00002220437,0.00016350285,0.000012857717,0.000025419296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036396223,0.000053024814,0.00008058908,0.000086225664,0.000040002724,0.000060399245,0.0001817671,0.00005794282,0.0000078418025],"category_scores_gemma":[0.000019510186,0.00004085015,0.0000122353,0.00019442581,0.000017636734,0.00037567515,0.00011786685,0.00007129079,0.000020672212],"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.0000055924193,0.00009987452,0.0913931,0.000026009748,0.000017541923,0.000012435381,0.0041198544,0.00009320315,0.0039489353,0.66560286,0.008612526,0.22606808],"study_design_scores_gemma":[0.0034733347,0.0006391711,0.041377943,0.00040817776,0.000013619227,0.00088045874,0.018511767,0.75444055,0.06660079,0.039367605,0.07185816,0.002428416],"about_ca_topic_score_codex":0.00002056711,"about_ca_topic_score_gemma":0.000018779929,"teacher_disagreement_score":0.9302743,"about_ca_system_score_codex":0.000016063892,"about_ca_system_score_gemma":0.0000044718777,"threshold_uncertainty_score":0.1665821},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000620757,0.000022236567,0.9853704,0.00081793615,0.0018979998,0.0005349368,0.000004923441,0.00024943118,0.010481387],"genre_scores_gemma":[0.96787935,0.000003133921,0.025104355,0.0012941761,0.0006867595,0.00023414621,0.000020382618,0.000016121454,0.0047615897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859536,0.00005429931,0.00036031337,0.00039276338,0.00013362164,0.00046366153],"domain_scores_gemma":[0.9989336,0.00024928089,0.000105015024,0.00040211072,0.00019799868,0.000112001806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034672415,0.00016055682,0.00021763604,0.00004217996,0.0002510317,0.00048351396,0.00046958897,0.00010199569,0.00014034726],"category_scores_gemma":[0.000022479682,0.00012343178,0.000121223384,0.00020241087,0.000012283686,0.00035542814,0.000038168935,0.00014094308,0.00014356583],"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.000006565563,0.0001011857,0.000068398826,0.000011003261,0.0000746807,0.000004297561,0.00019952981,0.05264401,0.00006200184,0.084954955,0.18553792,0.67633545],"study_design_scores_gemma":[0.00030322763,0.0001217853,0.00009307598,0.00003713123,0.0000018704073,0.000013573317,0.000059795133,0.98730034,0.00021487198,0.00080512377,0.010863844,0.00018534686],"about_ca_topic_score_codex":0.00023391242,"about_ca_topic_score_gemma":0.000015683987,"teacher_disagreement_score":0.9672586,"about_ca_system_score_codex":0.0000490233,"about_ca_system_score_gemma":0.000017629585,"threshold_uncertainty_score":0.5033402},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062257866,0.0001110492,0.9575655,0.0011211053,0.012404603,0.0003496815,0.000031668056,0.00051841565,0.021672226],"genre_scores_gemma":[0.9574689,0.000004038886,0.03218642,0.0028578227,0.0014021862,0.00009782187,0.000056227116,0.00003145706,0.0058950786],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972111,0.00044473202,0.00053058297,0.00093329826,0.0004935487,0.00038675085],"domain_scores_gemma":[0.9969531,0.00074754446,0.0004998495,0.0013496894,0.0003407549,0.00010905043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008195788,0.0003806094,0.0006407601,0.00012256714,0.00017633305,0.00080657564,0.0016468525,0.0005049508,0.0001440439],"category_scores_gemma":[0.0001319337,0.00032863868,0.00027277297,0.00015940856,0.000037155733,0.00019202962,0.0012574707,0.00067878707,0.00021910902],"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.000050377083,0.00029739502,0.0019644506,0.00024186843,0.00074950955,0.00003807816,0.005003474,0.34786543,0.00007083776,0.050766304,0.5882533,0.0046989415],"study_design_scores_gemma":[0.00035919706,0.000059253725,0.0002061942,0.00022395235,0.000016186292,7.1890975e-7,0.00005891118,0.9600195,0.0004639679,0.01110596,0.027010813,0.00047531593],"about_ca_topic_score_codex":0.0025803158,"about_ca_topic_score_gemma":0.0005079166,"teacher_disagreement_score":0.95124316,"about_ca_system_score_codex":0.00028617674,"about_ca_system_score_gemma":0.00022889757,"threshold_uncertainty_score":0.99991655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01263208,0.000026250858,0.9785497,0.0060183126,0.00017915513,0.00021538296,1.2163257e-7,0.00015254642,0.002226433],"genre_scores_gemma":[0.9745579,0.00000125491,0.019776879,0.004855183,0.00044465426,0.000053041174,0.0000011056543,0.000008960262,0.00030104505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992216,0.000038651993,0.0001298435,0.00027305487,0.00014964514,0.00018719648],"domain_scores_gemma":[0.999249,0.000046722977,0.00007183089,0.0004977342,0.0000954943,0.000039250728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018559687,0.00009798218,0.00008857983,0.00002411074,0.00018004121,0.00022871721,0.0006081808,0.000034017445,0.0000019892718],"category_scores_gemma":[6.35843e-7,0.000057389992,0.000027159858,0.00030364425,0.0000130467015,0.00027645615,0.00011895724,0.00010173395,0.00006298202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016031852,0.000059879476,0.00071519887,0.000025766525,0.000041528354,0.000010387527,0.0041671856,0.6730562,0.000054446667,0.19523655,0.01616305,0.11045378],"study_design_scores_gemma":[0.000115234936,0.000023774634,0.0002233528,0.000014357767,0.0000020773944,0.000061008766,0.000010841608,0.9662993,0.00000903265,0.00056245853,0.032585222,0.00009335499],"about_ca_topic_score_codex":0.000031761952,"about_ca_topic_score_gemma":0.00006863605,"teacher_disagreement_score":0.9619258,"about_ca_system_score_codex":0.000020812991,"about_ca_system_score_gemma":0.000024269892,"threshold_uncertainty_score":0.23402959},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17400773,0.0005684719,0.76261014,0.002078416,0.0017392421,0.00030716517,3.9965857e-7,0.00017249589,0.05851596],"genre_scores_gemma":[0.9971072,0.0000035706364,0.0017485813,0.000040280567,0.000103866856,0.000010716428,1.3042113e-7,0.0000015554191,0.000984066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992294,0.00007391854,0.00027866464,0.00014383762,0.00009169814,0.00018250143],"domain_scores_gemma":[0.9992961,0.000280486,0.00006601513,0.00029112742,0.000056677243,0.000009561977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005798131,0.00005369384,0.000102360325,0.000015035422,0.00008032096,0.000054947777,0.0004188489,0.000035701345,0.0000054924567],"category_scores_gemma":[0.000032927124,0.000030723495,0.0000377746,0.00024116992,0.00005141829,0.000117445525,0.000088878944,0.000058768506,0.000004055789],"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.000008467929,0.00004150796,0.042122178,0.000008872611,0.0000038722246,0.0000012619942,0.0001596766,0.048046336,0.000028241184,0.89915633,0.0037395693,0.006683708],"study_design_scores_gemma":[0.00051723456,0.000113584836,0.09666122,0.000041196214,0.0000017230461,0.00001044408,0.00046598533,0.76657176,0.0013791805,0.11107001,0.022918036,0.00024963304],"about_ca_topic_score_codex":0.0012156711,"about_ca_topic_score_gemma":0.0041283066,"teacher_disagreement_score":0.8230995,"about_ca_system_score_codex":0.000018677893,"about_ca_system_score_gemma":0.000015411648,"threshold_uncertainty_score":0.2303692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008068359,0.00023083272,0.9982218,0.00008863704,0.00034805638,0.00024125823,0.0000029971818,0.000024783409,0.000034758268],"genre_scores_gemma":[0.72648937,4.9246324e-7,0.27286366,0.00006237152,0.0005426998,0.000022527764,0.0000020451173,0.000009270518,0.000007559606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.00001251347,0.00031959577,0.00017741631,0.0000731264,0.00030883192],"domain_scores_gemma":[0.99919957,0.00012334362,0.00009575635,0.00010526907,0.00019947499,0.0002765703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003814624,0.00011702008,0.00024081618,0.00025828116,0.00012642772,0.00015720086,0.0002835736,0.0000701303,8.246859e-8],"category_scores_gemma":[0.000030767264,0.00010395553,0.00009266986,0.00019650544,0.0000048692127,0.00010409647,0.00000858672,0.00014559847,9.34279e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004311429,0.0000057779844,0.0000064372052,0.00012107095,0.000038446702,5.889182e-7,0.00014694406,0.89980674,0.0008697995,0.078425735,0.00015244266,0.02042174],"study_design_scores_gemma":[0.00038146312,0.00012076109,0.000015920356,0.000058447145,0.0000061908395,0.00025489205,0.0000055013775,0.99536514,0.000046989746,0.00019178922,0.0034264817,0.00012643823],"about_ca_topic_score_codex":0.00012984306,"about_ca_topic_score_gemma":0.00002339264,"teacher_disagreement_score":0.72568256,"about_ca_system_score_codex":0.00008100422,"about_ca_system_score_gemma":0.00009635769,"threshold_uncertainty_score":0.42391837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731261,0.00018305915,0.016084706,0.0036163211,0.002340762,0.0012309806,0.00003583947,0.00017817398,0.0032040433],"genre_scores_gemma":[0.8776321,0.000024395302,0.11924113,0.00046106224,0.001607156,0.0006043405,0.0000073165197,0.000087738015,0.00033479053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740833,6.152363e-8,0.0007960425,0.0006023851,0.00067272293,0.00052045734],"domain_scores_gemma":[0.99731755,0.00033804317,0.0004775581,0.00013100129,0.0015864983,0.00014934829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011007605,0.00041376095,0.0005315869,0.00016871626,0.00015129973,0.00032915355,0.0015726308,0.00027206587,0.000004847317],"category_scores_gemma":[0.0004965905,0.00031739005,0.0009291983,0.00040748768,0.000099542645,0.00041447676,0.00008802281,0.0004024262,0.0000018372237],"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.000083567444,0.00011097221,0.00004605984,0.0005430075,0.00028188448,9.646808e-8,0.00026296242,0.0026245534,0.046373494,0.9437271,0.005537743,0.0004085825],"study_design_scores_gemma":[0.0049259607,0.0028772037,0.00020012428,0.0020128505,0.0002033063,0.000120997516,0.0036496639,0.682824,0.14891246,0.009321107,0.14334619,0.0016061489],"about_ca_topic_score_codex":0.000006046457,"about_ca_topic_score_gemma":2.9876315e-7,"teacher_disagreement_score":0.934406,"about_ca_system_score_codex":0.0001809903,"about_ca_system_score_gemma":0.000054437594,"threshold_uncertainty_score":0.9999278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014505294,0.000053905595,0.9414073,0.00014944962,0.0018403826,0.000088532244,1.7365794e-7,0.00033805871,0.05467166],"genre_scores_gemma":[0.9806495,9.487903e-7,0.01586059,0.00082720007,0.00019584986,0.000011345236,3.723638e-7,0.0000075141093,0.0024466966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990613,0.00006774183,0.00020610908,0.00026876907,0.00011584978,0.00028022524],"domain_scores_gemma":[0.99927986,0.000041892254,0.00005626243,0.00046827,0.0000736354,0.000080097365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024140647,0.00010919409,0.00012488155,0.00003741284,0.00009738361,0.000085505795,0.0006189651,0.00005933273,0.0004044331],"category_scores_gemma":[0.0000053196127,0.000085554784,0.00007203449,0.00022712574,0.00001724359,0.00021362545,0.00010789362,0.00009327883,0.00033620826],"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.00006310225,0.0002659096,0.011830501,0.000046687022,0.00011346414,0.00007049822,0.0031428454,0.019848155,0.00008904406,0.503668,0.42260197,0.038259782],"study_design_scores_gemma":[0.0003156351,0.00020526457,0.0010282898,0.00006809466,0.000003568751,0.000024551651,0.000066326975,0.955971,0.002192703,0.0025111584,0.037283562,0.00032981482],"about_ca_topic_score_codex":0.00015999697,"about_ca_topic_score_gemma":0.00012458692,"teacher_disagreement_score":0.97919893,"about_ca_system_score_codex":0.000023346307,"about_ca_system_score_gemma":0.000028401813,"threshold_uncertainty_score":0.4428259},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06422665,0.0000021117357,0.92247117,0.00086017576,0.001408211,0.00023336828,7.9741784e-7,0.00013553482,0.010661973],"genre_scores_gemma":[0.8983167,3.2398592e-7,0.09679338,0.00428817,0.00029531546,0.00002114744,0.0000013248299,0.000010281344,0.00027335825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984935,0.00026813638,0.00029547635,0.00042005157,0.00023783042,0.00028498762],"domain_scores_gemma":[0.99881154,0.00017932752,0.000060606766,0.00067007745,0.00011607254,0.00016238661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009136392,0.0001321483,0.00015456173,0.00014159527,0.00023182986,0.000417654,0.0006882761,0.000050282557,0.00033300606],"category_scores_gemma":[0.00008982431,0.000109498695,0.00005761579,0.0003257645,0.000008978722,0.00045542003,0.0001736977,0.00011575572,0.000313518],"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.000008065997,0.000070491005,0.000119843426,0.0000038066273,0.000020492056,0.0000015542985,0.0021325392,0.031547252,0.0007179285,0.92628145,0.0030247772,0.036071822],"study_design_scores_gemma":[0.00021958421,0.00067602016,0.00018927203,0.000085500666,0.000005630836,0.0000172264,0.00031858968,0.96836084,0.0015437063,0.015840098,0.012470342,0.00027316166],"about_ca_topic_score_codex":0.00027171604,"about_ca_topic_score_gemma":0.00022641767,"teacher_disagreement_score":0.9368136,"about_ca_system_score_codex":0.0000704121,"about_ca_system_score_gemma":0.000025222145,"threshold_uncertainty_score":0.4465227},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053187087,0.0000047348726,0.9379524,0.0064828875,0.0013132921,0.00008849589,0.000001879925,0.00028268973,0.0006865368],"genre_scores_gemma":[0.97074115,4.124381e-7,0.02222775,0.0068457793,0.00012700947,0.000017350296,0.000024012104,0.0000040507052,0.000012512705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.000016564842,0.00039766522,0.000119174176,0.00023355514,0.00023049949],"domain_scores_gemma":[0.999326,0.000021893025,0.00021169767,0.00021342517,0.0001745074,0.00005247332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029232062,0.00011245173,0.00010467613,0.000118409946,0.00028032268,0.0008642741,0.0004499764,0.000065180284,0.0000075719613],"category_scores_gemma":[0.00003788271,0.00009879375,0.00003617209,0.00036165735,0.00002820485,0.003797554,0.000064077976,0.00022977764,0.0001151798],"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.00002367374,0.00004343665,0.0014268683,0.0004840318,0.000053710108,0.000017706665,0.018419605,0.013864163,0.0128347315,0.1622574,0.038153682,0.75242096],"study_design_scores_gemma":[0.0005015944,0.000014345437,0.0015330769,0.00013893524,0.0000036121596,0.00016436233,0.00018211798,0.74417585,0.0026644287,0.0004882983,0.24966012,0.0004732546],"about_ca_topic_score_codex":0.000012580313,"about_ca_topic_score_gemma":0.0000048841634,"teacher_disagreement_score":0.917554,"about_ca_system_score_codex":0.000044375647,"about_ca_system_score_gemma":0.00007672142,"threshold_uncertainty_score":0.8334215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014768133,0.000068174624,0.98265535,0.00050285546,0.00003372549,0.0013473841,0.0000013594454,0.00011154702,0.00051148183],"genre_scores_gemma":[0.80891734,0.000004101368,0.1904134,0.0003914522,0.000017072363,0.00023073278,0.000004223163,0.000010484505,0.000011188344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862254,0.000040163064,0.00052159006,0.00040512267,0.00016304497,0.00024756783],"domain_scores_gemma":[0.99858147,0.00019734209,0.00022801754,0.00078637945,0.000085371124,0.00012142693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003070022,0.00020676471,0.00033008138,0.00022435853,0.00009061972,0.0000949969,0.0005673393,0.000063404565,0.0000011562598],"category_scores_gemma":[0.0000031509476,0.00016224336,0.0000437441,0.00070293626,0.00003775565,0.00011687681,0.000121655685,0.000113006136,0.000005554977],"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.000028497567,0.0013339237,0.0002814333,0.00023430954,0.000105445404,0.000003136125,0.017831884,0.23933887,0.0006546265,0.5966026,0.0030091512,0.14057611],"study_design_scores_gemma":[0.00039799238,0.00019852078,0.0011949547,0.00020642413,0.000005497268,0.000033695047,0.00017424575,0.9885663,0.00007647449,0.007596253,0.0013311361,0.00021850146],"about_ca_topic_score_codex":0.000004354534,"about_ca_topic_score_gemma":0.0000073123133,"teacher_disagreement_score":0.7941492,"about_ca_system_score_codex":0.00004367414,"about_ca_system_score_gemma":0.000016489348,"threshold_uncertainty_score":0.66160923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02762896,0.00006540325,0.90650415,0.00017233982,0.00019817184,0.00024043325,0.0000014653632,0.00014215763,0.06504694],"genre_scores_gemma":[0.81049526,0.00001034098,0.18895918,0.00008699468,0.000057363995,0.000027950848,0.0000010448533,0.000015375846,0.0003465226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880815,0.00001155388,0.00042384746,0.00024653954,0.00027591782,0.00023399272],"domain_scores_gemma":[0.99906164,0.00009156158,0.00018701844,0.0005342504,0.000053891377,0.000071613074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022145055,0.00015779634,0.0002976537,0.00007879927,0.00008348292,0.00008628861,0.0005886331,0.00007883319,0.000107023356],"category_scores_gemma":[0.000016994085,0.00013284317,0.00010019718,0.0002597329,0.0000559672,0.00014886915,0.0001564807,0.00010822795,0.0001250819],"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.0000036221313,0.00015535572,0.000006183445,0.0002648258,0.000074179494,0.000005405396,0.024763323,0.001610802,0.00664116,0.95383793,0.008545539,0.004091676],"study_design_scores_gemma":[0.00036610957,0.00007832299,0.0000038362446,0.00008916644,0.000018404035,0.00003543147,0.0021506096,0.97876245,0.0033229466,0.011929847,0.00292022,0.00032263057],"about_ca_topic_score_codex":0.000007795622,"about_ca_topic_score_gemma":0.0000019359525,"teacher_disagreement_score":0.9771517,"about_ca_system_score_codex":0.00002611783,"about_ca_system_score_gemma":0.000007476184,"threshold_uncertainty_score":0.5417187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94054335,0.00020224083,0.016654084,0.00026903898,0.0012951387,0.000066254535,5.480408e-8,0.000025246161,0.04094459],"genre_scores_gemma":[0.9977015,0.000017471499,0.0004263945,0.00007393431,0.000075458476,0.00000407041,3.650403e-8,0.0000013758555,0.0016997479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955606,0.000027462911,0.00013427915,0.000051468814,0.00007907445,0.00015164635],"domain_scores_gemma":[0.9996699,0.000057393314,0.000030693798,0.00019898081,0.00002303734,0.000020010675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004189056,0.000032688928,0.000052345615,0.000020412392,0.000049759234,0.000020743335,0.0002706529,0.000017938119,0.000008864662],"category_scores_gemma":[0.0000056455056,0.00001843434,0.000019161562,0.00013305526,0.0000149342195,0.0002437187,0.000054139844,0.00004310327,0.000030497024],"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.000010683636,0.00010046531,0.23100558,0.00002469105,0.0000141248065,6.746416e-7,0.0030132786,0.0012589443,0.0006961833,0.68162495,0.010632644,0.07161778],"study_design_scores_gemma":[0.00029427023,0.0001210658,0.08382467,0.000043710617,0.0000012137446,0.000042671218,0.00025163352,0.819872,0.0062834667,0.00016030206,0.08892867,0.0001763057],"about_ca_topic_score_codex":0.000029090046,"about_ca_topic_score_gemma":0.000027183503,"teacher_disagreement_score":0.81861305,"about_ca_system_score_codex":0.000010291429,"about_ca_system_score_gemma":0.000007446545,"threshold_uncertainty_score":0.07517306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044140723,0.00068174343,0.9810322,0.0068041123,0.0017671336,0.00018849122,8.9014793e-7,0.00001675555,0.005094605],"genre_scores_gemma":[0.9923608,0.000103192244,0.0062321867,0.00041143384,0.00074424763,0.00000600338,2.3392852e-7,0.0000071450763,0.00013477093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998286,0.0003496852,0.00055233453,0.0001230921,0.00044479585,0.00024406664],"domain_scores_gemma":[0.99876475,0.0003472911,0.00033853928,0.00035065334,0.00014290538,0.000055886663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031248922,0.000106698455,0.00017425213,0.00007480649,0.00021420686,0.00039794928,0.001327226,0.000042945514,0.0000019275506],"category_scores_gemma":[0.00004727939,0.000047072674,0.00016120874,0.0003454015,0.00004512094,0.00035373168,0.000064440326,0.00035810733,0.0000053621793],"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.0000681963,0.00034923689,0.0037193191,0.00003229287,0.00027532634,0.00024324871,0.017844794,0.015656924,0.00022638467,0.40923974,0.08341188,0.46893266],"study_design_scores_gemma":[0.001170457,0.0013292978,0.008129116,0.0002996296,0.000025701964,0.0015859749,0.0021591736,0.80317515,0.000050476214,0.05263222,0.1290495,0.00039329432],"about_ca_topic_score_codex":0.000028157798,"about_ca_topic_score_gemma":0.000037235393,"teacher_disagreement_score":0.9879467,"about_ca_system_score_codex":0.000022275228,"about_ca_system_score_gemma":0.00003564241,"threshold_uncertainty_score":0.3837434},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033147077,0.00026901203,0.98556596,0.0024563412,0.0029369032,0.00056964677,0.0000046490104,0.00060638675,0.004276392],"genre_scores_gemma":[0.99511194,0.0000483833,0.0011540574,0.00030307387,0.00013432161,0.00044672567,0.0000016119386,0.000018960436,0.002780934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839795,0.0001155133,0.0003989246,0.0005683803,0.00010881673,0.00041041887],"domain_scores_gemma":[0.9980573,0.00055580004,0.00013020035,0.0010642594,0.00010839286,0.00008405651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069053995,0.00022405674,0.00037199972,0.00051504845,0.00054101215,0.0001602762,0.0007298188,0.0004058531,0.000013059222],"category_scores_gemma":[0.00005772467,0.00019522154,0.00010138367,0.0004987731,0.000073817806,0.00016167703,0.000005697852,0.00035126405,0.00004497399],"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.000060408478,0.00012697087,0.00007763773,0.00009785616,0.00015597949,0.0000033973668,0.00011319047,0.05157147,0.00017441393,0.6794636,0.0027047803,0.2654503],"study_design_scores_gemma":[0.0012390165,0.0013528706,0.000035701036,0.00033202636,0.000025286472,0.00028994845,0.0002341447,0.87215245,0.0018518151,0.019395176,0.10254897,0.0005425723],"about_ca_topic_score_codex":0.000024548854,"about_ca_topic_score_gemma":0.000019563524,"teacher_disagreement_score":0.9917972,"about_ca_system_score_codex":0.00003499349,"about_ca_system_score_gemma":0.000016111348,"threshold_uncertainty_score":0.79609036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020652288,0.00001020429,0.9746157,0.00057333265,0.00212749,0.00032040253,4.181516e-7,0.00029134212,0.019995907],"genre_scores_gemma":[0.962001,0.000008513862,0.019193498,0.00041479396,0.001136489,0.00004792341,0.000003992634,0.000019707739,0.017174052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986067,0.000098464065,0.00028271662,0.00040524374,0.00019065921,0.0004162444],"domain_scores_gemma":[0.99894816,0.00019285269,0.000107311265,0.0005138907,0.00013231281,0.00010548907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096101034,0.00014770994,0.00021776598,0.00006041635,0.00027564148,0.00036347174,0.00050862704,0.000098672426,0.000045048728],"category_scores_gemma":[0.00003205829,0.00012539947,0.000103498394,0.0001779757,0.000016752458,0.00040224617,0.0001385401,0.000081616796,0.00007282609],"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.000029613757,0.00007904374,0.0013122084,0.00006248016,0.00008072109,0.0000031684926,0.0004842702,0.0040180273,0.0010186317,0.8301376,0.14571233,0.017061904],"study_design_scores_gemma":[0.00032322545,0.00012667527,0.00013959454,0.00004500434,0.0000043014643,0.0000067912006,0.000014732112,0.9476963,0.000114881936,0.0014426245,0.049898997,0.00018683783],"about_ca_topic_score_codex":0.00007263619,"about_ca_topic_score_gemma":0.000032406853,"teacher_disagreement_score":0.9599358,"about_ca_system_score_codex":0.000072042785,"about_ca_system_score_gemma":0.000019503297,"threshold_uncertainty_score":0.51136416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477721,0.00020436873,0.028161587,0.00003847213,0.0013099212,0.00009263034,0.0000010334628,0.000086521766,0.022333376],"genre_scores_gemma":[0.9996461,0.00003782095,0.00016720661,0.000053742806,0.00000521223,0.0000050265367,1.4649012e-7,0.0000037721886,0.00008094355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939233,0.00004727757,0.00013789104,0.00018543062,0.00011356758,0.0001234794],"domain_scores_gemma":[0.9994907,0.00007113155,0.000050224484,0.00027086958,0.00006657766,0.000050531304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002085796,0.000082274266,0.00014027779,0.0000927586,0.00007096665,0.000023105851,0.00022538395,0.000050743423,0.000008288889],"category_scores_gemma":[0.000014560881,0.000068646885,0.0000525795,0.0002654118,0.00003181573,0.00014912213,0.00006277269,0.000077838165,0.0000030964964],"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.00000369162,0.000081241014,0.0029221282,0.000008695067,0.000009209501,0.0000028139527,0.00054671225,7.754144e-7,0.000027374184,0.9942977,0.00031633372,0.0017833684],"study_design_scores_gemma":[0.0003730817,0.00065395783,0.01484564,0.00003214575,0.000004784999,0.000016147742,0.000093607414,0.0025556542,0.0021174676,0.9786982,0.00043468675,0.00017462218],"about_ca_topic_score_codex":0.000082100254,"about_ca_topic_score_gemma":0.000004756846,"teacher_disagreement_score":0.05187404,"about_ca_system_score_codex":0.0000064171227,"about_ca_system_score_gemma":0.000008081918,"threshold_uncertainty_score":0.27993387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06306854,0.000017884764,0.9280986,0.0023019493,0.005736331,0.00007415712,0.0000024612111,0.000009111983,0.0006909758],"genre_scores_gemma":[0.7565377,0.0000042394295,0.24305761,0.000111001784,0.0002697228,0.0000010620589,4.8135854e-7,0.000002697093,0.00001550596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974812,0.000062131476,0.00084014924,0.00017120852,0.0012998672,0.00014540149],"domain_scores_gemma":[0.9944283,0.00043870643,0.0009575247,0.00031563413,0.0037881506,0.00007168482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017161452,0.000094009236,0.00019037617,0.0005100189,0.00018679358,0.0003298139,0.0034178114,0.00003271836,0.000014003446],"category_scores_gemma":[0.000109209206,0.0000678696,0.00014723687,0.00065518625,0.00057688606,0.0017883056,0.0003118382,0.00023579823,0.0000023660377],"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.00001370523,0.000103072576,0.00023872998,0.0000034372788,0.000059095088,0.0000036264864,0.0010853505,0.40504923,0.0017524404,0.57106674,0.00045620496,0.020168373],"study_design_scores_gemma":[0.00033377673,0.00009816889,0.0017827353,0.000053640684,0.0000045332213,0.0003536141,0.000024223338,0.9245087,0.00054469646,0.071304165,0.0009176323,0.00007414642],"about_ca_topic_score_codex":0.000021290552,"about_ca_topic_score_gemma":0.000010141445,"teacher_disagreement_score":0.69346917,"about_ca_system_score_codex":0.000047042235,"about_ca_system_score_gemma":0.00064804795,"threshold_uncertainty_score":0.6351201},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042670626,0.0006143907,0.95395994,0.00032956834,0.0011095739,0.0006676039,0.000020345053,0.00013490279,0.00049306167],"genre_scores_gemma":[0.97009003,0.000011694528,0.02622515,0.0010987262,0.0007972183,0.00012609907,0.000008059826,0.000036723588,0.0016062701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998069,0.00013017193,0.00042774796,0.0006641178,0.00014913887,0.00055986206],"domain_scores_gemma":[0.99879396,0.0003050484,0.00018653662,0.00038245204,0.0001842293,0.00014779525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067273347,0.0002984436,0.00042131226,0.00007806079,0.0003779906,0.00035142305,0.0004644119,0.00015430988,0.0000031249783],"category_scores_gemma":[0.00004934001,0.00022976357,0.00011394118,0.0001936792,0.000054023,0.00011392132,0.000091966256,0.00020148604,0.000023192086],"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.0013724718,0.0009989396,0.0019745983,0.00372876,0.0008145367,0.000034684792,0.024044586,0.032419376,0.10593461,0.44364062,0.1261899,0.2588469],"study_design_scores_gemma":[0.00433763,0.002245098,0.00050735346,0.0013480305,0.00004233886,0.00027522843,0.00036835572,0.40883893,0.007606145,0.005300806,0.5675668,0.0015632724],"about_ca_topic_score_codex":0.00006323749,"about_ca_topic_score_gemma":0.00013270097,"teacher_disagreement_score":0.9277348,"about_ca_system_score_codex":0.000033024455,"about_ca_system_score_gemma":0.000030440333,"threshold_uncertainty_score":0.9369486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032499214,0.000140839,0.98728067,0.006752133,0.00024611206,0.00028318478,8.293762e-7,0.000120888886,0.0019254227],"genre_scores_gemma":[0.8716911,0.000005597126,0.1266665,0.0014913138,0.00006944427,0.0000068215713,0.000005314276,0.0000043077625,0.000059568996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985844,0.00030142796,0.00036292258,0.0002648911,0.00017873484,0.00030760403],"domain_scores_gemma":[0.9988965,0.00021667453,0.00010932972,0.0006492874,0.00006473721,0.000063520056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980869,0.00012428475,0.00017855366,0.00007750981,0.0002637901,0.00027504502,0.001172542,0.000047711943,0.0000029042783],"category_scores_gemma":[0.000035792666,0.000096135605,0.000059020473,0.0005877792,0.000015575564,0.00016524289,0.00028206073,0.00022402902,0.000026088517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011015346,0.00007204667,0.00014208962,0.000003876215,0.000014490244,0.000011283752,0.007064181,0.821399,0.000009864484,0.015889196,0.006955778,0.14842719],"study_design_scores_gemma":[0.00029579387,0.000040733852,0.0024147502,0.00006983858,0.0000013149854,0.000018092003,0.00018369929,0.9937931,0.0000042639645,0.00063865876,0.0024124165,0.00012737773],"about_ca_topic_score_codex":0.00012600533,"about_ca_topic_score_gemma":0.000035154724,"teacher_disagreement_score":0.8684412,"about_ca_system_score_codex":0.0000795972,"about_ca_system_score_gemma":0.000016626733,"threshold_uncertainty_score":0.3920296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016354708,0.00006925385,0.97105175,0.00016756981,0.0059489994,0.00006869348,3.2056056e-7,0.000026451162,0.006312239],"genre_scores_gemma":[0.7111708,0.00001912877,0.28762865,0.0005999332,0.0002263942,0.0000015110995,2.2518826e-8,0.000006105055,0.000347476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747723,0.0010481294,0.0005536829,0.00024542533,0.00040334638,0.0002721881],"domain_scores_gemma":[0.9980485,0.0005718892,0.0006670046,0.00024652545,0.00032264707,0.00014346033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035583777,0.00012393836,0.00026647112,0.00021322531,0.00026392413,0.00013820559,0.0010489513,0.000051246934,0.000012752751],"category_scores_gemma":[0.0006080801,0.000089419096,0.00016314306,0.0011857086,0.00009198241,0.00073893665,0.00009054979,0.0003499007,0.0000055719815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031382614,0.0010651598,0.0077519827,0.00002479902,0.00012620272,0.0008054009,0.016490186,0.41646025,0.07697096,0.3267892,0.01812624,0.1350758],"study_design_scores_gemma":[0.0005403287,0.0019529128,0.060460277,0.00013686517,0.000026911086,0.0011612446,0.00016769304,0.90175056,0.00477971,0.01654671,0.012088479,0.00038832918],"about_ca_topic_score_codex":0.000009228824,"about_ca_topic_score_gemma":0.00000175247,"teacher_disagreement_score":0.69481605,"about_ca_system_score_codex":0.00003799104,"about_ca_system_score_gemma":0.00007582868,"threshold_uncertainty_score":0.36464047},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032203276,0.00004938813,0.9546007,0.0057588555,0.0037471282,0.0026905625,0.00024883918,0.00029421868,0.0004070214],"genre_scores_gemma":[0.95329624,6.063029e-7,0.0342842,0.004497932,0.0018446922,0.001833738,0.00003853541,0.000065134416,0.0041389186],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750286,0.000109969376,0.0006603495,0.0008665804,0.00023091177,0.00062935497],"domain_scores_gemma":[0.99718124,0.0008907314,0.00021950461,0.0011297248,0.00035882348,0.00021995013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069406076,0.00037990356,0.0005614602,0.00015698293,0.000238978,0.0005686336,0.0018322524,0.00016728482,0.000014059187],"category_scores_gemma":[0.0002712073,0.00025131827,0.00036682189,0.00010705595,0.000036252663,0.00013017474,0.00031122557,0.00013121952,0.000009264063],"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.0011640216,0.00030097232,0.0018506714,0.0010397834,0.0009140207,0.0000028501538,0.04214681,0.012461309,0.0050104037,0.19372883,0.643816,0.0975643],"study_design_scores_gemma":[0.0014396288,0.00093049166,0.00008855594,0.00032779013,0.000032352786,0.000018358303,0.00092629314,0.75787383,0.0031611512,0.020073496,0.21454427,0.00058381655],"about_ca_topic_score_codex":0.0018089198,"about_ca_topic_score_gemma":0.0024438922,"teacher_disagreement_score":0.921093,"about_ca_system_score_codex":0.00008952876,"about_ca_system_score_gemma":0.000047012927,"threshold_uncertainty_score":0.9999939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024989463,0.000064991786,0.9844397,0.00030081216,0.0010473107,0.00012815541,6.5175286e-8,0.000093928764,0.013675191],"genre_scores_gemma":[0.96164405,0.0000015248938,0.03430813,0.00038432208,0.0005169563,0.000012982536,4.5903897e-7,0.0000064016267,0.0031251456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920833,0.000048829777,0.00021558205,0.0002238059,0.000069605936,0.00023382684],"domain_scores_gemma":[0.99935013,0.00028840752,0.00004727752,0.0002223091,0.000029978126,0.00006186767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004963569,0.00007530389,0.00012726875,0.000051561143,0.000054377386,0.00012824299,0.00031434314,0.00004765221,0.000017419472],"category_scores_gemma":[0.00006418261,0.00006426627,0.00004420557,0.00017686137,0.000004119083,0.00014755409,0.000060398263,0.00006996738,0.000011971661],"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.000006710775,0.000015330075,0.00062190916,0.00001473266,0.0000064506526,0.0000016807928,0.00023438862,0.08987855,0.000008916066,0.6143438,0.04840981,0.24645768],"study_design_scores_gemma":[0.00026918252,0.000046039775,0.00031439794,0.00003263748,7.625605e-7,0.0000068852564,0.000010069882,0.98105764,0.0000119439765,0.0017253661,0.016436145,0.0000889322],"about_ca_topic_score_codex":0.00011213045,"about_ca_topic_score_gemma":0.00015026027,"teacher_disagreement_score":0.9613942,"about_ca_system_score_codex":0.00001798651,"about_ca_system_score_gemma":0.000014337563,"threshold_uncertainty_score":0.26207024},"labels":[],"label_agreement":null},{"id":"W2035138544","doi":"10.1142/s0219265901000464","title":"HIGHER DIMENSIONAL HONEYCOMB NETWORKS","year":2001,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Honeycomb; Interconnection; Generalization; Honeycomb structure; Degree (music); Voronoi diagram; Hexagonal crystal system; Computer science; Materials science; Mathematics; Geometry; Physics; Telecommunications; Composite material; Mathematical analysis; Chemistry","score_opus":0.013946881794750452,"score_gpt":0.2327738769313161,"score_spread":0.21882699513656564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035138544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019949177,0.0012389121,0.9531558,0.0012942511,0.021114798,0.00011528058,2.1305104e-7,0.000114815106,0.0030167652],"genre_scores_gemma":[0.9914706,0.00023620075,0.0015510164,0.001382023,0.003701217,0.0000058503824,0.0000011704263,0.00002769438,0.0016242263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971795,0.0002981196,0.0012134183,0.0003453985,0.00045969582,0.00050388323],"domain_scores_gemma":[0.997335,0.00032438824,0.00089549576,0.00046194237,0.0007071097,0.0002760665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012187869,0.00029656704,0.0005208746,0.00035598277,0.00023004979,0.00033005117,0.00090020493,0.00027101388,0.00027966578],"category_scores_gemma":[0.000046742945,0.00024085087,0.0004603635,0.0007872809,0.00005156239,0.0012412319,0.00017715756,0.00086447864,0.000032333875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021316734,0.00025218155,0.0028143474,0.000006035248,0.00032153126,0.00034434654,0.00016070192,0.8464626,0.00012330736,0.021208147,0.09575656,0.032337055],"study_design_scores_gemma":[0.0011626101,0.0007061869,0.0027120016,0.00026623794,0.000026856775,0.0035851197,0.00005722331,0.9043551,0.00003901461,0.0011477032,0.08553942,0.0004025423],"about_ca_topic_score_codex":0.00001855513,"about_ca_topic_score_gemma":0.00002345949,"teacher_disagreement_score":0.97152144,"about_ca_system_score_codex":0.0001901265,"about_ca_system_score_gemma":0.000048551363,"threshold_uncertainty_score":0.98216134},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003908893,0.000016986225,0.99115777,0.0005505359,0.0013536412,0.00082670164,0.0000060784555,0.00006674087,0.0021126408],"genre_scores_gemma":[0.21361935,1.8829978e-7,0.784732,0.00079768075,0.00033260186,0.00015621752,0.0000070654105,0.000011714389,0.000343173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866533,0.00008472595,0.00035534316,0.00041972825,0.00014149763,0.00033339922],"domain_scores_gemma":[0.9992838,0.00008738443,0.00007042267,0.00027829685,0.00015142647,0.00012868577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006904336,0.00014245941,0.00024010747,0.00021665684,0.00006709921,0.00013474394,0.0003495304,0.000105998064,0.0000045201036],"category_scores_gemma":[0.00004755004,0.00011897939,0.000060639384,0.0002926962,0.00001849534,0.00012064517,0.00006649708,0.00010381943,0.0000072029575],"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.000079603094,0.00027571336,0.000032793825,0.00002741345,0.00003547786,0.000007682752,0.009045478,0.4112041,0.0021488864,0.008126999,0.0032852448,0.56573063],"study_design_scores_gemma":[0.0007867693,0.00013135141,0.000012438034,0.00001688953,0.0000019071803,0.00016088781,0.00032936485,0.99414,0.00029050087,0.0008477471,0.0031155208,0.00016660106],"about_ca_topic_score_codex":0.00046340932,"about_ca_topic_score_gemma":0.00038620742,"teacher_disagreement_score":0.5829359,"about_ca_system_score_codex":0.000103896346,"about_ca_system_score_gemma":0.000090459,"threshold_uncertainty_score":0.4851839},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068101627,0.006413532,0.9799402,0.0025037744,0.0035310574,0.00043561062,0.000042581054,0.00006156318,0.0002615531],"genre_scores_gemma":[0.995033,0.0016303831,0.0019573201,0.00040365386,0.0007273991,0.00003286461,0.00009733011,0.00001886181,0.00009914908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685585,0.00072662253,0.0014982605,0.00022494304,0.00041540593,0.00027893667],"domain_scores_gemma":[0.99392945,0.0012562741,0.0014721898,0.001073464,0.0021235703,0.00014506147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021360759,0.00022578561,0.00048402394,0.0002164769,0.0005434991,0.0006811169,0.0030146674,0.00016216033,0.0000015039939],"category_scores_gemma":[0.00012423725,0.0001979987,0.00020605064,0.00024828027,0.00015754452,0.00067770114,0.00051504927,0.00037703195,0.000003307115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021591851,0.00037001295,0.0036687476,0.000070268936,0.0008638884,0.00002238158,0.0017995767,0.76075715,0.000082003055,0.17008266,0.059062712,0.0030046839],"study_design_scores_gemma":[0.0012278105,0.00009019601,0.0005577148,0.00050998066,0.00001777179,0.0015303508,0.00034628413,0.928074,0.0000047537947,0.00013726468,0.0672999,0.00020394812],"about_ca_topic_score_codex":0.000069078415,"about_ca_topic_score_gemma":0.000007826802,"teacher_disagreement_score":0.9882229,"about_ca_system_score_codex":0.00016379873,"about_ca_system_score_gemma":0.000086945205,"threshold_uncertainty_score":0.80741525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043241103,0.00003900463,0.996113,0.001687483,0.0005230892,0.00060571847,0.0000041217777,0.00017024361,0.00042494],"genre_scores_gemma":[0.7178422,0.00005009857,0.2798817,0.001490108,0.00015015418,0.00028577185,0.000007847389,0.000023786919,0.000268312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892974,0.00007742466,0.00022639555,0.00039143584,0.0001248672,0.0002501602],"domain_scores_gemma":[0.99901384,0.00030076512,0.00007358527,0.00043378895,0.0000923129,0.00008568709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012973175,0.00018322207,0.00016120957,0.00013879717,0.0004689548,0.00030986647,0.0003345891,0.000116018244,0.000044079126],"category_scores_gemma":[0.000016462565,0.0001534899,0.000082997205,0.0002634289,0.00002532036,0.00029163808,0.000008722585,0.00021116743,0.0000073732253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001680498,0.000029913303,0.000004199663,0.000006031085,0.0000222381,2.586746e-7,0.0003139764,0.9143949,0.000030919146,0.0009508112,0.0002875598,0.08394235],"study_design_scores_gemma":[0.00040514948,0.00032112355,0.000025845466,0.000046594338,0.000011086137,0.000014217307,0.000044899,0.9952127,0.000534357,0.0021872364,0.0009971092,0.00019971479],"about_ca_topic_score_codex":0.000014948743,"about_ca_topic_score_gemma":0.000021712263,"teacher_disagreement_score":0.7174098,"about_ca_system_score_codex":0.000024510595,"about_ca_system_score_gemma":0.000017114657,"threshold_uncertainty_score":0.6259137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70704865,0.00008151366,0.2679227,0.0003571041,0.0015203828,0.000286052,2.5961083e-7,0.0000717207,0.022711597],"genre_scores_gemma":[0.99473697,8.740882e-7,0.0037493224,0.00078603905,0.00060978124,0.000028908993,5.374438e-7,0.000005664445,0.00008189892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870425,0.00010990082,0.00022585638,0.0001673893,0.00049161765,0.00030096402],"domain_scores_gemma":[0.99918395,0.00008177415,0.00007540474,0.00042468385,0.00014381022,0.00009038756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017831029,0.0000980621,0.00012635863,0.00009819165,0.000080077596,0.000030925577,0.00036104833,0.000044223536,0.0000537587],"category_scores_gemma":[0.000029799825,0.000072561605,0.000051290684,0.00034962367,0.000012812656,0.00013643036,0.00008517565,0.00008244743,0.00007947708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029466313,0.00010121643,0.053258177,0.000019323568,0.00004744248,1.7195244e-7,0.0015171353,0.553358,0.00026072373,0.050319653,0.022791518,0.31829715],"study_design_scores_gemma":[0.00018594413,0.00017623625,0.07925419,0.00005566794,0.000007195011,0.000009049099,0.00000870602,0.91645956,0.000992988,0.0008620887,0.0018492724,0.0001390826],"about_ca_topic_score_codex":0.000024057024,"about_ca_topic_score_gemma":0.000043568405,"teacher_disagreement_score":0.36310157,"about_ca_system_score_codex":0.000032372667,"about_ca_system_score_gemma":0.00001858858,"threshold_uncertainty_score":0.29589763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67068154,0.00008194784,0.3083146,0.0043856716,0.00043514997,0.0005952506,1.3134338e-7,0.00025135672,0.015254337],"genre_scores_gemma":[0.99359,6.390909e-7,0.0033793633,0.0004400149,0.00013477386,0.000049522023,3.1188392e-7,0.0000072539724,0.002398152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990147,0.00007319882,0.00019418466,0.00025912304,0.00017974293,0.0002790538],"domain_scores_gemma":[0.9993828,0.00009766164,0.000045664558,0.00032850332,0.000102882856,0.000042481417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030382563,0.00010986265,0.00012963674,0.000058785594,0.000111496156,0.00035902634,0.0005907193,0.000040103932,0.00008434971],"category_scores_gemma":[0.00000892806,0.000056385205,0.00002982288,0.00043040773,0.000021529464,0.0004396184,0.000099225246,0.00014129226,0.00017812125],"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.00006170813,0.00070215325,0.037954833,0.00034571855,0.00024976116,0.0001339051,0.067618966,0.0884404,0.005587204,0.4558372,0.266985,0.076083146],"study_design_scores_gemma":[0.00044250197,0.00012595617,0.0037910782,0.000070335824,0.000002070759,0.000086980486,0.0012228944,0.989401,0.00057002116,0.00049515924,0.0035341873,0.00025783855],"about_ca_topic_score_codex":0.00060489995,"about_ca_topic_score_gemma":0.00038629808,"teacher_disagreement_score":0.90096056,"about_ca_system_score_codex":0.000027673612,"about_ca_system_score_gemma":0.000032898348,"threshold_uncertainty_score":0.34620994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006442993,0.00024184471,0.9903039,0.00038105654,0.0014730295,0.0004013611,5.247347e-7,0.0005221456,0.00023314814],"genre_scores_gemma":[0.7874097,0.000023054983,0.21154979,0.00053564686,0.00036504716,0.00004627635,0.0000030017463,0.00003450369,0.000032981185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979096,0.00013474694,0.00047366586,0.0004976358,0.0002634465,0.0007208977],"domain_scores_gemma":[0.99777603,0.000589391,0.00012096795,0.0011499606,0.00013203635,0.00023162343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027046938,0.00032552425,0.0004283485,0.00025499842,0.00028328007,0.00037778926,0.001536164,0.00013288848,0.0000068428267],"category_scores_gemma":[0.00003569194,0.00030723677,0.00017885737,0.0009837806,0.00002935107,0.00031232502,0.00012498967,0.00056909083,0.00007100107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014710903,0.0002515141,0.000031751704,0.000014367026,0.00010618425,0.000009426817,0.00019741451,0.9456005,0.018056482,0.012554399,0.0018093882,0.021353867],"study_design_scores_gemma":[0.0006841182,0.00015612102,0.00010999973,0.00015300645,0.000005780802,0.00003554159,0.0000021927149,0.9968921,0.0004851486,0.00003051548,0.0010985679,0.00034689408],"about_ca_topic_score_codex":0.00004674139,"about_ca_topic_score_gemma":7.7888956e-7,"teacher_disagreement_score":0.7809667,"about_ca_system_score_codex":0.00019965248,"about_ca_system_score_gemma":0.000034517103,"threshold_uncertainty_score":0.99993795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01277688,0.00020145501,0.9816889,0.000040917726,0.0008588941,0.0035851286,0.0001139749,0.00067238987,0.00006146341],"genre_scores_gemma":[0.8911173,0.0000035819214,0.10512126,0.00006922821,0.00018075308,0.003014399,0.00003723174,0.000052026033,0.00040422837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695176,0.0004655019,0.0010620232,0.0005990828,0.00046768787,0.00045393442],"domain_scores_gemma":[0.9956031,0.002254907,0.0007306433,0.00062989176,0.0006807604,0.000100717414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013323482,0.00033741217,0.00067478255,0.00028683894,0.00039182312,0.00017820155,0.00071116764,0.00021391586,0.0000050540552],"category_scores_gemma":[0.00087071664,0.00030069047,0.00034026458,0.00028160273,0.00005261172,0.00031414346,0.000039001145,0.00009135277,0.000014040031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005530361,0.00041597942,0.0004950049,0.0038167886,0.00062420324,0.000017156102,0.019467225,0.9036425,0.008710549,0.006326392,0.034579743,0.021351436],"study_design_scores_gemma":[0.00090842554,0.0002735801,0.00005002455,0.00024795654,0.00002157749,0.00024708707,0.00010854147,0.95627475,0.038255576,0.00024044137,0.0029818516,0.00039016496],"about_ca_topic_score_codex":0.000026700543,"about_ca_topic_score_gemma":0.0000048076768,"teacher_disagreement_score":0.8783404,"about_ca_system_score_codex":0.00009172696,"about_ca_system_score_gemma":0.00019338813,"threshold_uncertainty_score":0.9999445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007767456,0.000036814567,0.9871349,0.0010095421,0.0005232176,0.00016186739,3.2550037e-7,0.00015394432,0.0032119572],"genre_scores_gemma":[0.9766373,0.0000013828253,0.022062138,0.00016025266,0.00001880439,0.000008054667,0.000009844459,0.0000053449935,0.0010969026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995557,0.00003528038,0.00012559866,0.00011469179,0.000084777545,0.00008395587],"domain_scores_gemma":[0.99919814,0.00003640517,0.000046548106,0.00035559078,0.00032170545,0.000041608375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003018527,0.000043605552,0.000055112137,0.00003423894,0.00008780568,0.00011088994,0.00035886533,0.000030962234,0.0000067059686],"category_scores_gemma":[0.00004403811,0.000036683683,0.00001666938,0.00021982925,0.0000073423785,0.00010949526,0.00007980975,0.000025998705,0.000057955],"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.0000058018477,0.00011429672,0.00022073614,0.000012476764,0.000015959366,3.3064677e-7,0.002504827,0.05498429,0.00024552425,0.90783614,0.026431698,0.0076279184],"study_design_scores_gemma":[0.00019842215,0.000035687553,0.00007440881,0.0000062222084,0.000001170851,0.0000071183676,0.00009973719,0.99244016,0.00016642656,0.0008216375,0.0060909544,0.000058069865],"about_ca_topic_score_codex":0.000020897487,"about_ca_topic_score_gemma":0.000021793423,"teacher_disagreement_score":0.9688698,"about_ca_system_score_codex":0.00006425707,"about_ca_system_score_gemma":0.00002383822,"threshold_uncertainty_score":0.14959171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11432248,0.0000744085,0.8809024,0.00004990401,0.0002665512,0.0002870006,7.702426e-7,0.000024263241,0.0040721865],"genre_scores_gemma":[0.98731124,0.0000016403912,0.012292594,0.00006503838,0.000014836496,0.00003950756,0.000003960795,0.000002896159,0.00026826444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920857,0.00002123117,0.00020355824,0.00015213432,0.00025849466,0.00015602777],"domain_scores_gemma":[0.9994513,0.000048530448,0.000093672235,0.00023443784,0.00013478757,0.00003731446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015816437,0.00006732935,0.00013400882,0.0002058587,0.00005630905,0.00003909213,0.00013339412,0.000031192896,0.00005688323],"category_scores_gemma":[0.0000060309385,0.0000510197,0.00008644665,0.00035663176,0.000009612252,0.0003197921,0.000043372005,0.00002045559,0.0000030288277],"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.00007276773,0.0005260547,0.077969715,0.00036918028,0.0043091583,9.234282e-7,0.0046158032,0.040763035,0.00049105927,0.6188572,0.0018517274,0.25017336],"study_design_scores_gemma":[0.0003399595,0.00003279216,0.019309428,0.000012324489,0.00015481855,6.7070056e-7,0.00014784405,0.9787496,0.000077093835,0.0009724459,0.00012918843,0.00007388787],"about_ca_topic_score_codex":0.000021094565,"about_ca_topic_score_gemma":0.000062062856,"teacher_disagreement_score":0.9379865,"about_ca_system_score_codex":0.00004319375,"about_ca_system_score_gemma":0.0000074337554,"threshold_uncertainty_score":0.20805229},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025666552,0.000040378913,0.9636907,0.0015073074,0.0046899486,0.0003639466,8.677967e-7,0.00011864158,0.0039216494],"genre_scores_gemma":[0.9926697,0.0000066027965,0.0016063363,0.00319613,0.0007959269,0.00008166147,9.295299e-7,0.000013494699,0.0016292167],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989442,0.00013207573,0.00020021976,0.0002956821,0.000076679025,0.0003511155],"domain_scores_gemma":[0.9984716,0.00075852656,0.000088714245,0.0005617571,0.00005934097,0.00006005609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007599163,0.00013218484,0.00013135413,0.000029174613,0.000427958,0.00038199767,0.00042433204,0.00007902199,0.0000028146546],"category_scores_gemma":[0.00003525489,0.000087552704,0.00011483718,0.00010626464,0.000016145887,0.00007305355,0.00002789319,0.00017742475,0.000039928014],"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.00026411447,0.00018010994,0.000017650653,0.00003907662,0.000110845605,0.00015847462,0.0016018632,0.12475836,0.001973353,0.21624535,0.34080637,0.3138444],"study_design_scores_gemma":[0.0005026881,0.00075228506,0.0000032078829,0.00005892932,0.0000046034243,0.00023020062,0.000043182485,0.8271095,0.0074846763,0.0019779785,0.16162355,0.00020919954],"about_ca_topic_score_codex":0.000044067263,"about_ca_topic_score_gemma":0.00017446055,"teacher_disagreement_score":0.96700317,"about_ca_system_score_codex":0.000021126583,"about_ca_system_score_gemma":0.000011134771,"threshold_uncertainty_score":0.36836123},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94110864,0.00009086532,0.055777464,0.00008289161,0.0026164877,0.00014543295,4.3920065e-7,0.0000084388475,0.00016933017],"genre_scores_gemma":[0.9994022,0.000016111448,0.00010235121,0.00007999404,0.00037419962,0.0000018093236,8.6052594e-8,0.0000057053694,0.000017544346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846303,0.00015826467,0.0007218741,0.00012781814,0.0003731662,0.00015586884],"domain_scores_gemma":[0.9978752,0.00049108727,0.000995461,0.0002746642,0.00029646436,0.00006708999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013035845,0.000119990334,0.00032432599,0.00012776864,0.000106776846,0.00007868091,0.00050959917,0.000076667515,9.4306705e-7],"category_scores_gemma":[0.000022254462,0.000075580734,0.00009371917,0.00024738663,0.000058193356,0.00025198015,0.000027682427,0.00032874817,0.0000015229285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012705044,0.000031399064,0.0011858534,0.00004517783,0.00003860586,0.0000026462194,0.0005952342,0.9659273,0.0006992348,0.025787106,0.0006003221,0.0050744102],"study_design_scores_gemma":[0.0004220807,0.0013951312,0.016209457,0.0011297829,0.0000119911665,0.0004047302,0.00006275117,0.97945154,0.00020285396,0.000057357505,0.0005175275,0.00013477741],"about_ca_topic_score_codex":0.0000061309265,"about_ca_topic_score_gemma":0.000001539273,"teacher_disagreement_score":0.058293547,"about_ca_system_score_codex":0.000014631676,"about_ca_system_score_gemma":0.00005412809,"threshold_uncertainty_score":0.3082093},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002882316,0.00006943602,0.99414605,0.0006720428,0.00009885665,0.0012746764,0.000006143376,0.00017244273,0.0006780651],"genre_scores_gemma":[0.44731063,0.000002965423,0.5514198,0.00022168347,0.000068986155,0.00092033384,0.000004405696,0.000012391264,0.000038804304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848604,0.000028321312,0.0005014399,0.00036427754,0.00032528603,0.0002946362],"domain_scores_gemma":[0.9984205,0.00019681036,0.00021097584,0.0007799215,0.00023875904,0.00015308349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026923735,0.00018012921,0.0002912205,0.00019151882,0.00027682845,0.00006973756,0.0006244018,0.000050100218,0.000005458133],"category_scores_gemma":[0.0000057838424,0.00014883518,0.00009580103,0.0006133901,0.00005259468,0.00016386696,0.00018754583,0.00010452682,0.00007352659],"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.0000028981826,0.0003873966,0.000026276286,0.00007274127,0.00007775743,0.000001187664,0.0021353029,0.06013383,0.0013189005,0.90943944,0.0021302614,0.024273984],"study_design_scores_gemma":[0.0003130216,0.0000628369,0.00007542947,0.00018697679,0.000019792891,0.00010418175,0.00015510533,0.9728129,0.00043842982,0.00426765,0.021284482,0.00027918862],"about_ca_topic_score_codex":0.000011320346,"about_ca_topic_score_gemma":0.000016686714,"teacher_disagreement_score":0.9126791,"about_ca_system_score_codex":0.000049703936,"about_ca_system_score_gemma":0.000053061827,"threshold_uncertainty_score":0.6069323},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16632938,0.00033837106,0.83190316,0.00025531033,0.0008319544,0.00013182306,8.756947e-7,0.00003305097,0.00017609017],"genre_scores_gemma":[0.9480383,0.000031113363,0.05141767,0.00013149936,0.0003430323,0.000001533918,9.560044e-7,0.000016162212,0.000019763533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980289,0.00010514503,0.00076672283,0.00027674896,0.00039639458,0.0004261366],"domain_scores_gemma":[0.9986552,0.00009170018,0.0005952312,0.00029412052,0.00021231831,0.00015144401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068469136,0.00021609677,0.00044357008,0.00022831767,0.00012316646,0.00015273302,0.0007150157,0.00010948749,0.000002967213],"category_scores_gemma":[0.000019933786,0.00015763566,0.0001369643,0.00053648883,0.000049559716,0.00061426364,0.00012214846,0.0005696614,0.000005056767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044553126,0.00011263213,0.0011789153,0.000013768951,0.00006568429,0.0005451658,0.0012150846,0.9708643,0.00005679506,0.0005301933,0.000029443874,0.02534345],"study_design_scores_gemma":[0.0021470867,0.0007171369,0.006706857,0.000470817,0.000009346085,0.0016633952,0.0001860897,0.9874739,0.000054753422,0.00023921627,0.00008031199,0.00025106748],"about_ca_topic_score_codex":0.00018583302,"about_ca_topic_score_gemma":0.00026803432,"teacher_disagreement_score":0.7817089,"about_ca_system_score_codex":0.00032262996,"about_ca_system_score_gemma":0.00013533795,"threshold_uncertainty_score":0.6428196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008381927,0.00095533207,0.96874934,0.0009820977,0.020532489,0.00023199314,0.000076126045,0.00002838131,0.000062305975],"genre_scores_gemma":[0.98368245,0.00040860721,0.0116290515,0.0001521694,0.003796772,0.00009010479,0.000057501322,0.00001434042,0.00016902476],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981277,0.000073224335,0.00087612745,0.00022705617,0.00044883083,0.00024704658],"domain_scores_gemma":[0.9977356,0.00014188568,0.00061781675,0.0001888872,0.0011143846,0.00020143374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007266063,0.00017788733,0.00032006737,0.0001446821,0.00011127139,0.0003938101,0.0008651753,0.00012764582,0.000021417305],"category_scores_gemma":[0.000064073836,0.00014466868,0.0002402383,0.00013221453,0.000030710013,0.000439929,0.00009536293,0.00023661624,0.0000026325665],"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.00029034313,0.0008453866,0.016081601,0.00007429843,0.0026175454,0.00031241507,0.00080990355,0.18571714,0.0015877169,0.17486365,0.4886764,0.1281236],"study_design_scores_gemma":[0.0012815525,0.00010785631,0.00038081245,0.000057125053,0.000020023992,0.00040630897,0.000063434156,0.8264494,0.000035503035,0.0003421861,0.17066541,0.00019036245],"about_ca_topic_score_codex":0.00006952495,"about_ca_topic_score_gemma":0.000023776804,"teacher_disagreement_score":0.9753005,"about_ca_system_score_codex":0.000041736526,"about_ca_system_score_gemma":0.000052331365,"threshold_uncertainty_score":0.58994174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008967653,0.0004627799,0.9877056,0.0019687186,0.00057483505,0.00014892548,0.0000082501465,0.000023303726,0.00013995568],"genre_scores_gemma":[0.95938975,0.00003838552,0.039708387,0.00037508228,0.00044080385,0.0000031525578,0.0000028880318,0.000005877851,0.000035670982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988597,0.00010557338,0.00046876597,0.00015066634,0.00019987959,0.00021543878],"domain_scores_gemma":[0.99873775,0.00040427662,0.00042727136,0.00014873936,0.00020161674,0.00008036027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006396088,0.00012552275,0.00021851667,0.00008032686,0.00028266245,0.00022535789,0.00035479912,0.000053554177,0.000008357305],"category_scores_gemma":[0.00004649418,0.0000788988,0.00015873427,0.00019411699,0.000026399823,0.00019259742,0.000055405686,0.00020162901,0.0000028887496],"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.00022970277,0.0007971413,0.001422921,0.00010171277,0.0007950503,0.0001220553,0.007572672,0.06151022,0.00015287031,0.26184937,0.17746341,0.48798287],"study_design_scores_gemma":[0.00070064794,0.00034126625,0.0004988569,0.00009304513,0.000009997541,0.00013212908,0.00019902365,0.9902954,0.000002906065,0.0029356023,0.0046877675,0.00010333126],"about_ca_topic_score_codex":0.0000064020896,"about_ca_topic_score_gemma":0.0000018940464,"teacher_disagreement_score":0.9504221,"about_ca_system_score_codex":0.000024501589,"about_ca_system_score_gemma":0.000008573087,"threshold_uncertainty_score":0.32174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022551245,0.00008298482,0.9804291,0.0003576234,0.0010207108,0.00008945548,5.717992e-8,0.000085530206,0.015679378],"genre_scores_gemma":[0.95544785,0.000010404218,0.04091872,0.00064223976,0.0005382779,0.000004842151,2.9554354e-7,0.0000060526686,0.002431341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909985,0.000076104814,0.00020573016,0.00028202962,0.00009811804,0.00023817911],"domain_scores_gemma":[0.99945194,0.000105469204,0.00003549021,0.00026642776,0.000026121868,0.00011455545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036903247,0.00009725552,0.0001500488,0.000056154833,0.000048108664,0.00017306418,0.00024656524,0.00005263274,0.000027987797],"category_scores_gemma":[0.000015579824,0.00007900366,0.000025023017,0.00017208527,0.000015047714,0.00022154531,0.00012567917,0.00010763251,0.000022015478],"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.0000082917295,0.00005352243,0.0047688414,0.000007773029,0.000018924859,0.000015718984,0.00074663037,0.011726238,0.000031886255,0.3663631,0.014423457,0.6018356],"study_design_scores_gemma":[0.00045922396,0.000044236996,0.0009909965,0.000017606133,8.8811885e-7,0.000023722354,0.000027725855,0.9884719,0.000010003667,0.00038317594,0.009459176,0.00011131967],"about_ca_topic_score_codex":0.0009936851,"about_ca_topic_score_gemma":0.0007435139,"teacher_disagreement_score":0.97674567,"about_ca_system_score_codex":0.000026835622,"about_ca_system_score_gemma":0.000011840146,"threshold_uncertainty_score":0.32216758},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013436988,0.000057070793,0.8907582,0.000055571658,0.0002468327,0.00023896593,0.0000011459913,0.00005918158,0.09514605],"genre_scores_gemma":[0.987301,0.00001176959,0.012398307,0.000034590958,0.000018893943,0.000037268655,3.097535e-7,0.000008422503,0.00018942296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905986,0.000038327224,0.00031586023,0.00016868272,0.00021345183,0.00020381408],"domain_scores_gemma":[0.99865794,0.00042450547,0.00019134374,0.00063502183,0.00004952113,0.000041667146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066726055,0.00011308402,0.00019484102,0.00003082423,0.00018791152,0.00010261679,0.00044931532,0.00004511295,0.000007405341],"category_scores_gemma":[0.000058895796,0.00007102802,0.00009116391,0.00023966252,0.00006060461,0.00007387193,0.00006276827,0.00009268033,0.000017466064],"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.0000012549774,0.000025476505,0.000009952264,0.000025351294,0.000020563391,5.281362e-7,0.00091160147,0.00009122962,0.0005723308,0.9974039,0.00029038312,0.00064738083],"study_design_scores_gemma":[0.0009430098,0.00012725941,0.00013180211,0.00010891653,0.000027747581,0.00006907619,0.0021711288,0.11662875,0.028378757,0.8222882,0.028477365,0.00064799166],"about_ca_topic_score_codex":0.000003066128,"about_ca_topic_score_gemma":0.000008093146,"teacher_disagreement_score":0.973864,"about_ca_system_score_codex":0.00001242854,"about_ca_system_score_gemma":0.000021265187,"threshold_uncertainty_score":0.28964385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020035272,8.3534707e-7,0.9011824,0.0007450002,0.001221872,0.023461888,2.9259365e-7,0.0003101957,0.071073994],"genre_scores_gemma":[0.96703535,3.4092547e-8,0.0036741262,0.0006496393,0.00023002128,0.02566557,7.056804e-8,0.0000035595633,0.0027416495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942654,0.000031244752,0.00013324874,0.0001646619,0.00010729224,0.00013703489],"domain_scores_gemma":[0.99947834,0.000047013687,0.000036869824,0.00031117653,0.00007736389,0.00004925717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024020486,0.00006180013,0.000080043035,0.00003188705,0.00007080126,0.00015403712,0.00038803674,0.00004898309,0.00022034044],"category_scores_gemma":[0.000010201171,0.000043681808,0.00004289351,0.000079201134,0.000013533169,0.00025943748,0.000044510918,0.00012338252,0.00015657727],"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.000013586368,0.00007080324,0.0014225722,0.000014124011,0.000024834611,0.000014591024,0.0001342583,0.00008524707,0.011613433,0.9006989,0.057391927,0.028515719],"study_design_scores_gemma":[0.0014773619,0.00012516948,0.0012474165,0.0000125927445,0.0000020452455,0.0000744876,0.000015846534,0.3677181,0.0042335587,0.0020825434,0.62273926,0.0002715874],"about_ca_topic_score_codex":0.00004632324,"about_ca_topic_score_gemma":0.00007565156,"teacher_disagreement_score":0.9650318,"about_ca_system_score_codex":0.0000044863373,"about_ca_system_score_gemma":0.000019954447,"threshold_uncertainty_score":0.24125734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007866198,0.00011617643,0.9590639,0.00059702905,0.0014811849,0.00019890796,1.01457765e-7,0.00028431905,0.030392189],"genre_scores_gemma":[0.994677,0.000008616778,0.0016833532,0.0010775712,0.00021575866,0.00004183367,7.1816265e-7,0.0000062935073,0.0022888375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897516,0.000050359,0.00023762525,0.00027877837,0.00015352444,0.00030454542],"domain_scores_gemma":[0.999248,0.00004590055,0.000050681592,0.00045678558,0.00009368107,0.00010494391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015128934,0.000112478454,0.0001428609,0.000059106995,0.00010937397,0.0003658216,0.0005194378,0.00006627808,0.00024097707],"category_scores_gemma":[0.000003963675,0.000081048645,0.000095242074,0.00025480796,0.000016555601,0.00042679644,0.00009398401,0.00010765514,0.00045829077],"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.0000031109203,0.00014132517,0.004112105,0.000018133953,0.00011294906,0.000036172343,0.0008041464,0.0379445,0.0004422779,0.59911114,0.2699763,0.08729788],"study_design_scores_gemma":[0.000118269825,0.000028485454,0.0021532092,0.00001394727,0.0000010965865,0.00004574487,0.000036051475,0.9867718,0.000028896777,0.001242249,0.009412405,0.00014783912],"about_ca_topic_score_codex":0.00034747313,"about_ca_topic_score_gemma":0.000028950088,"teacher_disagreement_score":0.9868108,"about_ca_system_score_codex":0.00001567011,"about_ca_system_score_gemma":0.000009883116,"threshold_uncertainty_score":0.58905536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020228108,0.00020434805,0.9486355,0.00046172418,0.00046643315,0.00016663382,0.0000019159459,0.00007335188,0.029761996],"genre_scores_gemma":[0.9958969,0.000027774613,0.0030628443,0.00003411157,0.000037325484,0.000010708768,1.4712306e-7,0.000005762641,0.00092447945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992003,0.0000566864,0.00026705634,0.00012292137,0.0001937881,0.00015927576],"domain_scores_gemma":[0.99886197,0.00034736766,0.00015434119,0.0005420526,0.00006112294,0.00003315839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039037937,0.000083679006,0.00014982007,0.000029432724,0.00016174234,0.000103397884,0.0005029459,0.000033072953,0.000023968687],"category_scores_gemma":[0.00007045364,0.000050635634,0.00010372482,0.00020319961,0.000051748077,0.00012372689,0.000090986396,0.00007541993,0.00003398936],"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":[8.4829134e-7,0.000051596566,0.000048487236,0.000043228905,0.000033133103,0.000002682329,0.0037393179,0.00016861188,0.000098258126,0.98983747,0.0030562924,0.0029200525],"study_design_scores_gemma":[0.00017742575,0.00007038449,0.000061893676,0.00006528137,0.000005703112,0.00003604017,0.00028289476,0.93291503,0.0006409626,0.061289176,0.0043098168,0.0001453978],"about_ca_topic_score_codex":0.0000061810015,"about_ca_topic_score_gemma":0.000009624955,"teacher_disagreement_score":0.9756687,"about_ca_system_score_codex":0.0000096355825,"about_ca_system_score_gemma":0.0000037045395,"threshold_uncertainty_score":0.20648612},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073005386,0.017214173,0.88419855,0.00635623,0.009091821,0.00027362772,0.000004202912,0.00012460824,0.00973141],"genre_scores_gemma":[0.99499744,0.0011884194,0.002350793,0.00042934282,0.000706088,0.000007329706,0.0000033448055,0.000009849135,0.00030740906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762607,0.0005537179,0.0008654482,0.00013199348,0.0006884758,0.0001343189],"domain_scores_gemma":[0.99697644,0.00016892896,0.00079621235,0.0007848228,0.0011660005,0.00010760965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012730667,0.00011947552,0.00023433361,0.00029673535,0.00008869115,0.00056920527,0.0033901786,0.00006581535,0.000024119434],"category_scores_gemma":[0.000047702782,0.00009730521,0.00014637414,0.00019293184,0.000028244076,0.0008018225,0.0001894149,0.000258291,0.00003045773],"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.00019792168,0.0006310863,0.006793023,0.00001683653,0.00085042923,0.00020143102,0.008528137,0.09356143,0.00045297714,0.7557945,0.010050729,0.122921474],"study_design_scores_gemma":[0.0014236812,0.0003185713,0.005310903,0.0009169529,0.0000168797,0.006340239,0.0006716317,0.21898787,0.00007931488,0.005993942,0.75954497,0.0003950152],"about_ca_topic_score_codex":0.00011183514,"about_ca_topic_score_gemma":0.000029887766,"teacher_disagreement_score":0.92199206,"about_ca_system_score_codex":0.000118477816,"about_ca_system_score_gemma":0.00006625522,"threshold_uncertainty_score":0.62998515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026450104,0.000025688974,0.9945299,0.0002341478,0.00028462903,0.00020149756,0.0000010124984,0.000046602603,0.002031522],"genre_scores_gemma":[0.3871732,0.0000014783809,0.6114492,0.00010871041,0.0001368291,0.000009648857,0.0000014742758,0.0000029599016,0.0011165268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993313,0.00008541403,0.00021805939,0.0001758874,0.000100251906,0.000089119734],"domain_scores_gemma":[0.99941486,0.00018284249,0.00007562344,0.00016260565,0.00013195013,0.000032109714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016076752,0.00005340431,0.00014282782,0.00003579617,0.00007955547,0.000019290235,0.00014798844,0.000033433564,0.000012280651],"category_scores_gemma":[0.000014600491,0.00004521963,0.00008644798,0.00015820583,0.0000062565637,0.00016876688,0.000013837923,0.000030466374,0.000001046911],"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.00012134966,0.00012777656,0.0011220278,0.0000933169,0.00026406295,0.000015325342,0.034285598,0.12559861,0.18654042,0.4199967,0.114666775,0.11716803],"study_design_scores_gemma":[0.00042022186,0.00007436193,0.00014879114,0.000010001843,0.0000029173868,0.000029474477,0.00008518413,0.9488352,0.049187303,0.0004645534,0.00068140175,0.000060616727],"about_ca_topic_score_codex":0.00032319222,"about_ca_topic_score_gemma":0.0000351065,"teacher_disagreement_score":0.8232366,"about_ca_system_score_codex":0.0000068748873,"about_ca_system_score_gemma":0.000034163237,"threshold_uncertainty_score":0.18440029},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022828456,0.000030798463,0.9020661,0.0009782615,0.0030368112,0.0001382146,1.2159632e-7,0.0002700678,0.09119676],"genre_scores_gemma":[0.9893925,0.00000724113,0.0019962313,0.0026746213,0.0014550495,0.00001667177,9.553073e-7,0.000011356014,0.0044453735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985515,0.00019141535,0.0003062466,0.0003898561,0.00021674327,0.00034422363],"domain_scores_gemma":[0.9986833,0.00037072267,0.00007844338,0.0006758831,0.0000646968,0.00012697572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078767707,0.00015961537,0.00024142394,0.00007208837,0.00016585433,0.0002652798,0.0006685175,0.00010587622,0.00009423228],"category_scores_gemma":[0.000038541257,0.000117400836,0.00013174552,0.00022317271,0.000023891946,0.00019749654,0.00009194925,0.0001953963,0.00043398637],"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.000057365825,0.00006315861,0.00019565146,0.000011356714,0.000039169703,0.000007843767,0.00021253333,0.08506657,0.00004100642,0.77180135,0.067258,0.075245984],"study_design_scores_gemma":[0.0009592461,0.00011763099,0.000113619455,0.00003808626,0.0000018969289,0.000016637305,0.0000054558996,0.95871794,0.000117912525,0.0016402665,0.038093086,0.00017820147],"about_ca_topic_score_codex":0.00003086466,"about_ca_topic_score_gemma":0.000031908447,"teacher_disagreement_score":0.98710966,"about_ca_system_score_codex":0.000024239915,"about_ca_system_score_gemma":0.000012832634,"threshold_uncertainty_score":0.55781615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070350314,0.00007265113,0.9953265,0.00052824616,0.000043050695,0.00056170323,0.000011067942,0.000085109605,0.0026681258],"genre_scores_gemma":[0.17279342,0.000012340449,0.8244715,0.000094742456,0.00031007943,0.001314475,0.000018616309,0.000022760449,0.000962077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992905,0.000012343192,0.00017326756,0.00021858202,0.00014256914,0.00016269815],"domain_scores_gemma":[0.9992511,0.000091689326,0.00007804179,0.00031588424,0.00014551092,0.00011777592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033097292,0.00009769316,0.00014022482,0.000036871512,0.00021543592,0.00025832764,0.00023041063,0.000030902662,0.0000010156604],"category_scores_gemma":[0.000012405731,0.00007108777,0.000029215642,0.00015221602,0.00004478745,0.00018784699,0.0000758306,0.00005967252,0.000005029799],"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.0000015112616,0.000030063457,0.000018537368,0.000045943463,0.000015573032,2.8207376e-7,0.0014170653,0.00012272595,0.000012133648,0.9887143,0.0002603959,0.009361515],"study_design_scores_gemma":[0.0004150372,0.00012530238,0.00002215687,0.00003892995,0.000012731642,0.000046825215,0.001616667,0.79869556,0.00012721529,0.14252391,0.05614993,0.00022573114],"about_ca_topic_score_codex":0.00003247985,"about_ca_topic_score_gemma":0.00001743347,"teacher_disagreement_score":0.84619033,"about_ca_system_score_codex":0.00001585984,"about_ca_system_score_gemma":0.00003596693,"threshold_uncertainty_score":0.28988752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013893173,0.000003838497,0.975325,0.00033302722,0.0005582494,0.0002837165,0.0000026270222,0.00009667661,0.009503706],"genre_scores_gemma":[0.88396025,2.71744e-7,0.11355811,0.0004861621,0.00024911223,0.000055656063,0.0000011234829,0.000012637347,0.0016766936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985168,0.000030557738,0.0004096578,0.00046119434,0.00016989768,0.000411877],"domain_scores_gemma":[0.9991412,0.00020382674,0.00012358322,0.00032365948,0.00013120922,0.000076489276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072334555,0.00016604472,0.00025872616,0.000114716306,0.00010006117,0.00014897416,0.00053296104,0.000104138744,0.0000032614444],"category_scores_gemma":[0.00004231805,0.00014090429,0.000106268955,0.00021590947,0.000017952152,0.0003994788,0.00015609953,0.00013331923,0.00001963125],"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.000109191664,0.00021625408,0.00037498714,0.000028219545,0.0000356425,0.0000029424166,0.0067151324,0.07914523,0.0038669093,0.89004946,0.0052718464,0.014184161],"study_design_scores_gemma":[0.00071537326,0.00020400871,0.00022607141,0.000038894384,0.0000023314888,0.000010309328,0.0001271385,0.9970804,0.00026575683,0.0007187947,0.00040876586,0.00020215366],"about_ca_topic_score_codex":0.00019408179,"about_ca_topic_score_gemma":0.0003997254,"teacher_disagreement_score":0.9179352,"about_ca_system_score_codex":0.00006443802,"about_ca_system_score_gemma":0.000054570908,"threshold_uncertainty_score":0.57459104},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.573552,0.00015041383,0.42595685,0.000075533666,0.00015516528,0.000081823586,4.11638e-7,0.000007825423,0.00001998158],"genre_scores_gemma":[0.98855805,0.000005836348,0.011161078,0.0000199158,0.00022413388,0.0000025608028,6.9082496e-8,0.000010673108,0.000017658662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875015,0.00008825053,0.00046462944,0.0001890884,0.00030648411,0.00020142553],"domain_scores_gemma":[0.999031,0.00012922243,0.00029424916,0.00015360222,0.00026006377,0.000131854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037699947,0.0001554031,0.00034717174,0.00020462292,0.00013346312,0.00035654797,0.0001715278,0.00008061257,0.000004871067],"category_scores_gemma":[0.00002687531,0.000098321834,0.00004445257,0.00014528025,0.000034751185,0.0005351039,0.000053932265,0.00024715945,8.058905e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032225995,0.000010503343,0.00067303836,0.00004543185,0.000051142753,0.000010635614,0.00054580375,0.9967527,0.0002534381,0.000106024905,0.0000087753115,0.001510301],"study_design_scores_gemma":[0.00022233112,0.00028420868,0.000770573,0.0004945648,0.000021964963,0.0018342376,0.00018832226,0.9959967,0.000019140205,0.000018015005,0.000022963462,0.00012695139],"about_ca_topic_score_codex":0.00006734598,"about_ca_topic_score_gemma":0.000001341504,"teacher_disagreement_score":0.4150061,"about_ca_system_score_codex":0.000038310154,"about_ca_system_score_gemma":0.000035420937,"threshold_uncertainty_score":0.4009448},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11319404,0.0000825854,0.804575,0.002149496,0.00077764055,0.00025182115,9.630979e-8,0.00011588389,0.0788534],"genre_scores_gemma":[0.9915777,0.000002505446,0.004507842,0.0014259855,0.00012580222,0.000035248235,2.9070037e-7,0.0000031921356,0.0023214729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991631,0.00010020075,0.00019925486,0.00018119036,0.00014784958,0.00020840496],"domain_scores_gemma":[0.9993947,0.00012956143,0.000037939066,0.0003616215,0.00004877954,0.000027358734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044262566,0.000072365496,0.00007961219,0.0000702625,0.0000876557,0.00029902242,0.0006279782,0.000034418656,0.00011922062],"category_scores_gemma":[0.000020091695,0.00004217606,0.000046487352,0.00038230213,0.000012919963,0.00035080168,0.00007646744,0.00011453085,0.00046925325],"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.0000017704375,0.0001431303,0.010719037,0.00001870865,0.00002433919,0.000010775176,0.019623341,0.0023909358,0.0008468898,0.6003814,0.23342352,0.1324162],"study_design_scores_gemma":[0.00092108443,0.00017186676,0.03741941,0.00015597673,0.000004555593,0.00035173472,0.0032117672,0.6678076,0.0001309205,0.041378763,0.24758436,0.000861957],"about_ca_topic_score_codex":0.0014607181,"about_ca_topic_score_gemma":0.00041322983,"teacher_disagreement_score":0.87838364,"about_ca_system_score_codex":0.000010841825,"about_ca_system_score_gemma":0.000008882192,"threshold_uncertainty_score":0.6031458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020542871,0.00004241311,0.96534586,0.00007469238,0.0005401086,0.000084609535,8.646071e-7,0.00014586489,0.013222738],"genre_scores_gemma":[0.9685862,0.0000010356424,0.030494964,0.00013254609,0.0000621375,0.000008322064,4.1724712e-7,0.000005765627,0.0007086012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990506,0.000047084017,0.00032434968,0.0002098028,0.00020271947,0.00016541721],"domain_scores_gemma":[0.99928653,0.00004345463,0.00006997684,0.00037752284,0.00017055548,0.000051943563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022549866,0.00008606785,0.00017644043,0.000084961954,0.000096939344,0.000024421677,0.00036850615,0.00005247185,0.00001464081],"category_scores_gemma":[0.000008243802,0.000068578796,0.00008804961,0.00019579858,0.000013859877,0.00015772409,0.000047433943,0.000053918866,0.0000373388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014349985,0.00009259463,0.0006689847,0.0001471851,0.000041317548,0.000034491204,0.00093678106,0.80435306,0.00048643525,0.18811934,0.0041997884,0.0009056797],"study_design_scores_gemma":[0.00020788657,0.000029555911,0.000019408173,0.00005655066,0.0000013428574,0.000059836904,0.00005142385,0.998753,0.00055286003,0.000036078036,0.00014541579,0.000086649],"about_ca_topic_score_codex":0.00026799735,"about_ca_topic_score_gemma":0.00003161263,"teacher_disagreement_score":0.94804335,"about_ca_system_score_codex":0.000034467274,"about_ca_system_score_gemma":0.00006871603,"threshold_uncertainty_score":0.2796562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4929255,0.0002920275,0.50602186,0.00018598922,0.00016151514,0.000026126672,9.2811854e-7,0.00001411841,0.00037192705],"genre_scores_gemma":[0.9866602,0.000024577806,0.012980976,0.000055394106,0.00023188638,2.6100918e-7,0.0000011941149,0.0000032969692,0.000042240074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987813,0.000088387525,0.00058079476,0.00014597207,0.0001682406,0.000235299],"domain_scores_gemma":[0.99937433,0.0001155325,0.00023661111,0.000097911055,0.00008281781,0.00009282263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054696924,0.000105797066,0.00025427615,0.000083584164,0.00010716982,0.00017708131,0.00029021356,0.00005143077,0.000016663716],"category_scores_gemma":[0.000029857621,0.000086589396,0.00007596153,0.00025932086,0.000019100533,0.00029891558,0.000057341273,0.00023374075,0.000003354453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047321326,0.000078230034,0.008669943,0.000011472928,0.000028491577,0.00019960958,0.0009466439,0.8666677,0.000047929814,0.001679875,0.0010212928,0.12060153],"study_design_scores_gemma":[0.0009010473,0.00014254947,0.020815097,0.00016810557,0.0000038696403,0.00090200664,0.00018947507,0.97367996,0.0000074899044,0.00022611694,0.0028313878,0.00013292121],"about_ca_topic_score_codex":0.000026217778,"about_ca_topic_score_gemma":0.0000063214175,"teacher_disagreement_score":0.4937347,"about_ca_system_score_codex":0.000033576536,"about_ca_system_score_gemma":0.00002776053,"threshold_uncertainty_score":0.3531013},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71042633,0.000071533155,0.2886598,0.00011785594,0.0001454436,0.00031266076,0.00002814571,0.00005103415,0.00018722647],"genre_scores_gemma":[0.9878261,0.00011713772,0.0111660715,0.000013171946,0.000028921362,0.0000039853544,0.000017987051,0.000021093425,0.0008055342],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981797,0.000090972644,0.00040635097,0.0006168131,0.00031402573,0.00039215293],"domain_scores_gemma":[0.99878997,0.00027638618,0.00031983008,0.0002959427,0.00008027804,0.00023760271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006464219,0.00025057083,0.0004557319,0.00034645034,0.0003970169,0.00022029835,0.00066307373,0.00019353008,0.000080515136],"category_scores_gemma":[0.00007731192,0.0002935152,0.00019795884,0.00026265508,0.0001693502,0.0017893199,0.00033275536,0.00047004208,0.000024004341],"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.0005465677,0.001520596,0.5507737,0.0005943943,0.0004325755,0.00007274256,0.01646921,0.1963105,0.15355892,0.0058486424,0.0001228879,0.07374925],"study_design_scores_gemma":[0.014589035,0.0027088774,0.261314,0.0017000571,0.00021130199,0.0001245573,0.006707194,0.60586596,0.015110668,0.0011975266,0.08586108,0.0046097585],"about_ca_topic_score_codex":0.00015949317,"about_ca_topic_score_gemma":0.00019070825,"teacher_disagreement_score":0.40955544,"about_ca_system_score_codex":0.000105686726,"about_ca_system_score_gemma":0.000028317267,"threshold_uncertainty_score":0.9999517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139734,0.000071376424,0.17329526,0.0001387116,0.00012559492,0.00040611817,0.000006264755,0.00015351865,0.011829726],"genre_scores_gemma":[0.9586434,0.000015627742,0.040971532,0.000037803802,0.00003940626,0.000036122976,0.000006725533,0.000017025783,0.0002323912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883085,0.000018694122,0.00037388146,0.00030324495,0.00026218448,0.00021113576],"domain_scores_gemma":[0.99921924,0.00009529107,0.00014550018,0.00041332355,0.000048036076,0.00007862593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020465278,0.00019595548,0.00034490888,0.0000728111,0.00011645462,0.00009884341,0.0002809471,0.000071529226,0.00004792694],"category_scores_gemma":[0.0000048478328,0.00014754575,0.00004802361,0.00021974908,0.00011108655,0.0002006855,0.00008183476,0.000107187916,0.000019027115],"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.00015607876,0.0003202229,0.00006122285,0.00066763524,0.00019522483,0.00002299767,0.023358624,0.0030247867,0.014246434,0.8995898,0.0010760574,0.05728093],"study_design_scores_gemma":[0.0022285779,0.0012452563,0.0032033154,0.0007518921,0.00010089229,0.00041284625,0.002665415,0.9241231,0.0024460168,0.0608044,0.0009533191,0.0010649447],"about_ca_topic_score_codex":0.000019230742,"about_ca_topic_score_gemma":0.0000108283275,"teacher_disagreement_score":0.92109835,"about_ca_system_score_codex":0.000021708234,"about_ca_system_score_gemma":0.00001711938,"threshold_uncertainty_score":0.60167414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07368985,0.00006765238,0.7976468,0.0008552117,0.0072762063,0.00021216462,5.8181826e-7,0.00046056407,0.11979096],"genre_scores_gemma":[0.9890208,0.000003372355,0.0016414486,0.0019561832,0.0008642344,0.000014873396,6.800806e-7,0.000010577779,0.006487816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883085,0.000038761475,0.00021550374,0.0003041869,0.00016784956,0.00044284668],"domain_scores_gemma":[0.99927425,0.000056906196,0.000059602477,0.00046772708,0.00003589946,0.00010563494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032175542,0.00014384816,0.00014811408,0.000050870265,0.00013332175,0.00017906292,0.0005963491,0.00007436857,0.00003300255],"category_scores_gemma":[0.000010426457,0.00011406759,0.000086523316,0.00016763371,0.000013166228,0.0005605542,0.00022401205,0.00013555671,0.0004103913],"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.0000134278225,0.00018653249,0.000536854,0.000009966847,0.000058046706,0.0000070701294,0.007181114,0.014113054,0.00009239181,0.957961,0.015653195,0.004187308],"study_design_scores_gemma":[0.0011035957,0.0007474768,0.001051535,0.00018059321,0.000012379765,0.00019618197,0.0009839549,0.90274173,0.0036960347,0.0021876208,0.08603256,0.0010663441],"about_ca_topic_score_codex":0.00013545885,"about_ca_topic_score_gemma":0.000023618668,"teacher_disagreement_score":0.9557734,"about_ca_system_score_codex":0.00005078619,"about_ca_system_score_gemma":0.0000080188465,"threshold_uncertainty_score":0.5274887},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038813148,0.0007843421,0.9582836,0.0009133449,0.00080494484,0.00031760347,0.000013791097,0.000012848851,0.00005636545],"genre_scores_gemma":[0.94261533,0.00002512301,0.057097428,0.000020477853,0.0001865689,0.000006841084,0.000018641078,0.000006929993,0.000022660979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981739,0.0002607648,0.0009063898,0.00013923406,0.00041636967,0.000103335864],"domain_scores_gemma":[0.9965494,0.0006413209,0.0011052879,0.00052087294,0.0011495681,0.0000335018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019819213,0.00008746998,0.00021014514,0.00021244168,0.000080332284,0.00022456123,0.0016561062,0.000040138173,0.0000023289344],"category_scores_gemma":[0.000058815018,0.00007442767,0.000044513414,0.00011716826,0.000029129518,0.00031870007,0.00026288806,0.000100569385,6.700221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013365442,0.00019274327,0.0010597121,0.000042627176,0.00030249814,0.0000040225536,0.0016212004,0.87665987,0.008468146,0.08697781,0.0033732762,0.021164425],"study_design_scores_gemma":[0.0013361719,0.000099465535,0.0007167969,0.00025651418,0.000016107466,0.00018615412,0.00043907072,0.9911448,0.0011983451,0.00077778444,0.0037310373,0.00009778729],"about_ca_topic_score_codex":0.0004743829,"about_ca_topic_score_gemma":0.00002252651,"teacher_disagreement_score":0.90380216,"about_ca_system_score_codex":0.00006022487,"about_ca_system_score_gemma":0.00006889551,"threshold_uncertainty_score":0.3077485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61485267,0.0002320699,0.38380936,0.00012545382,0.00070154417,0.00018451342,0.000001171689,0.00000471227,0.00008852696],"genre_scores_gemma":[0.999696,0.000003946538,0.00013125388,0.000011430268,0.00014055493,0.0000051437855,7.233153e-7,0.000004677032,0.00000623686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987034,0.0001525298,0.00071254,0.0001214658,0.00019977872,0.000110266315],"domain_scores_gemma":[0.998584,0.00036761982,0.0007074893,0.00016676348,0.00014781703,0.000026363106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046716654,0.000094570656,0.00025726357,0.000257279,0.00004292047,0.0001018444,0.00026669697,0.00003556834,3.7033647e-7],"category_scores_gemma":[0.000021300417,0.00006397477,0.00009094136,0.00021687997,0.000030327728,0.00017604906,0.000029803869,0.00011326597,2.7926484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010251883,0.0007050502,0.013137334,0.0008583436,0.0003534322,0.000025525806,0.01172965,0.2683801,0.042764883,0.47995526,0.0025126392,0.17947526],"study_design_scores_gemma":[0.008651433,0.006249452,0.1748247,0.007399082,0.00011358593,0.004563575,0.006458721,0.72748226,0.021991061,0.040210903,0.00084624276,0.0012090126],"about_ca_topic_score_codex":0.0001246277,"about_ca_topic_score_gemma":0.000016318607,"teacher_disagreement_score":0.45910212,"about_ca_system_score_codex":0.000044092285,"about_ca_system_score_gemma":0.000021106793,"threshold_uncertainty_score":0.26088154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23971336,0.00023020283,0.75417596,0.0008370579,0.0046740673,0.0002856001,0.0000043404584,0.000026940615,0.000052455034],"genre_scores_gemma":[0.98703593,0.00006108868,0.009508346,0.00029646847,0.0029277545,0.000020217392,0.0000097919155,0.000012575758,0.00012782948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99888045,0.000052105304,0.00037747313,0.00013982193,0.0003146309,0.00023552011],"domain_scores_gemma":[0.99851984,0.000065950604,0.0004868535,0.00013753003,0.0006563754,0.00013344668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007542079,0.000114440176,0.00017159365,0.00009446562,0.000111662,0.00027559337,0.00051271694,0.00006517133,0.000012495348],"category_scores_gemma":[0.000030920364,0.00009892995,0.00008452165,0.00011760443,0.000017091765,0.0015465225,0.000062456646,0.00014166665,0.0000035957898],"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.0009956596,0.0009604293,0.28508857,0.00015671187,0.001107593,0.000055691613,0.0134577025,0.0076948833,0.110867254,0.38039282,0.012571798,0.18665087],"study_design_scores_gemma":[0.006457925,0.002760256,0.490061,0.0022939919,0.00011743236,0.0047435057,0.00084838213,0.28906438,0.0034472952,0.007561824,0.19101807,0.0016259245],"about_ca_topic_score_codex":0.0000042617507,"about_ca_topic_score_gemma":0.000008403306,"teacher_disagreement_score":0.74732256,"about_ca_system_score_codex":0.00008654207,"about_ca_system_score_gemma":0.00004853221,"threshold_uncertainty_score":0.40342462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004987821,0.0005226181,0.99534947,0.000342806,0.00145851,0.0012844634,0.0000028332563,0.00037899066,0.0001615284],"genre_scores_gemma":[0.9656523,0.00007027966,0.031336896,0.000020375968,0.00013409281,0.00032474365,0.0000021063408,0.000024799867,0.0024344418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976938,0.00040353922,0.0006225831,0.0004625366,0.00034876808,0.00046881827],"domain_scores_gemma":[0.99806786,0.0004129671,0.0003526764,0.0008049448,0.0002853094,0.000076225035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000877629,0.0002313619,0.00032776294,0.00040457715,0.00030408273,0.00012021515,0.00070858287,0.00017955274,0.000062025494],"category_scores_gemma":[0.000029489387,0.0002317149,0.00017444839,0.00073659455,0.000029422672,0.0005303275,0.0000048346988,0.0001768609,0.000042983254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074196476,0.00027468905,6.0298885e-7,0.00007015243,0.0002433152,0.0000012848363,0.0010502964,0.9280814,0.007574474,0.014112538,0.007999592,0.040517453],"study_design_scores_gemma":[0.0007056863,0.0010418363,0.0000019705665,0.000072394636,0.00003518563,0.00013505858,0.00012994089,0.98417777,0.010658066,0.00080535654,0.002002471,0.00023425666],"about_ca_topic_score_codex":0.00003673614,"about_ca_topic_score_gemma":0.0000020297039,"teacher_disagreement_score":0.96515346,"about_ca_system_score_codex":0.00041590576,"about_ca_system_score_gemma":0.000099921,"threshold_uncertainty_score":0.944906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075253204,0.0000075886965,0.9828659,0.000073863324,0.0019099244,0.0003744453,0.000028702198,0.0002715203,0.013715473],"genre_scores_gemma":[0.99317116,0.000008274128,0.0045908606,0.0011707473,0.00004813586,0.00021865594,0.0000028261427,0.000007940282,0.000781394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989432,0.00008489495,0.00043293255,0.00013466741,0.00015712286,0.0002471587],"domain_scores_gemma":[0.9988815,0.00032107774,0.0001451397,0.00037591107,0.00020732258,0.000069005684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007959149,0.00012877416,0.00012530519,0.00018059656,0.00044289313,0.00011602,0.00032711786,0.00009610486,0.00028944906],"category_scores_gemma":[0.000027104023,0.00011827148,0.00014305527,0.00022286896,0.000019418432,0.0022045088,0.000001916146,0.00013998043,0.0002692299],"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.000072586336,0.000069255846,0.000001989197,0.00003847997,0.000060913626,4.073604e-7,0.021077674,0.00267559,0.00005764018,0.96327543,0.0017593419,0.010910681],"study_design_scores_gemma":[0.004864825,0.0012007912,0.00023687452,0.00032023736,0.00012361909,0.000106023566,0.012921966,0.55085903,0.058637347,0.27411792,0.094779775,0.0018316098],"about_ca_topic_score_codex":0.000011544448,"about_ca_topic_score_gemma":0.00001494061,"teacher_disagreement_score":0.99241865,"about_ca_system_score_codex":0.000113425456,"about_ca_system_score_gemma":0.00006296843,"threshold_uncertainty_score":0.4822971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3397562,0.000109431276,0.65572983,0.00038357364,0.0014356193,0.0003706985,0.0000015411003,0.00023822008,0.0019749235],"genre_scores_gemma":[0.9802104,0.0000010988438,0.017269589,0.0016428679,0.00023094399,0.000009847329,0.0000017902221,0.000020943215,0.00061251334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978673,0.00027302274,0.00041007224,0.00069851713,0.00030130078,0.0004497879],"domain_scores_gemma":[0.99864954,0.00043593414,0.00017498163,0.0004619287,0.00012517394,0.00015242858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609964,0.00026096235,0.00031431284,0.00022252057,0.0007452952,0.00020178044,0.0004770616,0.00010302584,0.000009560654],"category_scores_gemma":[0.000059158596,0.00024063847,0.00011035755,0.0004074262,0.00009549731,0.00008632087,0.0003485699,0.00023983777,0.000034777313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095546406,0.0003349679,0.0017608834,0.000093338174,0.00006736177,0.00012992467,0.015978413,0.96034634,0.0002072157,0.00033874603,0.008599712,0.012047572],"study_design_scores_gemma":[0.0015845828,0.00016894238,0.0050602504,0.00016732953,0.0000036322986,0.00010256336,0.00015047702,0.9918882,0.00013068631,0.000004829825,0.00045473906,0.00028371954],"about_ca_topic_score_codex":0.000036574223,"about_ca_topic_score_gemma":0.000012297255,"teacher_disagreement_score":0.64045423,"about_ca_system_score_codex":0.000118853466,"about_ca_system_score_gemma":0.00006500555,"threshold_uncertainty_score":0.9812952},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5327077,0.0005259553,0.46430725,0.0000111735535,0.0023267004,0.000082591796,2.741853e-7,0.0000142405615,0.000024122557],"genre_scores_gemma":[0.9777339,0.000008783806,0.021587597,0.0000301358,0.0006064283,5.038072e-7,1.4097168e-7,0.00001463746,0.000017864784],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979145,0.0002487415,0.0009240557,0.000104511135,0.0004133018,0.0003948835],"domain_scores_gemma":[0.99821794,0.00019095473,0.0008039926,0.0003120967,0.00036623533,0.00010879927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003338461,0.00016341441,0.00037519445,0.00013728945,0.00027978476,0.00008797756,0.00075767847,0.00007195809,0.000004137751],"category_scores_gemma":[0.00003486289,0.000104639206,0.00014009423,0.00028417425,0.000032820284,0.00076551095,0.00021259529,0.00032622326,0.0000027935157],"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.00013975213,0.00071996055,0.02023514,0.0009430037,0.0005406428,0.000022322589,0.029895866,0.26248765,0.6119973,0.014108576,0.0002710008,0.058638807],"study_design_scores_gemma":[0.0003673854,0.00015202865,0.0012250994,0.0005052126,0.000031983287,0.0015125362,0.001239418,0.99179447,0.0030005206,0.000007566879,0.00003356592,0.00013020009],"about_ca_topic_score_codex":0.00017366829,"about_ca_topic_score_gemma":0.0000020662146,"teacher_disagreement_score":0.7293069,"about_ca_system_score_codex":0.00012383434,"about_ca_system_score_gemma":0.00006301632,"threshold_uncertainty_score":0.42670628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41306603,0.00047280532,0.5844231,0.00039909038,0.0005501021,0.00021430469,3.6075255e-7,0.00009377919,0.00078041706],"genre_scores_gemma":[0.9892953,0.0000037837353,0.008458805,0.00036563128,0.0016644,0.000025550475,0.0000030653032,0.000019948582,0.00016354103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998529,0.00007613738,0.0003188526,0.00044616527,0.00017475674,0.00045505073],"domain_scores_gemma":[0.9986883,0.0008053067,0.00006874613,0.00029430786,0.000060605173,0.0000827817],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00052275544,0.00020047618,0.00022196688,0.00003308279,0.0013694271,0.0005415786,0.00022606975,0.00009287228,0.0000052007376],"category_scores_gemma":[0.000008599635,0.0001278311,0.00007366408,0.00016835897,0.00004150813,0.00023089239,0.00017770343,0.00018909202,0.000002779164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002332718,0.00022228844,0.013412981,0.00010718235,0.00023753099,0.00090931595,0.0074397763,0.62575114,0.000935159,0.14841329,0.0041252375,0.19821283],"study_design_scores_gemma":[0.00041116218,0.00009998655,0.00013164549,0.00009927796,0.000013526264,0.00078988745,0.00012850124,0.987997,0.000080796075,0.0006336665,0.009392958,0.0002216241],"about_ca_topic_score_codex":0.00017983398,"about_ca_topic_score_gemma":0.0001685853,"teacher_disagreement_score":0.5762293,"about_ca_system_score_codex":0.000054041637,"about_ca_system_score_gemma":0.000012039525,"threshold_uncertainty_score":0.9999307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00670858,0.000018724208,0.9892366,0.0004011512,0.0003526094,0.00033808275,0.0000025945346,0.00011191416,0.0028297314],"genre_scores_gemma":[0.8796881,0.0000015352006,0.11677405,0.00046570215,0.00017699324,0.00007174696,0.0000012228453,0.000008394645,0.0028122568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911267,0.000011362993,0.00022872168,0.00029254408,0.00009340647,0.0002613149],"domain_scores_gemma":[0.9993518,0.0001806301,0.00006166471,0.00019290928,0.00013220895,0.00008078958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018423448,0.000111687776,0.00014018753,0.000039936956,0.00013339832,0.0005225591,0.00023556656,0.000053082495,0.000012837458],"category_scores_gemma":[0.000015292104,0.00008561089,0.00004519459,0.00009803877,0.00001557613,0.0005243233,0.000072564064,0.00006131838,0.000023128301],"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.0000021005715,0.00017053135,0.00060504285,0.000040966257,0.000063880034,0.000004182149,0.0015937922,0.0021638293,0.005637006,0.09965396,0.008801013,0.8812637],"study_design_scores_gemma":[0.00035997896,0.00011192463,0.000699429,0.000021423655,0.0000016943543,0.000051368756,0.00019586476,0.9969516,0.00010680143,0.0002493559,0.0011157126,0.00013486834],"about_ca_topic_score_codex":0.00076033536,"about_ca_topic_score_gemma":0.000041479067,"teacher_disagreement_score":0.99478775,"about_ca_system_score_codex":0.000018213861,"about_ca_system_score_gemma":0.000017420398,"threshold_uncertainty_score":0.50390494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009796075,0.000021311796,0.83975965,0.00066919636,0.0016362836,0.00015349415,4.253516e-7,0.00025902392,0.14770453],"genre_scores_gemma":[0.9706857,0.0000012995341,0.021662172,0.0035740994,0.00083123636,0.000020356623,8.0328897e-7,0.000010721086,0.0032135681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986167,0.00012570556,0.0002479434,0.00039599754,0.00021300948,0.00040061932],"domain_scores_gemma":[0.99916804,0.000067471745,0.0000491613,0.0005521394,0.000034815705,0.00012835798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002554091,0.00016152859,0.00018406594,0.00006201675,0.000111785026,0.00010603479,0.0006418181,0.000093704926,0.00020756072],"category_scores_gemma":[0.000007197369,0.00010898658,0.000120541976,0.00022082252,0.00002658721,0.00011006949,0.0001317918,0.00030591304,0.00023355731],"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.00007805472,0.00013775186,0.00050396554,0.000008728802,0.000051899093,0.00006849001,0.0040136524,0.0063824193,0.000024045701,0.8933245,0.033969235,0.061437253],"study_design_scores_gemma":[0.001527473,0.0018916575,0.011627776,0.00029230388,0.000013333515,0.00053002447,0.00007199079,0.69331896,0.00073655427,0.087353945,0.20122264,0.001413346],"about_ca_topic_score_codex":0.00006653742,"about_ca_topic_score_gemma":0.00006376949,"teacher_disagreement_score":0.9608897,"about_ca_system_score_codex":0.000017312912,"about_ca_system_score_gemma":0.000019497,"threshold_uncertainty_score":0.44443437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014834189,0.00027998214,0.9951564,0.000025971462,0.00022824827,0.0016835396,0.000007672034,0.000337917,0.0007968679],"genre_scores_gemma":[0.95082396,0.0000030045326,0.047717668,0.000019825758,0.00010399941,0.0011198146,0.00001213267,0.00001721525,0.00018238407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982459,0.000023694658,0.0007241022,0.0004066911,0.00031225075,0.00028734404],"domain_scores_gemma":[0.99859166,0.00012179935,0.00039454194,0.0005822844,0.00019403943,0.00011568393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035203245,0.00019638307,0.00033104277,0.00014944082,0.00011645057,0.00033135453,0.00070172665,0.00011419308,0.0000012699523],"category_scores_gemma":[0.000030146144,0.00017212771,0.00009812826,0.0005120767,0.000040363833,0.0010079708,0.000070973525,0.00008784119,0.00017947142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040045037,0.0018984848,0.0015448565,0.0025196956,0.0005185181,0.000020115363,0.015449439,0.37845507,0.005271648,0.36310464,0.0011630106,0.23001447],"study_design_scores_gemma":[0.00079520367,0.00007033683,0.00017839944,0.00023192729,0.000005057318,0.000057700465,0.0004061374,0.99433565,0.00018414503,0.0017951354,0.0016703812,0.00026993503],"about_ca_topic_score_codex":0.00011259245,"about_ca_topic_score_gemma":0.0000068455324,"teacher_disagreement_score":0.9493405,"about_ca_system_score_codex":0.00015425551,"about_ca_system_score_gemma":0.000093689574,"threshold_uncertainty_score":0.7019164},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052327782,0.000032423126,0.9381284,0.00007324378,0.008952218,0.00019685004,0.0000105131,0.000042995478,0.00023557467],"genre_scores_gemma":[0.8862458,0.0000010915288,0.11206544,0.00002069611,0.0015856627,0.0000066480798,0.0000060137545,0.00001916659,0.00004949425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977812,0.000059654354,0.0011188217,0.000242619,0.000539323,0.00025837883],"domain_scores_gemma":[0.9959604,0.0008837078,0.001092028,0.00021205406,0.0016679517,0.00018383785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008900839,0.00018762023,0.00035089956,0.0002762553,0.00004144798,0.0005277064,0.0014594294,0.00011994795,0.0000082744755],"category_scores_gemma":[0.00058660907,0.0001612515,0.00020262643,0.00013337142,0.00006315452,0.0018092494,0.0001582202,0.00034713472,0.000005439191],"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.0009963484,0.0009889355,0.0029448613,0.00011402284,0.0010455673,0.00036404433,0.004003922,0.15518594,0.029782563,0.01110678,0.001060175,0.79240686],"study_design_scores_gemma":[0.001189185,0.00033248373,0.00012776181,0.00026344645,0.000011164402,0.0011400272,0.00017386829,0.99402034,0.0021647816,0.00007828317,0.00034256707,0.00015610726],"about_ca_topic_score_codex":0.000013794321,"about_ca_topic_score_gemma":0.000004363289,"teacher_disagreement_score":0.8388344,"about_ca_system_score_codex":0.00007130123,"about_ca_system_score_gemma":0.000079338184,"threshold_uncertainty_score":0.6575646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4429278,0.000062563195,0.5538159,0.000058750513,0.0020448596,0.00059820793,0.000012305094,0.00013989749,0.0003397165],"genre_scores_gemma":[0.76072514,0.000050391776,0.23776779,0.000036918518,0.0003541608,0.00039513566,0.000005306941,0.000022339014,0.00064282137],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764335,0.00017472141,0.00042609623,0.0005455084,0.0004088814,0.000801445],"domain_scores_gemma":[0.99835604,0.00015889935,0.000092024726,0.0006574461,0.0006191274,0.00011644236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020364753,0.00016414856,0.00029737683,0.00017892016,0.00047768155,0.00032388157,0.000988496,0.000110816974,0.00010067411],"category_scores_gemma":[0.000087281805,0.00014288508,0.00004421658,0.0003673317,0.00007544702,0.00081364176,0.00030774908,0.00016377747,0.00015338804],"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.00032793675,0.00020002043,0.000033957458,0.0002827294,0.00007220575,0.000026265949,0.0019120638,0.0005674773,0.5952318,0.080434866,0.0006540381,0.32025665],"study_design_scores_gemma":[0.0010177564,0.00059008243,0.00022546976,0.00013639136,0.0000020659702,0.000021330077,0.00008893429,0.0460952,0.94187236,0.0069213426,0.0027390327,0.00029003943],"about_ca_topic_score_codex":0.00014106875,"about_ca_topic_score_gemma":0.0000061512105,"teacher_disagreement_score":0.34664056,"about_ca_system_score_codex":0.0000786656,"about_ca_system_score_gemma":0.00007317132,"threshold_uncertainty_score":0.5826684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013373497,0.000003135644,0.9031806,0.0009092645,0.00034131145,0.00008438441,9.343503e-7,0.00012103689,0.08198585],"genre_scores_gemma":[0.99518627,3.9484735e-7,0.002038646,0.001331776,0.00014581591,0.000018878329,0.0000021002013,0.0000043269492,0.0012718138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991298,0.0000738717,0.00011837486,0.0002817687,0.00023908341,0.00015715626],"domain_scores_gemma":[0.99937063,0.00012767063,0.000046269466,0.0003290172,0.000070454,0.000055945897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028261245,0.00009037196,0.00010941212,0.000030419238,0.00012119135,0.00009672003,0.00022767477,0.000025639249,0.00006683063],"category_scores_gemma":[0.0000139486465,0.00006133734,0.000029380617,0.000105516876,0.00002832825,0.00022315663,0.000029777739,0.000065969994,0.00010627315],"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.000009243362,0.0000371489,0.00037617862,0.0000029048215,0.000008097901,0.0000018462625,0.000039802206,0.000871626,0.00005221901,0.9929942,0.004066691,0.0015400783],"study_design_scores_gemma":[0.0017322585,0.0020666763,0.012306133,0.00014604621,0.000006941758,0.00012816487,0.00009076166,0.71980524,0.0028713793,0.030088142,0.22998212,0.0007761164],"about_ca_topic_score_codex":0.000019441353,"about_ca_topic_score_gemma":0.000074365336,"teacher_disagreement_score":0.9818128,"about_ca_system_score_codex":0.000045384015,"about_ca_system_score_gemma":0.000014649396,"threshold_uncertainty_score":0.25012642},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004607875,0.000031775173,0.9755398,0.0004746216,0.0015000978,0.0001314161,0.0000012491998,0.000277575,0.017435594],"genre_scores_gemma":[0.9618839,0.0000015807565,0.03422047,0.0011117841,0.0003461524,0.000025810416,0.000002022067,0.000008467221,0.0023998187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988577,0.0000587723,0.00024149228,0.00032383582,0.00013301522,0.00038522366],"domain_scores_gemma":[0.99926996,0.000031860076,0.000050314502,0.00041828022,0.00008267927,0.0001468811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002842702,0.00012223392,0.00015451097,0.00004877094,0.00015187293,0.0001920913,0.00056602183,0.000050095852,0.00020002745],"category_scores_gemma":[0.0000132903415,0.00009783817,0.00006145623,0.0004554825,0.0000091634565,0.00027205015,0.00020850704,0.00008138336,0.00031765297],"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.000031523963,0.00008444845,0.0024204208,0.00001253284,0.00006791433,0.000092647664,0.0017418051,0.012062038,0.000342204,0.7732753,0.19299687,0.016872307],"study_design_scores_gemma":[0.00065988116,0.00039951675,0.01026083,0.00022228017,0.000013149349,0.00019824435,0.0003065712,0.7736394,0.0023683733,0.007344797,0.20340888,0.001178121],"about_ca_topic_score_codex":0.00024002999,"about_ca_topic_score_gemma":0.000099889905,"teacher_disagreement_score":0.95727605,"about_ca_system_score_codex":0.000029609626,"about_ca_system_score_gemma":0.000014590638,"threshold_uncertainty_score":0.40828922},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029430664,0.0011337955,0.9899752,0.0012205618,0.00041122895,0.00035343715,0.0000010387447,0.0010152598,0.0029464082],"genre_scores_gemma":[0.72941446,0.00021364211,0.26998422,0.00011920505,0.000072223884,0.000099683595,0.000006877212,0.000008008498,0.00008168817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00009588029,0.00023726761,0.00022985679,0.00010965193,0.00031381266],"domain_scores_gemma":[0.9984279,0.00029575714,0.000166578,0.0010023233,0.00006448031,0.000042937318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903692,0.0001442264,0.00019149658,0.00011210018,0.00044600066,0.00013856638,0.0006669669,0.00019297402,0.0000022834809],"category_scores_gemma":[0.000032933756,0.00012730814,0.00005464966,0.00037599818,0.00009395197,0.00027370654,0.00017709342,0.00021316524,0.0000037385373],"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.000016427819,0.000033708457,0.0018657342,0.000018113771,0.000017936767,5.2695356e-8,0.0001532105,0.0028035666,0.000022599654,0.6551861,0.0083995955,0.33148292],"study_design_scores_gemma":[0.0006411975,0.00013414657,0.0003670162,0.00014233327,0.000016126278,0.000030721647,0.0016181782,0.91838336,0.00039429983,0.031189501,0.046704277,0.00037886677],"about_ca_topic_score_codex":0.000011752334,"about_ca_topic_score_gemma":0.0000026125913,"teacher_disagreement_score":0.9155798,"about_ca_system_score_codex":0.000028744606,"about_ca_system_score_gemma":0.000016682874,"threshold_uncertainty_score":0.5191475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40416873,0.000017411809,0.5866488,0.0001625563,0.00027942832,0.00009037978,8.040856e-8,0.000056149318,0.008576469],"genre_scores_gemma":[0.9938098,0.0000020020768,0.005495272,0.00014383928,0.000047202157,0.0000023673451,2.4066279e-7,0.0000025007114,0.0004967644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994488,0.00003092454,0.00016866924,0.00014616603,0.000088711706,0.00011676072],"domain_scores_gemma":[0.99959046,0.000043502598,0.00006156175,0.00017147946,0.000088791356,0.000044231223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014531225,0.000055130367,0.00011271883,0.0000342574,0.00006450778,0.00009662297,0.00011223085,0.00003078821,0.000120475444],"category_scores_gemma":[0.000009354109,0.000045654957,0.000028162458,0.000088660934,0.000017345557,0.00033597983,0.00008433773,0.00004221548,0.00004410073],"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.00002996592,0.0002969139,0.12872113,0.00025352094,0.0002654019,0.00003191771,0.0077315285,0.0038707983,0.13832541,0.53124696,0.04653974,0.14268671],"study_design_scores_gemma":[0.0002893643,0.000068028436,0.028316036,0.000047261838,0.000003513612,0.000057869252,0.00010828398,0.95251006,0.012800208,0.0052706446,0.00037090952,0.00015780427],"about_ca_topic_score_codex":0.00048038922,"about_ca_topic_score_gemma":0.00003470824,"teacher_disagreement_score":0.9486393,"about_ca_system_score_codex":0.000009302479,"about_ca_system_score_gemma":0.000005683407,"threshold_uncertainty_score":0.18617551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047801418,0.00013390969,0.9872438,0.0006494057,0.00043996243,0.00044183424,0.0000016745072,0.00015214736,0.010459267],"genre_scores_gemma":[0.9909982,8.767252e-7,0.0056574247,0.00026980447,0.0005616105,0.00025024067,0.0000018144581,0.000005155996,0.002254861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994404,0.000013534292,0.0001278701,0.0001263806,0.000074618685,0.0002172431],"domain_scores_gemma":[0.999488,0.00007371585,0.00004690566,0.00023624944,0.0000757976,0.000079331316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020431487,0.000060210696,0.00008463666,0.000028978853,0.00011150755,0.00007530231,0.00028819274,0.000031183754,0.000021898783],"category_scores_gemma":[0.000008066359,0.00004716682,0.000051775176,0.00015527035,0.000007654542,0.0003185522,0.00002225229,0.000036011275,0.000105562605],"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.0000068868135,0.0001923123,0.00071746024,0.00006529875,0.00003219258,8.722496e-8,0.0009282625,0.00010190223,0.00046919298,0.9152376,0.06891031,0.0133385025],"study_design_scores_gemma":[0.0003004909,0.00006896301,0.0012523046,0.00001308953,0.0000059885247,0.000023127655,0.000070821894,0.06822166,0.0020413895,0.0012567374,0.92654115,0.00020425215],"about_ca_topic_score_codex":0.0000106849175,"about_ca_topic_score_gemma":0.000005551083,"teacher_disagreement_score":0.9905202,"about_ca_system_score_codex":0.00002405094,"about_ca_system_score_gemma":0.000019104826,"threshold_uncertainty_score":0.1923407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017034744,0.000045720357,0.99256384,0.00027436344,0.0013125794,0.00018664465,3.1294545e-7,0.00010330635,0.0038097443],"genre_scores_gemma":[0.9518986,0.0000017612156,0.04632642,0.0003998259,0.00038987407,0.000027847962,4.2417068e-7,0.000005785136,0.00094946893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925274,0.00003629858,0.0001564002,0.00025851958,0.00008154956,0.00021447161],"domain_scores_gemma":[0.9994052,0.00018215363,0.000036207013,0.00022934456,0.00006815403,0.00007896286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041822257,0.000083021165,0.000119903896,0.000030012267,0.00012081511,0.00015049592,0.00019353654,0.000050085244,0.000006492227],"category_scores_gemma":[0.000021535265,0.000063226864,0.00004300648,0.000077282675,0.000018005834,0.000043769294,0.00008155741,0.000045444227,0.0000072894177],"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.0000100607585,0.000066598295,0.00012803201,0.00001899834,0.000028008142,0.0000013127938,0.00034007416,0.049248364,0.00005843952,0.76787245,0.011423645,0.17080402],"study_design_scores_gemma":[0.00027434045,0.00008680558,0.00008597973,0.000008854051,0.0000018546817,0.00001222263,0.000025753658,0.9844779,0.000029065914,0.00015365603,0.014749449,0.00009411381],"about_ca_topic_score_codex":0.000023954573,"about_ca_topic_score_gemma":0.000012854873,"teacher_disagreement_score":0.95019513,"about_ca_system_score_codex":0.000017715185,"about_ca_system_score_gemma":0.000004575437,"threshold_uncertainty_score":0.25783166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040382046,0.000021065804,0.9466631,0.00016844763,0.001582926,0.0003821109,0.0000012553776,0.00025322984,0.010545861],"genre_scores_gemma":[0.9971403,7.264805e-7,0.0012771647,0.0005347937,0.0006317827,0.0000311718,0.0000034870582,0.000017221131,0.00036337465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998589,0.00009996397,0.0003258485,0.0004617952,0.0002024861,0.00032091935],"domain_scores_gemma":[0.9989006,0.00036351048,0.00009609898,0.00043072324,0.000113103604,0.00009598803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066067395,0.00018400345,0.00023675358,0.00007928579,0.00029896828,0.00025468314,0.00025618885,0.00011060371,0.000006450462],"category_scores_gemma":[0.000027389602,0.00014252789,0.00008911214,0.0001350756,0.000008422629,0.0001953919,0.000058872316,0.000104252234,0.000021177435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019660161,0.000009991778,0.000069266796,0.00002240073,0.0000101638325,3.2172642e-7,0.00012916053,0.8477906,0.0000026530258,0.15002882,0.00061476696,0.0013022212],"study_design_scores_gemma":[0.00036898803,0.00027509374,0.000049133418,0.00019680276,0.0000033315116,0.0000059092945,0.000051139003,0.9966504,0.000009978516,0.0011446204,0.0010632086,0.00018140418],"about_ca_topic_score_codex":0.000018376219,"about_ca_topic_score_gemma":0.000014561986,"teacher_disagreement_score":0.95675826,"about_ca_system_score_codex":0.00004648842,"about_ca_system_score_gemma":0.000011174719,"threshold_uncertainty_score":0.58121186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018042997,0.00011995297,0.9810722,0.00009019627,0.00033049993,0.00021089186,0.0000011056752,0.000044630993,0.000087561835],"genre_scores_gemma":[0.96371627,0.00001909093,0.03591263,0.00013758661,0.00010301844,0.00001127256,2.4110741e-7,0.000008432817,0.0000914541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990484,0.00019568736,0.00019410317,0.00027352088,0.000108482476,0.0001798199],"domain_scores_gemma":[0.99837005,0.0011705615,0.00008470752,0.00022801312,0.00006134575,0.00008529438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050335214,0.00013009919,0.00020826959,0.00007812925,0.0000855703,0.00008316881,0.0001552792,0.000072505994,0.0000016167232],"category_scores_gemma":[0.00005478015,0.00010344725,0.00002773205,0.00011310688,0.000061906496,0.00009094619,0.000035393983,0.00009081142,0.0000030829513],"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.00020609882,0.0006313785,0.0019677184,0.0005504188,0.00027013288,0.00010409437,0.017129704,0.04406346,0.3526587,0.026855685,0.007336544,0.5482261],"study_design_scores_gemma":[0.00042221532,0.0004964564,0.00025205978,0.00007602425,0.000007872489,0.00011726887,0.000016741327,0.980995,0.015438044,0.0017693839,0.00023648421,0.0001724602],"about_ca_topic_score_codex":0.00002535354,"about_ca_topic_score_gemma":0.0000030271738,"teacher_disagreement_score":0.9456733,"about_ca_system_score_codex":0.0000055030446,"about_ca_system_score_gemma":0.0000117597965,"threshold_uncertainty_score":0.42184564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015836294,0.000013266454,0.991154,0.00049452536,0.00063875725,0.00012392874,6.522552e-7,0.00010137915,0.0058898265],"genre_scores_gemma":[0.9703969,9.0262733e-7,0.027688498,0.000361151,0.00021350913,0.000016445587,6.3295505e-7,0.000003902287,0.0013181027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994462,0.000035154964,0.00012379176,0.00019990378,0.00006197917,0.00013297],"domain_scores_gemma":[0.9994542,0.00021627301,0.000045256533,0.00014156735,0.000100151425,0.000042564097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924091,0.00006393794,0.00009522262,0.000025586887,0.00012425988,0.00011285991,0.0001313203,0.000039598293,0.0000035641408],"category_scores_gemma":[0.000028296678,0.000050896382,0.000024344912,0.000055940283,0.000012767592,0.00017480836,0.00005170782,0.000037785896,0.000009569595],"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.0000052346654,0.0000073892747,0.0003130216,0.000007814404,0.000011160572,3.6241343e-7,0.0003534112,0.00038015447,0.000025456975,0.95601743,0.003487173,0.0393914],"study_design_scores_gemma":[0.0002011265,0.00012720349,0.0003259039,0.000020013167,0.0000018629433,0.000009463215,0.00005542251,0.9843229,0.00005484499,0.0010826911,0.013712663,0.000085919724],"about_ca_topic_score_codex":0.000055549364,"about_ca_topic_score_gemma":0.00008496891,"teacher_disagreement_score":0.98394275,"about_ca_system_score_codex":0.000011912445,"about_ca_system_score_gemma":0.000008554066,"threshold_uncertainty_score":0.20754942},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055221267,0.0011558528,0.93978167,0.0016866158,0.0005582648,0.00038864216,0.000009619068,0.00013560923,0.0010624735],"genre_scores_gemma":[0.96770775,0.00014409216,0.031102337,0.00087129854,0.00008332689,0.00005144239,0.000004037267,0.000013751307,0.000021961883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763864,0.00036475676,0.00050777243,0.00045548767,0.00046795668,0.00056536583],"domain_scores_gemma":[0.99687403,0.0013180024,0.00025166053,0.0012889262,0.000106028434,0.0001613661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010069394,0.00027087826,0.0003001744,0.0003696198,0.0011640855,0.00033496384,0.0016840033,0.00009959124,0.000017992405],"category_scores_gemma":[0.000008674678,0.00024542157,0.00016392548,0.0007106653,0.00034475615,0.0005942809,0.00004886765,0.00042552358,0.000018167384],"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.00021559489,0.009975486,0.004546087,0.00013985322,0.00037812052,0.0000030638944,0.0046530324,0.27041677,0.0039880783,0.17440987,0.00020566265,0.5310684],"study_design_scores_gemma":[0.0006807125,0.003207226,0.00081747404,0.00023976718,0.000022836019,0.000020197549,0.00009135311,0.9890634,0.0038591272,0.00020250845,0.0014154576,0.00037998077],"about_ca_topic_score_codex":0.00004689649,"about_ca_topic_score_gemma":0.000083808554,"teacher_disagreement_score":0.9124865,"about_ca_system_score_codex":0.0001573818,"about_ca_system_score_gemma":0.000108130625,"threshold_uncertainty_score":0.9999998},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007749066,0.0015442322,0.9594801,0.0005356762,0.0026224405,0.00026587423,1.1690519e-7,0.00031905374,0.02748343],"genre_scores_gemma":[0.98812634,0.00008262211,0.00475061,0.00088454294,0.0023066248,0.00003922377,0.0000025983375,0.000023477938,0.003783942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978701,0.00007196117,0.0005495002,0.00053478836,0.00021483278,0.000758843],"domain_scores_gemma":[0.99892324,0.000107135005,0.00014674259,0.0006131494,0.000079501784,0.000130201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008289472,0.00021736781,0.0002917367,0.00012666029,0.00017177867,0.00030698034,0.0007569394,0.00023381454,0.000059018097],"category_scores_gemma":[0.000008591933,0.00021063157,0.000095977426,0.00086337415,0.000025658752,0.0006696463,0.00023007955,0.0005460853,0.0000828341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001545094,0.000035033285,0.0020683515,0.0000030881658,0.000007284184,0.000014339747,0.00008432033,0.93885636,0.000002247862,0.0115591455,0.013697865,0.033656526],"study_design_scores_gemma":[0.0006875704,0.000036543763,0.0003795026,0.00010252124,0.0000021743497,0.000040854575,0.000012406057,0.9541469,0.000011295181,0.000079613375,0.044265363,0.00023520374],"about_ca_topic_score_codex":0.00014204501,"about_ca_topic_score_gemma":0.0003847032,"teacher_disagreement_score":0.9803773,"about_ca_system_score_codex":0.00013375601,"about_ca_system_score_gemma":0.000029723013,"threshold_uncertainty_score":0.8589306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09164189,0.0005173364,0.9013248,0.00007570471,0.0020177267,0.00030909147,0.0000032738456,0.00040749475,0.003702694],"genre_scores_gemma":[0.99106383,0.0000019585439,0.007592904,0.00010827504,0.0009208221,0.0000064261894,0.0000041567723,0.000019335323,0.00028226472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727935,0.00069139345,0.0008366154,0.00041228806,0.00036144754,0.00041889356],"domain_scores_gemma":[0.9978924,0.0005774929,0.00044379506,0.00072647975,0.00024623508,0.000113590824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021617066,0.00022647345,0.0005171042,0.0001797712,0.0001993752,0.00015255429,0.00096551346,0.00009956098,0.000020517626],"category_scores_gemma":[0.000036441306,0.00020440195,0.0001539803,0.00036895816,0.00006647685,0.00022475039,0.00022884588,0.00017214364,0.000097044125],"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.00001365801,0.00018403897,0.000119345175,0.00012441355,0.0001663879,0.000011596577,0.0045201397,0.03406023,0.0015356244,0.704784,0.0040352237,0.25044537],"study_design_scores_gemma":[0.00046594476,0.000097007374,0.00035461245,0.00018807345,0.0000075551834,0.00012697474,0.00026045006,0.9856399,0.00057442597,0.0014764925,0.010553547,0.0002549877],"about_ca_topic_score_codex":0.000070765826,"about_ca_topic_score_gemma":0.000002582566,"teacher_disagreement_score":0.9515797,"about_ca_system_score_codex":0.000090435366,"about_ca_system_score_gemma":0.00004132627,"threshold_uncertainty_score":0.83352697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7480917,0.00009668928,0.2358662,0.000049783775,0.00054200564,0.00019447328,6.198233e-8,0.000061463776,0.015097632],"genre_scores_gemma":[0.99921936,0.000027496439,0.00039830589,0.00003355976,0.00013331305,0.000008740348,6.816312e-7,0.000006112196,0.00017241361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984723,0.00022560137,0.0004358787,0.0002579081,0.0003639733,0.00024438355],"domain_scores_gemma":[0.99929285,0.00006244809,0.00016282487,0.00025122473,0.00019791967,0.000032715987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018365071,0.000105755425,0.00016450272,0.00014114042,0.00008940986,0.0000702793,0.00022642627,0.0000810343,0.00009786017],"category_scores_gemma":[0.0000268258,0.00009495329,0.000040538926,0.00058121834,0.000007652854,0.00066415424,0.000044511708,0.00016081418,0.00001253263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053625067,0.000054429656,0.008036602,0.000008936213,0.000011808724,8.494468e-7,0.00071866455,0.8473551,0.00040485975,0.0069870893,0.00035537762,0.13606092],"study_design_scores_gemma":[0.00041884056,0.000091157286,0.008933488,0.000063532236,0.0000044197773,0.000013386662,0.00010244878,0.9898212,0.00030043419,0.00013101472,0.000013862278,0.00010623172],"about_ca_topic_score_codex":0.00037609765,"about_ca_topic_score_gemma":0.00047063158,"teacher_disagreement_score":0.2511277,"about_ca_system_score_codex":0.00010942283,"about_ca_system_score_gemma":0.0000195112,"threshold_uncertainty_score":0.38720828},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2608805,0.00009194269,0.6704022,0.0001283977,0.0004920988,0.000048791087,4.5546653e-7,0.00003583285,0.067919716],"genre_scores_gemma":[0.9980005,0.000001240032,0.0012664371,0.00010416473,0.0000165288,0.000002510279,3.4705627e-7,0.0000013156268,0.0006069446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943453,0.000037116984,0.00018890249,0.00009241699,0.00009976209,0.0001472897],"domain_scores_gemma":[0.9995896,0.000043709424,0.00004595621,0.00024905888,0.000034032048,0.00003760125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032528947,0.00004317199,0.00015193083,0.00026091913,0.000011509797,0.000018128823,0.00021108266,0.000029184686,0.00017789444],"category_scores_gemma":[0.000008789008,0.000033301912,0.00008152451,0.0011267143,0.0000066032335,0.00022478453,0.000053083342,0.000033903227,0.000015461901],"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.0000072214966,0.00031217464,0.4182243,0.000009758658,0.0005138342,0.0000040202513,0.008082495,0.008720267,0.0005078379,0.55306315,0.0061816033,0.0043733474],"study_design_scores_gemma":[0.00022038828,0.00006631158,0.14714997,0.000016503105,0.000037901984,0.0000068673485,0.00032140774,0.84287417,0.00065877376,0.000179202,0.008274031,0.0001945058],"about_ca_topic_score_codex":0.00019428655,"about_ca_topic_score_gemma":0.00017877408,"teacher_disagreement_score":0.8341539,"about_ca_system_score_codex":0.000016842172,"about_ca_system_score_gemma":0.0000062254967,"threshold_uncertainty_score":0.19478193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04588954,0.00001285769,0.7947844,0.00012859676,0.00022076747,0.00029307016,0.0000019018763,0.000058638314,0.15861018],"genre_scores_gemma":[0.9931563,0.0000029584032,0.0064330087,0.00017964542,0.00002215024,0.000045691682,4.432224e-7,0.000010103702,0.00014966552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990198,0.000051956737,0.00028594735,0.00019777931,0.00025506952,0.0001894276],"domain_scores_gemma":[0.9985849,0.00044301577,0.00018282996,0.00070982886,0.000041439624,0.00003797475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006947717,0.00013421135,0.00022137792,0.000049260772,0.00013843861,0.00008858385,0.0004380987,0.000052522246,0.000033416636],"category_scores_gemma":[0.000060055776,0.000083150626,0.0001001775,0.0002785001,0.00005718902,0.000059490863,0.00005169607,0.00012671808,0.00003817706],"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.0000016873687,0.00005052208,0.0000045727897,0.000027438062,0.000021178841,7.0689873e-7,0.0012602295,0.00019391492,0.0006208865,0.99709153,0.0005927947,0.0001345476],"study_design_scores_gemma":[0.0006247068,0.00018577272,0.00006179785,0.00014318583,0.000020757221,0.00003775545,0.001417571,0.059755206,0.02948266,0.9017512,0.0060224943,0.000496846],"about_ca_topic_score_codex":0.000003164665,"about_ca_topic_score_gemma":0.0000033990054,"teacher_disagreement_score":0.9472668,"about_ca_system_score_codex":0.00001667427,"about_ca_system_score_gemma":0.000020678563,"threshold_uncertainty_score":0.33907843},"labels":[],"label_agreement":null},{"id":"W2070774400","doi":"10.1142/s0219265909002510","title":"A GENERATING FUNCTION APPROACH TO THE SURFACE AREAS OF SOME INTERCONNECTION NETWORKS","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Chordal graph; Interconnection; Vertex (graph theory); Combinatorics; Indifference graph; Star (game theory); Mathematics; Surface (topology); Function (biology); Metric dimension; 1-planar graph; Computer science; Graph; Discrete mathematics; Geometry; Telecommunications; Mathematical analysis","score_opus":0.014167981880614784,"score_gpt":0.22609117503705403,"score_spread":0.21192319315643926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070774400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05817829,0.0010079278,0.929148,0.0012708498,0.009089083,0.00035391547,5.435348e-7,0.00008869455,0.00086268375],"genre_scores_gemma":[0.9896368,0.00010054304,0.003907976,0.0020380686,0.004083006,0.000008471153,0.0000022361999,0.000025139603,0.00019777972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961636,0.0005893649,0.0017303638,0.0004722435,0.00052909885,0.0005153052],"domain_scores_gemma":[0.9964121,0.00030352667,0.0014263837,0.0006619782,0.0009668315,0.00022920719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028115716,0.00037367787,0.00068698626,0.00037301346,0.00035325368,0.00040306506,0.0011119655,0.00028199173,0.000017352566],"category_scores_gemma":[0.00016834098,0.00026792884,0.0005313916,0.0011752225,0.000042883286,0.0014707084,0.00013833553,0.000977084,0.000006946396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019631746,0.00016719331,0.00010208703,0.000008550647,0.00013929975,0.0000039163583,0.000637635,0.95074844,0.00055340485,0.010446971,0.013775802,0.023220377],"study_design_scores_gemma":[0.0005772206,0.0016879836,0.0006145841,0.000296515,0.000052083582,0.0007777746,0.00066131435,0.9907302,0.00026654158,0.0006404768,0.0033978156,0.00029743533],"about_ca_topic_score_codex":0.000033476575,"about_ca_topic_score_gemma":0.000034069126,"teacher_disagreement_score":0.9314585,"about_ca_system_score_codex":0.00024503362,"about_ca_system_score_gemma":0.000063053885,"threshold_uncertainty_score":0.9999773},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15868396,0.00080532493,0.83703524,0.0005431043,0.00047348806,0.00030691593,0.0000026585096,0.000059086375,0.0020902562],"genre_scores_gemma":[0.9896017,0.00010556907,0.009809035,0.00034907856,0.000031685926,0.000046791938,0.0000023840748,0.000004471573,0.00004934057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987011,0.00021651707,0.00041472306,0.00034542667,0.00015841797,0.00016382274],"domain_scores_gemma":[0.9980177,0.0010244576,0.0003371065,0.00015236044,0.00041001203,0.000058345835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080772117,0.00011900184,0.00021092774,0.000046379788,0.00023130486,0.00015100665,0.0001494537,0.000054855147,0.000004385141],"category_scores_gemma":[0.00041446884,0.00010974315,0.0000314292,0.00023450148,0.00005661374,0.0013237577,0.00004427162,0.00006625401,0.0000024941178],"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.00012371327,0.00021144749,0.0009815509,0.00045530096,0.00005939197,0.000002898927,0.06987177,0.00057868165,0.0070761107,0.80795085,0.000497112,0.11219114],"study_design_scores_gemma":[0.003328629,0.0011562814,0.0015487109,0.000438852,0.00006252612,0.00031726348,0.026980886,0.90037405,0.0067354566,0.024712674,0.033067778,0.0012768605],"about_ca_topic_score_codex":0.000108524015,"about_ca_topic_score_gemma":0.0000057108964,"teacher_disagreement_score":0.8997954,"about_ca_system_score_codex":0.000009488811,"about_ca_system_score_gemma":0.00006205549,"threshold_uncertainty_score":0.44751957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05464691,0.000052212643,0.9369447,0.00021527449,0.0048909187,0.00215798,0.0000152419,0.0005932172,0.00048353602],"genre_scores_gemma":[0.98569673,0.000002822099,0.012445772,0.00026907033,0.00043599246,0.000538911,0.000010778251,0.00007079087,0.0005291313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950447,0.0006537952,0.0014016554,0.0013133246,0.0005891664,0.0009973268],"domain_scores_gemma":[0.9951071,0.0015886393,0.00033237055,0.0021756496,0.00040110754,0.0003951143],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015321753,0.00057275116,0.0008887132,0.0007795065,0.0004167596,0.0010477445,0.0019887816,0.00037796918,0.000010501654],"category_scores_gemma":[0.00012952392,0.00052882446,0.00031156032,0.0007482973,0.000059641414,0.0008099448,0.000031232725,0.000647894,0.00018178168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039386287,0.0003937231,0.00002250133,0.00011545058,0.00008675604,0.0000073470087,0.0040372955,0.97688025,0.00023134856,0.009610292,0.0006005066,0.007975164],"study_design_scores_gemma":[0.0013553648,0.0005287578,0.000036599326,0.00059657654,0.000017374137,0.00006240293,0.0017659923,0.9944983,0.000080874466,0.0004110616,0.00007065463,0.0005760393],"about_ca_topic_score_codex":0.0005562896,"about_ca_topic_score_gemma":0.00005911661,"teacher_disagreement_score":0.9310498,"about_ca_system_score_codex":0.00036306703,"about_ca_system_score_gemma":0.0001141692,"threshold_uncertainty_score":0.9999893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016161993,0.0003630472,0.971591,0.00062248856,0.0011200238,0.00020365449,4.987309e-7,0.000047617024,0.00988968],"genre_scores_gemma":[0.9829049,0.000033313903,0.016212022,0.00006029572,0.0005416786,0.00000593214,4.2298896e-7,0.000013658118,0.00022778433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803555,0.0001622224,0.0008676402,0.00016624806,0.00044210732,0.00032621305],"domain_scores_gemma":[0.99804366,0.000498949,0.00064937863,0.0005469146,0.00019315702,0.00006795595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018940698,0.00016053078,0.00027192183,0.000054375636,0.00041765213,0.0004249057,0.0008292775,0.00007954849,0.00000888725],"category_scores_gemma":[0.00008005593,0.00009213852,0.00022128884,0.00024628273,0.000072989234,0.00019070755,0.000106725485,0.00039440248,0.000008874417],"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.000012823152,0.00021006673,0.00031141355,0.00009143799,0.000062132356,0.00001714022,0.0006281951,0.081311375,0.00007465741,0.9075996,0.001733454,0.007947676],"study_design_scores_gemma":[0.0001890558,0.0001686769,0.00010795051,0.00024771466,0.000008753935,0.00018526269,0.00009104414,0.8413509,0.000091762624,0.15573591,0.0016916585,0.00013127885],"about_ca_topic_score_codex":0.0000033902331,"about_ca_topic_score_gemma":0.000032734406,"teacher_disagreement_score":0.9667429,"about_ca_system_score_codex":0.00006229582,"about_ca_system_score_gemma":0.000037562993,"threshold_uncertainty_score":0.40973756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.171461,0.0030127931,0.82210535,0.00027662693,0.002662756,0.0001571589,0.000004246531,0.000056088804,0.00026400678],"genre_scores_gemma":[0.9955351,0.000026506785,0.003731417,0.000057685356,0.00043279995,0.0000013838064,1.2810933e-7,0.000006390161,0.00020860539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"case_report","domain_scores_codex":[0.9988307,0.000067599394,0.000562425,0.0001394911,0.0002299193,0.00016988673],"domain_scores_gemma":[0.9988566,0.00008592677,0.0003990033,0.00019454514,0.0003026119,0.00016130583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077462744,0.00011283563,0.00032954843,0.00010253718,0.00016308996,0.00029833347,0.00020833712,0.000082503124,0.000003595899],"category_scores_gemma":[0.000054411714,0.00008183438,0.00009197027,0.00014465353,0.000031966443,0.00043895663,0.000052385916,0.00019418116,0.000011831487],"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.00024967946,0.0009796397,0.014711817,0.0017038655,0.0013815478,0.117667325,0.032190617,0.029505853,0.0014498256,0.711959,0.026236568,0.061964292],"study_design_scores_gemma":[0.0073545636,0.0025293934,0.00096821995,0.0051973034,0.00010602415,0.8786397,0.003691953,0.02240793,0.00017018261,0.011644356,0.065796755,0.0014936338],"about_ca_topic_score_codex":0.00020398534,"about_ca_topic_score_gemma":0.00002139432,"teacher_disagreement_score":0.8240741,"about_ca_system_score_codex":0.000090948364,"about_ca_system_score_gemma":0.00012045469,"threshold_uncertainty_score":0.33371094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85190785,0.000041999712,0.124250166,0.00018580985,0.00071407476,0.0001886655,9.56756e-8,0.000051915005,0.022659445],"genre_scores_gemma":[0.9988617,0.0000032829048,0.0004959998,0.00014713668,0.00004706204,0.000017225075,1.9054755e-7,0.0000031617528,0.00042428655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999065,0.0001155482,0.00022705598,0.00014762864,0.00032080428,0.00012398504],"domain_scores_gemma":[0.99921906,0.000030170737,0.000081982485,0.00038088247,0.0002659119,0.000021999695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015970796,0.00006375492,0.00008468579,0.000032130796,0.00010138154,0.000039379367,0.00038118943,0.000034086235,0.00016282263],"category_scores_gemma":[0.0000065683394,0.000036900692,0.00004780149,0.00018439585,0.000031868996,0.00023060158,0.000044812325,0.000059972146,0.000037685742],"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.00010994509,0.00046855005,0.0021249347,0.00005826273,0.000166392,0.000001212165,0.033274386,0.15392712,0.0008054032,0.43118045,0.008995685,0.36888766],"study_design_scores_gemma":[0.00018556029,0.00007581931,0.010464396,0.000013884748,0.000005323923,0.000009633752,0.0002816632,0.9867679,0.0016869591,0.00031435097,0.00013467026,0.00005982367],"about_ca_topic_score_codex":0.000097739685,"about_ca_topic_score_gemma":0.000101196536,"teacher_disagreement_score":0.8328408,"about_ca_system_score_codex":0.000031063835,"about_ca_system_score_gemma":0.000061711195,"threshold_uncertainty_score":0.17827936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020197772,0.00019250825,0.9636611,0.0027820803,0.00043835823,0.00014800995,2.2114017e-7,0.000034124743,0.030723827],"genre_scores_gemma":[0.99045324,0.000007442819,0.0044520274,0.00026394858,0.000021152828,0.00007004798,3.1345442e-7,0.0000024556425,0.0047293776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950475,0.00004431153,0.0001783157,0.000083779705,0.00008609787,0.000102760365],"domain_scores_gemma":[0.99882036,0.0002646375,0.00006730561,0.00059925264,0.00022667967,0.00002175111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025553926,0.000041413958,0.000060969276,0.000014880653,0.00016374145,0.00010171055,0.00064484077,0.00002227072,0.000034360644],"category_scores_gemma":[0.000012653207,0.000023524643,0.000051964813,0.00008869969,0.000028195134,0.0000692317,0.00010500423,0.000024147683,0.000015934604],"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":[8.01126e-7,0.000016120934,0.0000055868045,0.0000011147955,0.000006928006,1.4345821e-8,0.00024381107,0.0011930148,0.00004103057,0.9487321,0.043943048,0.0058164685],"study_design_scores_gemma":[0.00011314819,0.00004699462,0.000094042676,0.000010644257,8.298483e-7,0.0000032323946,0.0001965932,0.84951305,0.0008796983,0.0039967047,0.14508769,0.000057365563],"about_ca_topic_score_codex":0.00014325666,"about_ca_topic_score_gemma":0.000033247477,"teacher_disagreement_score":0.9884335,"about_ca_system_score_codex":0.000009484171,"about_ca_system_score_gemma":0.000011276157,"threshold_uncertainty_score":0.12593834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042432886,0.000513264,0.9398423,0.000019842606,0.0026774586,0.00021745448,1.7759743e-7,0.0001349241,0.014161696],"genre_scores_gemma":[0.99716777,0.000004059284,0.0021643124,0.000033591587,0.00016209799,0.0000049527375,4.2380822e-7,0.000012597908,0.00045017272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728805,0.0010997271,0.0007257478,0.00030889892,0.00019222451,0.00038533015],"domain_scores_gemma":[0.9986465,0.00041219697,0.00033214007,0.0004658961,0.00009033874,0.00005292884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003908052,0.0001662339,0.0004120493,0.00012734294,0.00011582052,0.000120295525,0.00052811054,0.000095536445,0.0000035611165],"category_scores_gemma":[0.00008314275,0.00015320517,0.00008289255,0.00042816883,0.000048367805,0.0002316417,0.000086876644,0.00018095538,0.000008095203],"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.000005896603,0.00001631905,0.0010657131,0.000026732157,0.000012800013,0.0000056967556,0.0012342522,0.20274694,0.000015908023,0.7941701,0.000073229865,0.00062641234],"study_design_scores_gemma":[0.00048830896,0.00009731521,0.00076495984,0.00060718594,0.000003558629,0.00021384656,0.0011971726,0.9874273,0.000060054095,0.007966427,0.0008712379,0.00030266802],"about_ca_topic_score_codex":0.00004645254,"about_ca_topic_score_gemma":0.000006767198,"teacher_disagreement_score":0.9547349,"about_ca_system_score_codex":0.000050055416,"about_ca_system_score_gemma":0.000034818313,"threshold_uncertainty_score":0.6247525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13225712,0.00023034922,0.8537282,0.0009597992,0.0009705951,0.0008375182,5.2579423e-7,0.0003847617,0.010631183],"genre_scores_gemma":[0.9917898,0.000019540732,0.0064925775,0.0006810211,0.0003124997,0.00010622773,0.0000049588743,0.000016487153,0.0005768571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980723,0.00009387143,0.0005433221,0.0005206334,0.00032751934,0.00044231216],"domain_scores_gemma":[0.99916214,0.00012121258,0.0001884694,0.00038926268,0.000034285236,0.00010460752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004110492,0.00022720496,0.00024304351,0.00013445974,0.0001622766,0.00048143425,0.00039564207,0.0001389677,0.00020689039],"category_scores_gemma":[0.0000130559565,0.00019155865,0.00007251155,0.00025534883,0.000030441526,0.0008520091,0.00008171853,0.00024366908,0.0003026126],"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.000034117224,0.00029878324,0.006581025,0.000045021166,0.000028262377,0.000030767475,0.0016342261,0.03177622,0.0007298008,0.009867953,0.008439899,0.94053394],"study_design_scores_gemma":[0.0011960557,0.00037343483,0.022453414,0.00047646408,0.000006030236,0.000046491787,0.00034810364,0.9611845,0.0005542122,0.0043745562,0.008191734,0.0007950225],"about_ca_topic_score_codex":0.00021538448,"about_ca_topic_score_gemma":0.00010439251,"teacher_disagreement_score":0.9397389,"about_ca_system_score_codex":0.00012917344,"about_ca_system_score_gemma":0.00003768511,"threshold_uncertainty_score":0.7811535},"labels":[],"label_agreement":null},{"id":"W2078655426","doi":"10.1142/s0219265912500077","title":"A UNIFIED APPROACH TO THE CONDITIONAL DIAGNOSABILITY OF INTERCONNECTION NETWORKS","year":2012,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interconnection; Dual (grammatical number); Computer science; Cayley graph; Theoretical computer science; Discrete mathematics; Mathematics; Computer network; Graph","score_opus":0.01871149027825394,"score_gpt":0.24298892823241747,"score_spread":0.22427743795416352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078655426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027018312,0.00065630884,0.9595352,0.0008740205,0.0088064065,0.00041348877,0.0000025432862,0.0000626426,0.0026310973],"genre_scores_gemma":[0.99251026,0.00005180708,0.0022823338,0.00070398586,0.004223994,0.00004464584,0.0000052029086,0.000025923971,0.00015183387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960039,0.00081447104,0.0016690278,0.00035557622,0.00054671936,0.0006102785],"domain_scores_gemma":[0.99579906,0.00094673526,0.00124305,0.00068473944,0.0009801558,0.0003462603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042108493,0.0003370905,0.0006467143,0.00038765644,0.00027683322,0.00020263011,0.001200015,0.000278179,0.00009463919],"category_scores_gemma":[0.0004142088,0.00023757976,0.00056113274,0.001108123,0.000110455825,0.0014895706,0.00026113915,0.000984773,0.000021078045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039967577,0.0011707948,0.0044449205,0.000052519666,0.00057029456,0.0000047639146,0.0034814037,0.8259665,0.00013054907,0.067612454,0.07976524,0.016400937],"study_design_scores_gemma":[0.001417268,0.0014098014,0.010475276,0.00044682872,0.000118795375,0.002454456,0.0025153637,0.9344829,0.0005876448,0.0014492676,0.04394383,0.0006985688],"about_ca_topic_score_codex":0.000050359125,"about_ca_topic_score_gemma":0.000045565,"teacher_disagreement_score":0.96549195,"about_ca_system_score_codex":0.0002951577,"about_ca_system_score_gemma":0.00006238733,"threshold_uncertainty_score":0.9688221},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58348656,0.00016347149,0.4029239,0.0035030441,0.00090401905,0.00029416356,8.526912e-7,0.00012274827,0.008601229],"genre_scores_gemma":[0.9902148,0.000020363437,0.0012737024,0.0064158244,0.00023052351,0.000011381123,0.0000011441965,0.000009405651,0.0018228414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983233,0.00012684819,0.0003824989,0.0005623242,0.00020166984,0.00040332755],"domain_scores_gemma":[0.99919134,0.00011878339,0.00006595618,0.00038831384,0.00004816258,0.00018742496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004381346,0.00022799119,0.00030014061,0.00024087315,0.00009392517,0.0005264566,0.00038291034,0.00013584107,0.000043901942],"category_scores_gemma":[0.000016284954,0.00018433975,0.000046010482,0.0002932263,0.000029824801,0.00030383552,0.00016386194,0.00027708558,0.000017264603],"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.00067278655,0.0006125901,0.040379662,0.000053434993,0.0002013251,0.0004945348,0.010810222,0.00868221,0.0013311325,0.21412914,0.06652232,0.65611064],"study_design_scores_gemma":[0.0019039902,0.0016859793,0.15237395,0.0003779822,0.00000885603,0.00031883275,0.00011096344,0.82388616,0.0002513268,0.0033379584,0.014902682,0.0008413331],"about_ca_topic_score_codex":0.00014958739,"about_ca_topic_score_gemma":0.00049189985,"teacher_disagreement_score":0.8152039,"about_ca_system_score_codex":0.000056087625,"about_ca_system_score_gemma":0.000014550296,"threshold_uncertainty_score":0.75171566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002562007,0.000036362442,0.96388906,0.0011815674,0.0011584286,0.00010254565,9.545296e-7,0.0000945529,0.033280328],"genre_scores_gemma":[0.96516883,0.0000012364977,0.032157063,0.0017112459,0.00038575684,0.0000067436727,0.0000027916697,0.000004418541,0.0005618808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987238,0.00027876222,0.00021415745,0.00034500862,0.00018320569,0.00025503436],"domain_scores_gemma":[0.9985373,0.0002233634,0.000020146641,0.0010505499,0.000052160518,0.0001164724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021077232,0.00007421953,0.00011949948,0.000035185174,0.000032145468,0.0001419909,0.0010994781,0.000046568126,0.000017028698],"category_scores_gemma":[0.00012414517,0.000058425398,0.000014550867,0.000265512,0.000016054073,0.00036185552,0.00032887995,0.00010603008,0.00016896422],"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.000013786661,0.00006529779,0.00086101674,0.0000028483828,0.0000053672516,0.000027950731,0.0001251639,0.016864106,0.0000014477027,0.606159,0.3718147,0.004059371],"study_design_scores_gemma":[0.00022053516,0.0000774212,0.0003149981,0.000019970395,6.518017e-7,0.000012750253,0.000025396275,0.96517855,0.0000111732215,0.016104462,0.017926445,0.00010766307],"about_ca_topic_score_codex":0.00009398197,"about_ca_topic_score_gemma":0.000102134756,"teacher_disagreement_score":0.96491265,"about_ca_system_score_codex":0.000032524127,"about_ca_system_score_gemma":0.00005312791,"threshold_uncertainty_score":0.23825186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78885317,0.0001306797,0.21049695,0.000035614365,0.00014717286,0.000103760605,6.334142e-7,0.000050048755,0.0001819471],"genre_scores_gemma":[0.99659836,0.00008745576,0.0032247235,0.000034390774,0.000018278644,0.0000041863273,5.60834e-7,0.000004233865,0.000027813056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992046,0.000050194416,0.00026378984,0.00024727685,0.00012244472,0.00011169709],"domain_scores_gemma":[0.9993515,0.00015048268,0.00010870443,0.00020694979,0.00014219011,0.00004014194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001378504,0.00009335405,0.00015687864,0.000083903746,0.00013711599,0.000050244464,0.00011624779,0.000052449184,0.0000034575114],"category_scores_gemma":[0.000049758008,0.00008869442,0.000023279985,0.00010448498,0.000065699525,0.00036721857,0.000038855294,0.000068757385,0.0000022768988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004091422,0.00011194146,0.23209023,0.00025421265,0.000062309584,0.000017799595,0.012487806,0.41770446,0.05246648,0.20759358,0.000014278892,0.07715599],"study_design_scores_gemma":[0.0002375838,0.000025082758,0.11502733,0.00006126965,0.0000021000315,0.000017431388,0.00003204381,0.8828913,0.0011048056,0.00041614467,0.00008693449,0.000097990174],"about_ca_topic_score_codex":0.00015532588,"about_ca_topic_score_gemma":0.000016971888,"teacher_disagreement_score":0.46518683,"about_ca_system_score_codex":0.000008790213,"about_ca_system_score_gemma":0.00001855346,"threshold_uncertainty_score":0.36168534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0844811,0.00009200075,0.9038738,0.00016004064,0.00036964944,0.00014110212,0.0000019153088,0.000077623175,0.01080278],"genre_scores_gemma":[0.9586298,0.000010263396,0.041101716,0.00007090096,0.000029416353,0.00001006709,7.2972836e-7,0.000008471546,0.00013863435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990141,0.00001698105,0.0003681195,0.00016115443,0.00026103563,0.00017865073],"domain_scores_gemma":[0.9991877,0.00004006719,0.00015766603,0.0004883401,0.00007547444,0.000050751823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025611694,0.00010586982,0.00020879772,0.00007068977,0.0000473197,0.00005641038,0.00048983167,0.000044614786,0.0000063377643],"category_scores_gemma":[0.000018834391,0.00008228929,0.00012377837,0.00025086346,0.000029469285,0.00014279797,0.00011515882,0.00006639584,0.000033687862],"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.0000010149759,0.000059301798,0.00002115318,0.00009264003,0.000021871547,0.0000040739887,0.002453094,0.00063936075,0.0012902063,0.9948311,0.00019386414,0.00039235546],"study_design_scores_gemma":[0.0012579584,0.00040474057,0.00037166633,0.0008481871,0.00003102145,0.00009966427,0.0017102435,0.109358065,0.008656941,0.87538344,0.0012839647,0.0005941234],"about_ca_topic_score_codex":0.0000266202,"about_ca_topic_score_gemma":0.0000042291,"teacher_disagreement_score":0.8741487,"about_ca_system_score_codex":0.000023752416,"about_ca_system_score_gemma":0.000028206308,"threshold_uncertainty_score":0.33556598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000951059,0.000005941863,0.612377,0.000034191176,0.000453367,0.000013260865,1.0971902e-8,0.00008132561,0.38608384],"genre_scores_gemma":[0.98060143,5.5441126e-7,0.013693254,0.000306742,0.000044589506,0.0000020321243,2.349641e-8,0.0000011119996,0.0053502605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997506,0.000010656868,0.00005559964,0.00007834173,0.000037701317,0.00006706761],"domain_scores_gemma":[0.99977714,0.0000047244826,0.000010171723,0.0001676326,0.000017840655,0.000022478554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007225625,0.00002366815,0.000029255227,0.000016252623,0.000023338795,0.000021165335,0.00021811984,0.000013338177,0.00024930772],"category_scores_gemma":[0.0000015724062,0.000017206634,0.00001832385,0.000059850045,0.0000037215282,0.00013179911,0.00003645602,0.00001905223,0.00039412038],"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":[2.9931857e-7,0.0000073268266,0.00022321571,4.99417e-7,0.0000022094825,0.0000025443326,0.00048120512,0.0000010069894,0.000020692778,0.9845972,0.009434991,0.0052288137],"study_design_scores_gemma":[0.0007008291,0.00048518178,0.015055364,0.00003599957,0.0000043798905,0.00028137604,0.00039770507,0.4409148,0.01698092,0.0835131,0.44077098,0.0008593424],"about_ca_topic_score_codex":0.0000565625,"about_ca_topic_score_gemma":0.000008978928,"teacher_disagreement_score":0.9796504,"about_ca_system_score_codex":0.0000033534327,"about_ca_system_score_gemma":0.00000373168,"threshold_uncertainty_score":0.50657517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075205864,0.0001590838,0.99557173,0.0006205222,0.0014265134,0.00032941438,4.3544767e-7,0.00014490212,0.0009953361],"genre_scores_gemma":[0.9555185,0.000002025425,0.041054126,0.001890641,0.00058200466,0.00006135274,9.518183e-7,0.000010749312,0.0008796485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990242,0.00008435466,0.00017759035,0.00023301295,0.000105098705,0.00037572012],"domain_scores_gemma":[0.99905175,0.00046136236,0.00005063908,0.0002662551,0.00003475448,0.0001352447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006937074,0.00012378629,0.0001472749,0.00005116154,0.00014785523,0.0001494052,0.00023006918,0.00007390099,0.000017489394],"category_scores_gemma":[0.000017277125,0.00009504625,0.00006161588,0.000106996995,0.000017898334,0.00025857615,0.000023818426,0.00007399692,0.000017456568],"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.00022857646,0.00041954202,0.0021566881,0.00008407404,0.00011951327,0.00000429468,0.0015105505,0.13716686,0.0003666364,0.4130515,0.29130742,0.15358438],"study_design_scores_gemma":[0.00040329617,0.00019637239,0.00030707565,0.000018851048,0.0000039562015,0.000009738279,0.000013345679,0.98194396,0.00064373564,0.0003216209,0.015975414,0.00016260495],"about_ca_topic_score_codex":0.0000067114815,"about_ca_topic_score_gemma":0.0000022242336,"teacher_disagreement_score":0.95476645,"about_ca_system_score_codex":0.000018262112,"about_ca_system_score_gemma":0.000016741991,"threshold_uncertainty_score":0.38758734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00766245,0.00001996022,0.97673726,0.00022662096,0.00084716955,0.00021056477,0.0000014283814,0.00024647926,0.014048057],"genre_scores_gemma":[0.7208501,0.000022431745,0.2780722,0.0009295211,0.00006615514,0.000008285146,0.00000211563,0.0000031093855,0.000046055917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998283,0.00003070439,0.00045030902,0.00031308716,0.00059928425,0.0003235987],"domain_scores_gemma":[0.9988225,0.000033576158,0.00019193678,0.00034950083,0.00030695702,0.00029550542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238218,0.00016737854,0.0001671519,0.00057851704,0.00042298343,0.0006997206,0.0008880295,0.000049725837,0.000012331431],"category_scores_gemma":[0.000010881949,0.0001400754,0.00007255916,0.0012381225,0.00013177545,0.009994043,0.00035379166,0.00011623212,0.00006474215],"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.000011260689,0.000024862491,0.00023228928,0.000017546954,0.000014305213,0.0000014521322,0.01741324,0.023734208,0.000009246331,0.9352321,0.0036300397,0.019679451],"study_design_scores_gemma":[0.00038102915,0.00013372372,0.00158271,0.000024602909,0.0000030571096,0.00008150311,0.00004662432,0.97696173,0.00008995791,0.01851521,0.001981685,0.00019814837],"about_ca_topic_score_codex":0.00005287287,"about_ca_topic_score_gemma":0.0000015387159,"teacher_disagreement_score":0.9532275,"about_ca_system_score_codex":0.00003540151,"about_ca_system_score_gemma":0.00028070173,"threshold_uncertainty_score":0.724544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056009863,0.000019781626,0.9390275,0.00022495708,0.0005189798,0.000199025,2.4858204e-7,0.00007847185,0.0039211875],"genre_scores_gemma":[0.9910356,1.9734327e-7,0.0068052555,0.0002522953,0.00012600451,0.00002169346,1.9145537e-7,0.0000037612272,0.0017550051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993557,0.00000989726,0.00018361479,0.00017686027,0.000063199426,0.00021076796],"domain_scores_gemma":[0.9996106,0.00011633671,0.00003135227,0.00014042034,0.000058529815,0.000042780997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598641,0.000055831482,0.00007983221,0.00007730855,0.000047333833,0.00006117919,0.00016914586,0.000039456972,0.000010140591],"category_scores_gemma":[0.000030265282,0.00004486104,0.000033191776,0.00022419705,0.0000066591224,0.0001721443,0.000027574135,0.00004369815,0.00001254191],"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.000116604635,0.0003994579,0.002882393,0.000248675,0.00004365179,0.004178827,0.013146196,0.003220093,0.00060608407,0.7900673,0.034102745,0.15098798],"study_design_scores_gemma":[0.0011923076,0.0003037666,0.00036770638,0.00005245518,0.00000252105,0.0041427533,0.0007263242,0.94334435,0.00275411,0.0030746679,0.043639783,0.00039923214],"about_ca_topic_score_codex":0.000110092136,"about_ca_topic_score_gemma":0.0018162268,"teacher_disagreement_score":0.9401243,"about_ca_system_score_codex":0.000030098294,"about_ca_system_score_gemma":0.000018955934,"threshold_uncertainty_score":0.18293802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28391433,0.00007004484,0.71465117,0.0002195753,0.00066930876,0.00020159218,4.77462e-7,0.00004113289,0.0002323734],"genre_scores_gemma":[0.9953202,0.0000107414335,0.0034079598,0.00019214286,0.00019315403,0.000059681926,0.0000033787696,0.0000045906486,0.0008081699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928004,0.000049722265,0.000207122,0.00016819176,0.00008753967,0.0002074165],"domain_scores_gemma":[0.99964815,0.000055731023,0.0000677431,0.00010846954,0.000070527836,0.00004934784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049905,0.00007673212,0.00010191315,0.00007656307,0.000072723036,0.00007062147,0.00009910437,0.000065708264,0.0000023399691],"category_scores_gemma":[0.000025309106,0.00006851647,0.0000308376,0.00010743999,0.000008951276,0.00088736706,0.00003773342,0.00005272376,0.0000106882135],"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.0001870268,0.00039504564,0.014015363,0.00008769596,0.00004627796,0.0000013664816,0.0071641537,0.012742472,0.006916175,0.9036634,0.005227297,0.04955373],"study_design_scores_gemma":[0.00076952425,0.00017032,0.014484913,0.00003784356,0.0000024781502,0.000015714057,0.0002627024,0.9801207,0.0009602687,0.00023004573,0.0027853083,0.00016013875],"about_ca_topic_score_codex":0.000060986928,"about_ca_topic_score_gemma":0.00011385812,"teacher_disagreement_score":0.96737826,"about_ca_system_score_codex":0.000044696695,"about_ca_system_score_gemma":0.000007735146,"threshold_uncertainty_score":0.27940208},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071102366,0.000013419234,0.87597954,0.00028711077,0.0008921546,0.000108549946,3.6440784e-7,0.00024042555,0.051376082],"genre_scores_gemma":[0.99040335,6.752096e-7,0.0053853407,0.0022974934,0.00036970872,0.0000035256573,6.196854e-7,0.0000074271343,0.0015318497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988974,0.00003733707,0.00018308655,0.0003444598,0.00025817327,0.00027955216],"domain_scores_gemma":[0.9991089,0.00019891192,0.000048955564,0.0004653709,0.00005521453,0.0001226618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128186,0.00011603399,0.00011047404,0.00042725282,0.00011029013,0.00012996324,0.0005570965,0.000068600275,0.000036103324],"category_scores_gemma":[0.000035005214,0.0000813094,0.000051826348,0.000850594,0.000010780488,0.00012872562,0.000027196867,0.00017877051,0.0002019818],"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.00010530525,0.0006513752,0.0012252543,0.000024492167,0.000031137457,0.00006352974,0.0020360241,0.018150076,0.0010345994,0.36842477,0.0060058907,0.60224754],"study_design_scores_gemma":[0.003236251,0.008984981,0.03699776,0.00024080389,0.000009403428,0.00026839462,0.00064634095,0.75353014,0.0453089,0.010299714,0.13826248,0.0022148555],"about_ca_topic_score_codex":0.000031689007,"about_ca_topic_score_gemma":0.000060740404,"teacher_disagreement_score":0.919301,"about_ca_system_score_codex":0.00003052493,"about_ca_system_score_gemma":0.00001111395,"threshold_uncertainty_score":0.33157012},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3707038,0.00052021886,0.6188596,0.0038959992,0.0013535619,0.00023692298,1.6546237e-7,0.000097677505,0.0043321],"genre_scores_gemma":[0.984676,0.0000014587683,0.012073788,0.0009832348,0.0020614984,0.0000056072827,1.4114536e-7,0.000013057399,0.00018523973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980158,0.00017970546,0.00057261175,0.0002030003,0.0003541178,0.0006747241],"domain_scores_gemma":[0.9984359,0.0005345234,0.00041676153,0.00024925423,0.00022651367,0.00013703608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073492416,0.00016488333,0.0002922963,0.000115330135,0.00014072731,0.00026249618,0.0006582409,0.00007541682,0.000024460584],"category_scores_gemma":[0.00018364788,0.00011518125,0.00015291659,0.00039575296,0.000018751789,0.00027648068,0.000067989364,0.0010950031,0.000027643297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006030194,0.00017046575,0.0017548237,0.000025639709,0.00018378423,0.00011341645,0.0010941852,0.6480015,0.0012344145,0.05760971,0.01796455,0.27178723],"study_design_scores_gemma":[0.00087889255,0.00285881,0.0041032713,0.00060037157,0.000014891206,0.003918907,0.000021577333,0.9282057,0.00009808714,0.046222493,0.012678896,0.00039810376],"about_ca_topic_score_codex":0.000021471247,"about_ca_topic_score_gemma":0.000008941634,"teacher_disagreement_score":0.6139722,"about_ca_system_score_codex":0.00012017932,"about_ca_system_score_gemma":0.00018599525,"threshold_uncertainty_score":0.47573045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13153248,0.000050228693,0.8661298,0.00026581457,0.00015528871,0.00016120786,5.666609e-7,0.000071813796,0.0016327996],"genre_scores_gemma":[0.88061357,9.513932e-7,0.11925248,0.000041399308,0.00008248795,0.000001838307,2.5013185e-7,0.0000032300616,0.0000038119276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.00013700343,0.00030512147,0.0005111645,0.0004536369,0.0003076078],"domain_scores_gemma":[0.9988874,0.00020737536,0.00008919333,0.00039403696,0.0003041679,0.000117800606],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013459312,0.00013246512,0.00024903787,0.00008960877,0.00030248257,0.00021356792,0.00070727256,0.00003430356,0.000011618708],"category_scores_gemma":[0.0000244813,0.00008752264,0.00004094411,0.0005683641,0.0033462509,0.0003876109,0.00022076203,0.00011330227,0.0000013782774],"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.000042292784,0.000042107386,0.00064113527,0.000017325552,0.0000018039404,0.000002602903,0.00016180708,0.0005434662,0.00047770794,0.9885,0.000019095809,0.009550638],"study_design_scores_gemma":[0.0008836603,0.00026054936,0.00554411,0.00009222863,0.0000036810968,0.00006357089,0.000007768206,0.8765631,0.0030641544,0.11325394,0.000098897,0.00016438143],"about_ca_topic_score_codex":0.00006521736,"about_ca_topic_score_gemma":0.0000063717075,"teacher_disagreement_score":0.8760196,"about_ca_system_score_codex":0.000024516421,"about_ca_system_score_gemma":0.000049066508,"threshold_uncertainty_score":0.99936604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070432164,0.00036067184,0.92293537,0.0004407259,0.0052420665,0.00036448217,0.0000020196019,0.00004492651,0.00017755751],"genre_scores_gemma":[0.98938954,0.0000023739592,0.009153026,0.00006001892,0.0012686475,0.000039199676,0.0000015443228,0.000015139786,0.00007052683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982962,0.00019256081,0.0007660534,0.00020180643,0.0003063041,0.00023704708],"domain_scores_gemma":[0.99802035,0.00036608762,0.000805951,0.00024770063,0.0004250845,0.00013483086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001852761,0.00015821106,0.0003806644,0.00028718848,0.00026562405,0.0006537909,0.00032235318,0.00012481742,0.0000010587717],"category_scores_gemma":[0.00012862527,0.00012334711,0.00012029371,0.00019491752,0.000027757282,0.0004912522,0.00003234878,0.0004288794,0.0000012667681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017580004,0.00016966359,0.0028152724,0.0019233475,0.00038687763,0.0000938616,0.021115314,0.7220835,0.076917626,0.15174109,0.0075784754,0.0149991345],"study_design_scores_gemma":[0.0015373798,0.0004274995,0.00019258249,0.0013313397,0.0000204873,0.0015486053,0.001577836,0.9638855,0.00041583437,0.0011929165,0.027552605,0.00031741042],"about_ca_topic_score_codex":0.000020931893,"about_ca_topic_score_gemma":0.000016991646,"teacher_disagreement_score":0.91895735,"about_ca_system_score_codex":0.000029046498,"about_ca_system_score_gemma":0.00007778504,"threshold_uncertainty_score":0.63045204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39066222,0.00020457318,0.60320646,0.0000104754145,0.005234837,0.0003918652,0.0000055262576,0.00018370368,0.00010035774],"genre_scores_gemma":[0.99157596,0.0000058988453,0.0077136224,0.000019212343,0.00057959225,0.000022792457,0.0000058320334,0.00003344387,0.000043648135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958503,0.0007806813,0.001409772,0.00056936976,0.00072459516,0.000665243],"domain_scores_gemma":[0.997383,0.00023093059,0.0004507288,0.0013069746,0.00041869783,0.00020969482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023495078,0.0003766227,0.00065987767,0.00035065936,0.0005072991,0.00034445483,0.0010017715,0.0002524039,0.0000045792895],"category_scores_gemma":[0.00004156796,0.00035405345,0.0002894549,0.00090346637,0.000050895524,0.0009122059,0.000054338358,0.00046810872,0.000012744499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002529418,0.00017590141,0.00018905508,0.000055183733,0.00011916772,8.683469e-7,0.0029525368,0.9863284,0.00067257124,0.0040911254,0.000011593647,0.0053782505],"study_design_scores_gemma":[0.0004032567,0.00020249482,0.00005282208,0.00048725007,0.000046234945,0.00007686236,0.0022100336,0.9958213,0.00032439106,0.000028091736,0.000019174704,0.00032810526],"about_ca_topic_score_codex":0.0028140852,"about_ca_topic_score_gemma":0.000017159702,"teacher_disagreement_score":0.60091376,"about_ca_system_score_codex":0.0004716556,"about_ca_system_score_gemma":0.00010208009,"threshold_uncertainty_score":0.99989116},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14343846,0.000014445266,0.8557351,0.00011668402,0.00018733436,0.00014773903,1.01923945e-7,0.000037264937,0.00032287047],"genre_scores_gemma":[0.97916627,0.0000026678133,0.020608831,0.00008337287,0.000038537302,0.000012713021,4.8385687e-7,0.0000044710155,0.00008263981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923444,0.00008710908,0.00026159125,0.00020608267,0.000085276886,0.00012550034],"domain_scores_gemma":[0.9995887,0.00010008178,0.00008552352,0.00015922637,0.00003866474,0.000027756023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000590762,0.000073422685,0.00012340583,0.00011468265,0.000036092228,0.00005291204,0.00014012516,0.000037712427,0.00001104759],"category_scores_gemma":[0.0000085928905,0.00006544291,0.000020210466,0.00012314605,0.00001235614,0.00026862207,0.00005835195,0.00005319965,0.0000014432425],"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.000031296415,0.00017781739,0.004110995,0.000073465424,0.000038318347,7.544345e-7,0.013618264,0.07713719,0.021703662,0.07304085,0.0005870523,0.80948037],"study_design_scores_gemma":[0.00052092806,0.00015211274,0.00086994853,0.000023361396,0.0000014159061,0.000019216079,0.00036386636,0.994427,0.0027833278,0.00062269735,0.00013709665,0.000078989244],"about_ca_topic_score_codex":0.00054453063,"about_ca_topic_score_gemma":0.0004190465,"teacher_disagreement_score":0.91728985,"about_ca_system_score_codex":0.00003039804,"about_ca_system_score_gemma":0.000012322658,"threshold_uncertainty_score":0.26686844},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59880847,0.000039278715,0.3979186,0.0004912205,0.00040040887,0.0002688935,7.7490733e-7,0.0001926654,0.0018796956],"genre_scores_gemma":[0.99752635,0.00007081776,0.0016927933,0.0003806781,0.00016997466,0.000053299216,0.0000020964535,0.000017799586,0.0000861637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790233,0.00001409426,0.00038289593,0.000641541,0.00026011886,0.00079903385],"domain_scores_gemma":[0.99899375,0.00006434632,0.00008299645,0.00018567363,0.0001898964,0.0004833395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020161778,0.00034541366,0.0003595466,0.00059574627,0.00021201256,0.0004125007,0.00058350427,0.00018400753,0.00000902527],"category_scores_gemma":[0.000025072715,0.00033779934,0.000047877842,0.0008080446,0.000037077465,0.00053583074,0.000059056176,0.0006385592,0.000023633504],"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.00007713694,0.00013768427,0.03102784,0.00010590883,0.00006623189,0.00016204703,0.0037650692,0.079739384,0.0001486229,0.6796429,0.0008951666,0.20423196],"study_design_scores_gemma":[0.00031713664,0.0003444593,0.055011466,0.0002205662,0.0000019852635,0.00008723823,0.000004866056,0.94323856,0.000041481147,0.00019878571,0.00015115806,0.00038227133],"about_ca_topic_score_codex":0.0011934356,"about_ca_topic_score_gemma":0.00021550733,"teacher_disagreement_score":0.8634992,"about_ca_system_score_codex":0.00020126448,"about_ca_system_score_gemma":0.0002319457,"threshold_uncertainty_score":0.9999074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017838081,0.00011151012,0.975778,0.000049133283,0.000060463066,0.00033600326,0.0000038053277,0.000039985134,0.005783048],"genre_scores_gemma":[0.8107544,0.000025407639,0.18910517,0.000035529596,0.000014381519,0.000029281973,0.0000033357544,0.0000046737637,0.000027831933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933815,0.000008784538,0.00034043577,0.00008396627,0.00011519155,0.00011346934],"domain_scores_gemma":[0.9991638,0.0001155425,0.00025113017,0.00037070524,0.00007025161,0.00002858146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021861916,0.00008216797,0.00015441256,0.000059811042,0.00012406072,0.00011155685,0.00027072043,0.000048907405,0.000005854231],"category_scores_gemma":[0.000015969465,0.00007206717,0.000029377174,0.00012248626,0.000040556064,0.00038788686,0.00008614131,0.000043744298,0.0000052329665],"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.00000261651,0.00003876331,0.0000063026814,0.00045957242,0.000022940629,7.008958e-8,0.013880256,0.0006705431,0.0013124979,0.9721498,0.00055680313,0.010899863],"study_design_scores_gemma":[0.00020324723,0.000028553373,0.0000066348016,0.000086584936,0.000009308985,0.000009810159,0.0004886474,0.9864213,0.000979583,0.010948815,0.00071460876,0.00010291717],"about_ca_topic_score_codex":0.000005118908,"about_ca_topic_score_gemma":0.0000013886947,"teacher_disagreement_score":0.98575073,"about_ca_system_score_codex":0.000020172545,"about_ca_system_score_gemma":0.0000068227264,"threshold_uncertainty_score":0.2938814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015312199,0.0000145906715,0.98323375,0.006543364,0.005992462,0.00016847921,0.0000030194276,0.00032004807,0.0021930812],"genre_scores_gemma":[0.9882712,0.000022993818,0.0040826565,0.006624853,0.00013900893,0.000014839281,4.4423442e-7,0.000014507293,0.00082950795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861056,0.00010582541,0.00024475783,0.0004336203,0.0002939113,0.00031132164],"domain_scores_gemma":[0.9990298,0.00014873782,0.00006620571,0.00056551344,0.000051141862,0.00013858828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011195459,0.00020759452,0.00019017067,0.00022700935,0.00031342104,0.00014787847,0.0005964878,0.000079018,0.00012424831],"category_scores_gemma":[4.7398277e-7,0.00019916621,0.00016733288,0.00043987404,0.000028996905,0.00019894182,0.0000037964237,0.00026471604,0.0003260092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027538445,0.000824659,0.000004868648,0.000010631287,0.00016121475,0.00006976219,0.0016126876,0.64342606,0.00010531765,0.0067613455,0.1730323,0.17396362],"study_design_scores_gemma":[0.00057613605,0.0004738329,0.000005459981,0.00005872633,0.000007982099,0.000038770388,0.000034731427,0.93688536,0.001257938,0.000033822704,0.06036772,0.00025954883],"about_ca_topic_score_codex":0.000043637527,"about_ca_topic_score_gemma":0.0000102846925,"teacher_disagreement_score":0.98674,"about_ca_system_score_codex":0.00016806138,"about_ca_system_score_gemma":0.000010649376,"threshold_uncertainty_score":0.8121763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.151435,0.0036606463,0.84325683,0.0010990041,0.0003163145,0.00006891126,0.000032131244,0.00001734673,0.00011382994],"genre_scores_gemma":[0.994077,0.00019225272,0.0053374814,0.000046782938,0.00031193433,3.4751793e-7,0.000011325459,0.0000041275985,0.000018710782],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986132,0.000120798344,0.00058729877,0.00024376783,0.00020575787,0.00022921953],"domain_scores_gemma":[0.999011,0.00019645956,0.00031789296,0.00026584713,0.0000703546,0.00013847738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008093539,0.00012667547,0.00033352897,0.00008620736,0.00013866123,0.00022439973,0.0005398532,0.00004925408,0.000004342726],"category_scores_gemma":[0.000058383066,0.00010218283,0.000034981073,0.00020983709,0.00004311308,0.0004525094,0.00029889995,0.00022457614,0.0000010963126],"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.00012196829,0.0005442335,0.6162103,0.00041273946,0.0005679972,0.00068934733,0.005391991,0.03289097,0.00023778829,0.02294535,0.102122165,0.21786517],"study_design_scores_gemma":[0.0012714952,0.00016464732,0.05590341,0.00037467328,0.0000182172,0.00029578942,0.00025066463,0.92485446,0.0000039726683,0.0009532548,0.015681485,0.00022793813],"about_ca_topic_score_codex":0.00002378366,"about_ca_topic_score_gemma":0.000016695383,"teacher_disagreement_score":0.8919635,"about_ca_system_score_codex":0.000031582196,"about_ca_system_score_gemma":0.000012269588,"threshold_uncertainty_score":0.4166895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22177024,0.0000107538335,0.7620368,0.00058539293,0.00090200774,0.00040699905,0.0000012137391,0.00009581027,0.014190786],"genre_scores_gemma":[0.99418956,0.0000012958133,0.0037299155,0.0013033969,0.00015414265,0.000045914672,1.8053204e-7,0.0000073138235,0.0005682559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845874,0.00020347902,0.00041431354,0.0003785931,0.0002199942,0.00032484884],"domain_scores_gemma":[0.99840474,0.00028508328,0.00014731512,0.00088460196,0.00018920568,0.00008907567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012315501,0.00013898626,0.00025959438,0.000038596867,0.00014317536,0.00004998766,0.00088599883,0.000034092263,0.000050836843],"category_scores_gemma":[0.00006285589,0.00008696654,0.00010382658,0.00032686532,0.00005111694,0.0001400473,0.00012632832,0.00015108034,0.000051783973],"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.0005183713,0.00037232318,0.0038872063,0.00007229514,0.0001366009,0.000023254162,0.0048117875,0.012558951,0.0032856169,0.93341196,0.03214164,0.008779986],"study_design_scores_gemma":[0.00065428816,0.0007098362,0.002370467,0.00024134967,0.000011442021,0.000030669868,0.00017486233,0.9615136,0.025091924,0.004368229,0.004356683,0.00047665002],"about_ca_topic_score_codex":0.00018039662,"about_ca_topic_score_gemma":0.00006427212,"teacher_disagreement_score":0.94895464,"about_ca_system_score_codex":0.000029874414,"about_ca_system_score_gemma":0.000035194116,"threshold_uncertainty_score":0.35463926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059026037,0.0000054397165,0.9612196,0.00013265535,0.0012451053,0.00007699191,3.2563566e-8,0.00021331913,0.031204225],"genre_scores_gemma":[0.9743741,1.7700754e-7,0.023023272,0.0010802695,0.0011564599,0.000004762038,7.601542e-7,0.000006461962,0.0003537363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990817,0.00008468724,0.00022131216,0.00024645196,0.00014367634,0.00022222596],"domain_scores_gemma":[0.9991485,0.00036901888,0.00007138679,0.00030411803,0.000058026828,0.000048963953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005311553,0.00009023812,0.000108103566,0.000038576887,0.0002227955,0.00025417688,0.00026811595,0.000049258688,0.000036511152],"category_scores_gemma":[0.000032595286,0.00007404744,0.000047058267,0.00018326989,0.00000534541,0.00024263952,0.00006397331,0.00009118787,0.00011419165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012438519,0.0000050400818,0.00020574752,0.0000017807413,0.0000032700373,1.5585283e-7,0.0000652682,0.8238387,0.000035866695,0.12207751,0.00034773926,0.05341766],"study_design_scores_gemma":[0.00008853286,0.00006898032,0.0003126115,0.000019446292,6.781279e-7,0.0000024099165,0.000003490548,0.98920685,0.000038586095,0.00355807,0.006600483,0.00009987817],"about_ca_topic_score_codex":0.000018084907,"about_ca_topic_score_gemma":0.000014286076,"teacher_disagreement_score":0.9684715,"about_ca_system_score_codex":0.00001899876,"about_ca_system_score_gemma":0.0000053961417,"threshold_uncertainty_score":0.3019567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040845778,0.00008413205,0.95845884,0.00021210068,0.000072896095,0.00015610554,0.0000012185327,0.000011780092,0.00015713353],"genre_scores_gemma":[0.6763539,0.0000034949246,0.3232079,0.0000977072,0.00031895278,0.0000022268168,0.0000024115154,0.0000037501832,0.000009650728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989519,0.00013767109,0.0005312376,0.00009322443,0.00016814802,0.00011777989],"domain_scores_gemma":[0.99885446,0.00019641312,0.00031970692,0.00025304643,0.00033528663,0.000041080122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018103757,0.0000671592,0.00022481191,0.00022774101,0.00014394023,0.000059335714,0.00061160495,0.000023156686,0.0000030716153],"category_scores_gemma":[0.000014365255,0.000044655666,0.00016865142,0.00045073184,0.000018766643,0.00041541635,0.000050536397,0.00009068769,2.1914575e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075954526,0.000048324087,0.00003633357,0.0000054472207,0.0001454905,4.6949367e-8,0.0008748737,0.9866201,0.00007035093,0.0009091156,0.00006942178,0.011212899],"study_design_scores_gemma":[0.00018461615,0.00006216899,0.00003983969,0.00000835653,0.00015583925,0.00006958466,0.00019116337,0.99879855,0.00016232481,0.00003919001,0.00023854568,0.00004981086],"about_ca_topic_score_codex":0.000008324549,"about_ca_topic_score_gemma":0.0000023101045,"teacher_disagreement_score":0.6355081,"about_ca_system_score_codex":0.00003095243,"about_ca_system_score_gemma":0.000022840202,"threshold_uncertainty_score":0.18210052},"labels":[],"label_agreement":null},{"id":"W2095444497","doi":"10.1142/s0219265900000020","title":"IMPROVED BOUNDS FOR GOSSIPING IN MESH BUS NETWORKS","year":2000,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Gossip; Computer science; Bus network; Computer network; Node (physics); Dimension (graph theory); Protocol (science); Address bus; Distributed computing; Control bus; System bus; Mathematics; Combinatorics; Computer hardware","score_opus":0.010290717569064384,"score_gpt":0.23999110254324385,"score_spread":0.22970038497417947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095444497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029726226,0.0008722814,0.9602503,0.00051445456,0.007099173,0.00031714735,4.5784137e-7,0.000070005546,0.0011499148],"genre_scores_gemma":[0.9923285,0.00029552795,0.0029906812,0.00067943346,0.0028158145,0.000031917614,0.0000013970836,0.000029950117,0.0008267697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971293,0.00021849498,0.0014693167,0.00037692615,0.00021728624,0.0005886568],"domain_scores_gemma":[0.99777025,0.00039787166,0.0008602468,0.0003759556,0.00042107314,0.00017458954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019220238,0.00028080284,0.0005851245,0.00037416574,0.0002013351,0.0004700359,0.00082621735,0.0002927654,0.00013174367],"category_scores_gemma":[0.00010098561,0.00024834552,0.00044637034,0.00071312836,0.000040915824,0.0012107487,0.000057335223,0.00072877895,0.000004394002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007018079,0.00023790299,0.00060770777,0.000031049945,0.000220623,0.00005146997,0.0008776571,0.6895557,0.00017320753,0.005992866,0.018042507,0.28350753],"study_design_scores_gemma":[0.0014786874,0.00068718806,0.00029879098,0.00034487617,0.000014832834,0.0006089331,0.00013337297,0.9796799,0.00005061704,0.00063015794,0.01579817,0.00027449694],"about_ca_topic_score_codex":0.000049621332,"about_ca_topic_score_gemma":0.00021249264,"teacher_disagreement_score":0.96260226,"about_ca_system_score_codex":0.00029176607,"about_ca_system_score_gemma":0.00007095517,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08397562,0.00002228257,0.91245794,0.00026710235,0.0022311066,0.00011546282,2.9175135e-7,0.00016814267,0.0007620594],"genre_scores_gemma":[0.9907072,0.00007540044,0.008495363,0.00036955913,0.00022336666,0.0000140299735,4.367487e-7,0.000008336542,0.000106288324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989472,0.00006076123,0.00024224137,0.00032186293,0.00016325238,0.00026469748],"domain_scores_gemma":[0.99949026,0.00008165521,0.00003932017,0.0002463622,0.000046774763,0.00009560413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019677452,0.00013599088,0.0001427804,0.00009945748,0.00038653272,0.00019108185,0.0002228474,0.00006558752,0.0000099905055],"category_scores_gemma":[5.369505e-7,0.00013237829,0.000057013713,0.00025415551,0.000023896995,0.00033841538,0.0000029847333,0.0002371502,0.000018562481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001697699,0.000015351625,0.000026937267,0.0000042432034,0.000014826874,0.00000414323,0.0002016756,0.906016,0.000018344945,0.0013691711,0.00007893575,0.0922334],"study_design_scores_gemma":[0.00025043782,0.00013411611,0.00005293531,0.00008025537,0.000003914459,0.00011080906,0.000008890426,0.9986774,0.00009713121,0.00013153076,0.0003045374,0.00014804298],"about_ca_topic_score_codex":0.000021224123,"about_ca_topic_score_gemma":0.000014385872,"teacher_disagreement_score":0.9067316,"about_ca_system_score_codex":0.00003851121,"about_ca_system_score_gemma":0.00001716323,"threshold_uncertainty_score":0.539823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076571587,0.00010850773,0.74754024,0.0007132387,0.0014039684,0.000094344716,8.244267e-8,0.00011760576,0.24236487],"genre_scores_gemma":[0.98323715,6.92539e-7,0.004902363,0.00046955922,0.00038422266,0.000009085294,2.4399705e-7,0.0000023539594,0.010994351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934953,0.000039164017,0.00016248462,0.00016787641,0.000087550616,0.0001934108],"domain_scores_gemma":[0.9996768,0.00004107492,0.00002796348,0.00021137229,0.000023619936,0.000019154008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021709582,0.00005528584,0.00007891507,0.000028137976,0.000037077738,0.00007891872,0.0002927686,0.000035567573,0.000075443],"category_scores_gemma":[0.00000242141,0.000044979177,0.000024529958,0.00028768316,0.000008611752,0.00021912024,0.000053282558,0.00006240594,0.00013606438],"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":[9.67948e-7,0.00002196811,0.005475936,0.0000021624205,0.0000017151611,0.000018494231,0.000047757727,0.0123823285,0.000046281228,0.805218,0.17561117,0.0011732308],"study_design_scores_gemma":[0.00062046835,0.00009344561,0.019891638,0.000063256164,0.0000015484376,0.0000975361,0.000033447548,0.6250109,0.00062123785,0.08893926,0.2641073,0.0005199623],"about_ca_topic_score_codex":0.00088866835,"about_ca_topic_score_gemma":0.0010270196,"teacher_disagreement_score":0.97558,"about_ca_system_score_codex":0.000022304785,"about_ca_system_score_gemma":0.000012751026,"threshold_uncertainty_score":0.18341976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034970895,0.00005253635,0.8911473,0.0046006166,0.0008410042,0.000066560264,8.426604e-8,0.00018605751,0.10275609],"genre_scores_gemma":[0.930485,8.853771e-7,0.016944198,0.0026337889,0.00028565453,0.000004921464,1.84073e-7,0.000005746776,0.049639624],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992095,0.00003228978,0.00016624513,0.00024194576,0.00015597789,0.00019402447],"domain_scores_gemma":[0.9993381,0.00004112421,0.000037910122,0.00045550583,0.000024900088,0.000102496066],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011162488,0.000086723325,0.0001016288,0.00004524919,0.000062414714,0.00020139742,0.00042678425,0.000046630143,0.001643065],"category_scores_gemma":[0.0000055440273,0.00006655601,0.00007343124,0.00020537194,0.000005882216,0.00023132648,0.00005086523,0.00006564192,0.0009554856],"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.0000029729645,0.000051005238,0.00066053105,0.000008768565,0.000016101965,0.00002401014,0.0007876192,0.00044165918,0.00004553401,0.17450626,0.7705218,0.052933715],"study_design_scores_gemma":[0.0003358344,0.000060803854,0.0002909307,0.000017271075,0.0000014617108,0.000014654628,0.0000068016584,0.7489395,0.00013525102,0.00067979324,0.24936536,0.00015232783],"about_ca_topic_score_codex":0.00018850784,"about_ca_topic_score_gemma":0.00009478659,"teacher_disagreement_score":0.9301353,"about_ca_system_score_codex":0.000021515529,"about_ca_system_score_gemma":0.000013405608,"threshold_uncertainty_score":0.9998224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13117544,0.00001765165,0.86586344,0.00021452713,0.00030245495,0.000094800445,2.6038686e-7,0.000073009025,0.0022584433],"genre_scores_gemma":[0.99923855,0.000001471273,0.00027310292,0.00026271853,0.00006783027,0.000018410557,0.000004120953,0.0000054709303,0.00012833122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898326,0.00024168627,0.0002967099,0.00021038717,0.00014398065,0.00012394373],"domain_scores_gemma":[0.99937725,0.00023048586,0.0000784807,0.0002484663,0.000035704943,0.000029628443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004359054,0.0000972392,0.00015718481,0.00019907922,0.000025146786,0.000035824607,0.00021371934,0.00005932372,0.000033441986],"category_scores_gemma":[0.000032196105,0.00007417256,0.0000585996,0.00032692341,0.000010977185,0.00019605653,0.000016631066,0.000046810772,0.000012510187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004829079,0.000072600094,0.00015511885,0.00001878053,0.000003861762,0.0000010913712,0.00017069631,0.72216725,0.00010062564,0.022121409,0.00044739514,0.25469285],"study_design_scores_gemma":[0.00048756547,0.00061711,0.00005177778,0.00007967293,0.0000012435341,0.000001207864,0.000004693313,0.978406,0.018540734,0.0000138103715,0.0017177875,0.00007839927],"about_ca_topic_score_codex":0.000059749207,"about_ca_topic_score_gemma":0.0004640721,"teacher_disagreement_score":0.8680631,"about_ca_system_score_codex":0.00006970161,"about_ca_system_score_gemma":0.000014370001,"threshold_uncertainty_score":0.30246693},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007140015,0.000112606904,0.95122564,0.00044217583,0.0021243077,0.00025053433,3.479884e-7,0.00011837036,0.038585976],"genre_scores_gemma":[0.95443624,0.0000046908776,0.02742537,0.00037690034,0.0001624306,0.000066532535,6.509012e-7,0.000008926061,0.017518267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989672,0.000036377493,0.00025339605,0.00031525068,0.0001322144,0.00029556538],"domain_scores_gemma":[0.99935406,0.000051898613,0.0000580628,0.00037808443,0.00009396699,0.00006389873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059076917,0.00010199911,0.00013557439,0.00004070634,0.00016397527,0.00013457953,0.0002511275,0.000046792367,0.00011850499],"category_scores_gemma":[0.000036054993,0.000081498554,0.00008253067,0.00014504361,0.000008515579,0.00028215395,0.000034384233,0.00004518218,0.00005086665],"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.0000063532248,0.00008331494,0.00026549684,0.000042771342,0.000055358298,0.0000022732702,0.0010816493,0.0019848817,0.0072988346,0.8622954,0.120873764,0.0060099293],"study_design_scores_gemma":[0.0010213077,0.00037385817,0.000069547685,0.000111519315,0.000013575461,0.00005987849,0.00042940525,0.2809797,0.07923662,0.011793476,0.62524366,0.0006674682],"about_ca_topic_score_codex":0.00013096919,"about_ca_topic_score_gemma":0.00004066038,"teacher_disagreement_score":0.9472962,"about_ca_system_score_codex":0.00005908289,"about_ca_system_score_gemma":0.00003672889,"threshold_uncertainty_score":0.33234146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041615363,0.00020555654,0.95241255,0.00022913613,0.0024835472,0.00031292194,8.8899594e-7,0.0001984972,0.0025415327],"genre_scores_gemma":[0.9950441,0.000039686438,0.0030698606,0.00059256103,0.00023023845,0.00007820231,0.0000025998595,0.000015149234,0.0009275904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998768,0.000110721296,0.0003059011,0.00042848397,0.00006721251,0.00031971605],"domain_scores_gemma":[0.99907815,0.00026523252,0.000084702515,0.00034072498,0.00013343211,0.00009777228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005094021,0.00019164961,0.00022492305,0.00011027665,0.0001585858,0.000273496,0.00026251673,0.00012011109,0.000021668398],"category_scores_gemma":[0.000065273,0.00013805032,0.000100912344,0.00019532058,0.000030465972,0.00040576258,0.00007746598,0.00012679119,0.0000069964344],"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.0000706388,0.00015902617,0.00137395,0.00006856257,0.00021109407,0.000004074764,0.0029536039,0.004325145,0.0009825146,0.8166094,0.022255262,0.15098673],"study_design_scores_gemma":[0.00053514197,0.00022400742,0.00035543364,0.00004576421,0.0000044199887,0.0000653017,0.00033227648,0.9698429,0.0012161197,0.00592471,0.021200757,0.00025318435],"about_ca_topic_score_codex":0.000023869934,"about_ca_topic_score_gemma":0.00010482568,"teacher_disagreement_score":0.96551776,"about_ca_system_score_codex":0.000034983503,"about_ca_system_score_gemma":0.000011020948,"threshold_uncertainty_score":0.5629529},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04477888,0.000048304493,0.94580555,0.000036158413,0.00016704405,0.00008617926,0.0000010199448,0.00003792463,0.009038956],"genre_scores_gemma":[0.98782885,0.000015574222,0.011879194,0.000094553056,0.000017709819,0.000010190011,0.0000016803663,0.0000036475658,0.00014859144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922335,0.000046117126,0.00022677223,0.0002055185,0.0000994836,0.0001987492],"domain_scores_gemma":[0.9995258,0.000023039922,0.00007949215,0.00024838554,0.000087927416,0.00003534607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021033721,0.000085477215,0.0001695011,0.000044230306,0.00003297915,0.00001737221,0.0002442191,0.00006824478,0.00001466973],"category_scores_gemma":[0.000003913365,0.000064896856,0.000037581594,0.00025199013,0.000036686786,0.00021472732,0.00005992589,0.00010014938,0.0000014256141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005956107,0.00009140204,0.0029353162,0.000007528902,0.000020675407,0.000011179496,0.0016977263,0.7226362,0.00006931294,0.2702933,0.00033889487,0.0018388974],"study_design_scores_gemma":[0.00027643453,0.00011666463,0.00024863088,0.00002313439,0.0000018853879,0.000015993923,0.00005316177,0.9983266,0.0001718833,0.00064190105,0.000034279223,0.00008945968],"about_ca_topic_score_codex":0.0008346652,"about_ca_topic_score_gemma":0.0004766182,"teacher_disagreement_score":0.94304997,"about_ca_system_score_codex":0.00004506472,"about_ca_system_score_gemma":0.000041030344,"threshold_uncertainty_score":0.2646417},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012361704,0.0002442276,0.6426521,0.0039484836,0.0016418988,0.000058770107,3.7916315e-8,0.00016621487,0.35005212],"genre_scores_gemma":[0.9636935,0.000008424833,0.0006334198,0.00046353365,0.00013936956,0.0000042639604,2.205343e-8,0.0000020454015,0.035055395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955416,0.000030059977,0.00009750465,0.00010408108,0.00008720468,0.00012696742],"domain_scores_gemma":[0.9995669,0.000071358,0.000021115116,0.00028317195,0.000032285945,0.000025180896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014712449,0.000038164017,0.00003737988,0.000010797549,0.00018149008,0.00024448519,0.00036845639,0.00001882652,0.0000870217],"category_scores_gemma":[0.00000671787,0.00002092721,0.00002934238,0.0001142392,0.000010033929,0.00012254094,0.000052591713,0.000041510724,0.0003971339],"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":[4.4939074e-7,0.000031548203,0.000051583258,0.0000010731571,0.000008175076,0.0000034893465,0.00047237606,0.00007732387,0.00020855591,0.66765547,0.2116894,0.119800575],"study_design_scores_gemma":[0.000058704118,0.000041675063,0.00003911714,0.0000037541097,3.878282e-7,0.000028444769,0.00004568554,0.43141517,0.0002878733,0.0012564693,0.5667566,0.00006614262],"about_ca_topic_score_codex":0.000023482038,"about_ca_topic_score_gemma":0.000065675755,"teacher_disagreement_score":0.96245736,"about_ca_system_score_codex":0.000013313542,"about_ca_system_score_gemma":0.0000018031337,"threshold_uncertainty_score":0.5104485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008700295,0.000017400162,0.82877743,0.000325658,0.00058599573,0.000018552999,1.7765693e-8,0.00012325877,0.16145137],"genre_scores_gemma":[0.9817918,0.000002900312,0.004486061,0.00044356452,0.00008579044,0.0000017442818,4.8223104e-8,0.000001074427,0.013187005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999729,0.000011000839,0.00005554964,0.000080071244,0.000055882923,0.00006849555],"domain_scores_gemma":[0.99978244,0.000011363216,0.000009402014,0.00015544026,0.000018547937,0.000022779217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004484458,0.000024147412,0.000033551725,0.00001730107,0.0000614159,0.000017815353,0.00017662212,0.000012680035,0.000049544808],"category_scores_gemma":[0.0000024567917,0.000018177581,0.000019458761,0.00008076777,0.0000065182835,0.00012247999,0.0000305353,0.000022127917,0.00029280622],"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":[6.9896697e-7,0.00001809536,0.0011491001,0.0000012371812,0.0000055432156,0.0000344708,0.0006198934,0.00013310455,0.00014327923,0.83460027,0.1576546,0.005639696],"study_design_scores_gemma":[0.00029883764,0.00010858898,0.005464317,0.00000841853,5.8715875e-7,0.00091587886,0.000034635515,0.34648234,0.0018981375,0.0025426017,0.64198756,0.0002580783],"about_ca_topic_score_codex":0.000018110639,"about_ca_topic_score_gemma":0.0000031939219,"teacher_disagreement_score":0.97309154,"about_ca_system_score_codex":0.000005139935,"about_ca_system_score_gemma":0.000007818147,"threshold_uncertainty_score":0.3763529},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004106394,0.000028350301,0.6670989,0.0026266328,0.0012037437,0.00020367921,3.835895e-7,0.0002128441,0.32451907],"genre_scores_gemma":[0.98823315,2.8359358e-7,0.00074584223,0.004200306,0.00084954017,0.000019924133,8.928445e-7,0.0000070596484,0.00594303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891025,0.000117595155,0.00018646453,0.00026188765,0.00022372542,0.0003001004],"domain_scores_gemma":[0.9991022,0.00029176293,0.00005671808,0.000477804,0.000035500376,0.00003603813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040122637,0.000115117444,0.000114351686,0.000030283372,0.0002701405,0.00024947617,0.0004780453,0.00004678633,0.00015849748],"category_scores_gemma":[0.000009205658,0.000068325666,0.00007309926,0.00027044956,0.000019059684,0.0000960558,0.00004975262,0.000136887,0.00017722373],"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.000004952004,0.000024038754,0.00020906384,9.3897813e-7,0.000003296986,0.0000025835614,0.000031107455,0.41731516,0.000007947214,0.48574156,0.09599984,0.0006595295],"study_design_scores_gemma":[0.00018657769,0.00010157711,0.00048838434,0.00005251816,0.0000010782135,0.0000025561644,0.000011297555,0.9660664,0.00040092543,0.0012577935,0.031317677,0.00011317678],"about_ca_topic_score_codex":0.00020496814,"about_ca_topic_score_gemma":0.00006854253,"teacher_disagreement_score":0.98412675,"about_ca_system_score_codex":0.000037767564,"about_ca_system_score_gemma":0.000018176945,"threshold_uncertainty_score":0.27862397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5208394,0.0000369666,0.47638902,0.00007583508,0.00027287743,0.0001163486,0.0000029796997,0.00006847826,0.002198101],"genre_scores_gemma":[0.9969483,0.0000018560272,0.002325153,0.00026780547,0.00003088831,0.000005535254,0.000002796571,0.00000672287,0.0004109652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998777,0.00016438453,0.00039836526,0.0002846727,0.00014185133,0.00023372496],"domain_scores_gemma":[0.99916226,0.000064111635,0.0001750954,0.00029774784,0.00020096028,0.00009981802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058517774,0.00012744447,0.0002463256,0.00006433851,0.00007343139,0.00015101401,0.00027283805,0.000072696545,0.000040200317],"category_scores_gemma":[0.00001606367,0.00009356591,0.00004057129,0.00018409983,0.000023503268,0.00040514543,0.00003209961,0.00008689455,0.0000054454244],"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.00019913723,0.00078211556,0.23028567,0.0005716939,0.0005875419,0.00023411718,0.021706548,0.0025934232,0.009332859,0.62690824,0.0016104033,0.10518827],"study_design_scores_gemma":[0.0015785922,0.00040164092,0.0028578464,0.000090780006,0.000013998628,0.00026963244,0.0026357938,0.9829233,0.00437006,0.0012752451,0.0032281019,0.00035496496],"about_ca_topic_score_codex":0.00051414326,"about_ca_topic_score_gemma":0.00057515374,"teacher_disagreement_score":0.98032993,"about_ca_system_score_codex":0.000012569631,"about_ca_system_score_gemma":0.000029997538,"threshold_uncertainty_score":0.3815507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022245008,0.00005618616,0.972496,0.0011556013,0.0028036134,0.0008876744,0.0000028730456,0.00019495918,0.00015810899],"genre_scores_gemma":[0.9571049,0.00001715021,0.040958416,0.001165629,0.000505017,0.00018340994,0.0000010698099,0.000019680652,0.00004472306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982338,0.00024181251,0.00033884187,0.0005216134,0.00029143426,0.0003725307],"domain_scores_gemma":[0.9986986,0.00065961824,0.00009298431,0.0003772286,0.000061217295,0.000110377805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008600354,0.0002468726,0.00023151025,0.00021008347,0.00041456195,0.00018444512,0.00038242072,0.00009463642,0.000010138756],"category_scores_gemma":[0.00000394209,0.0002232944,0.00013842397,0.0002395412,0.000042388267,0.00023185482,0.0000030353954,0.00023606948,0.0000144449905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005260001,0.00003624706,0.000001517609,0.000006418762,0.000030437664,2.9038324e-7,0.0003960696,0.5876987,0.000028728191,0.00018239199,0.0009783471,0.41058823],"study_design_scores_gemma":[0.0008646614,0.0008330259,0.00009445986,0.00013499612,0.000020482486,0.000047783236,0.000010806202,0.99358,0.0022318496,0.00015309383,0.0017781208,0.00025072272],"about_ca_topic_score_codex":0.000004762092,"about_ca_topic_score_gemma":0.000022750117,"teacher_disagreement_score":0.9348599,"about_ca_system_score_codex":0.00011041035,"about_ca_system_score_gemma":0.0000442424,"threshold_uncertainty_score":0.9105681},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003448349,0.00012947964,0.9193162,0.0019215484,0.0034965554,0.0001214709,1.3227759e-7,0.0004319274,0.071134344],"genre_scores_gemma":[0.9834116,0.000013519993,0.0065510753,0.0013344426,0.0008466475,0.000020191208,4.97753e-7,0.000008543048,0.007813474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986978,0.000117324584,0.00029533022,0.00035346593,0.00018431738,0.00035172756],"domain_scores_gemma":[0.9992727,0.00009311199,0.000053274605,0.00041650733,0.000057919107,0.000106471736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026890668,0.00012833996,0.00016641834,0.000067160865,0.00017700082,0.00022413064,0.00046650457,0.00008265276,0.0005860798],"category_scores_gemma":[0.000016000962,0.0001025769,0.00010854476,0.0003705033,0.000022845974,0.00036946347,0.0001254972,0.00019914657,0.000599925],"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.0000079184065,0.00011262308,0.00029693643,0.0000094952975,0.00004481697,0.00003381253,0.0013152098,0.0076279016,0.00004870347,0.6375512,0.24427238,0.10867904],"study_design_scores_gemma":[0.00018683805,0.00009573177,0.00007245664,0.000024223424,0.0000015706764,0.00012995157,0.000021241965,0.88250244,0.000024788573,0.002499986,0.11429124,0.00014954309],"about_ca_topic_score_codex":0.000039259776,"about_ca_topic_score_gemma":0.00005198869,"teacher_disagreement_score":0.97996324,"about_ca_system_score_codex":0.000038218383,"about_ca_system_score_gemma":0.0000048589936,"threshold_uncertainty_score":0.7711022},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005521171,0.000045746834,0.99171245,0.0014926083,0.00008959433,0.000085790154,5.2631265e-8,0.000014726172,0.0010378382],"genre_scores_gemma":[0.9842796,0.0000058425894,0.015192409,0.00013173689,0.000043993445,0.00000574376,4.5826805e-8,9.850223e-7,0.00033964252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996898,0.00003934293,0.000099200864,0.000060510232,0.000050010236,0.00006109676],"domain_scores_gemma":[0.99978155,0.00005476248,0.00002800028,0.00009919869,0.000023566636,0.000012915266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002471442,0.000024656223,0.000031562275,0.000011163641,0.000060332066,0.00006107047,0.00009808062,0.000008465174,0.000009012664],"category_scores_gemma":[0.0000010042542,0.0000141642395,0.000011040949,0.00004082493,0.000007749318,0.00012866665,0.000021998172,0.000013468888,0.0000032827693],"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.00000275683,0.000007123351,0.0007723914,0.000002839865,0.000017030225,3.509307e-7,0.002841989,0.0004301186,0.0004306755,0.4482659,0.012578028,0.5346508],"study_design_scores_gemma":[0.0005215968,0.00020887649,0.005411315,0.000009849666,0.0000042739653,0.000038000177,0.0011536962,0.9114816,0.01209951,0.0018522114,0.06707694,0.00014213484],"about_ca_topic_score_codex":0.000057547022,"about_ca_topic_score_gemma":0.0001660161,"teacher_disagreement_score":0.97875845,"about_ca_system_score_codex":0.0000061901296,"about_ca_system_score_gemma":0.000007415264,"threshold_uncertainty_score":0.05889039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005710931,0.00006595066,0.97893316,0.00867282,0.0046807174,0.00031278166,0.0000025433067,0.00035156184,0.0012695531],"genre_scores_gemma":[0.9133149,0.0000029271866,0.08163426,0.0031131639,0.0012697647,0.000068159214,0.0000050747235,0.000014435645,0.0005773608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987796,0.000029948662,0.00028821742,0.0004191237,0.00015787059,0.00032524092],"domain_scores_gemma":[0.9991164,0.00008358898,0.00008119144,0.0004970661,0.00014184837,0.00007988682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275372,0.00016791187,0.00021354684,0.000075994016,0.00016520695,0.00020777168,0.0006049008,0.00011496769,0.00004522535],"category_scores_gemma":[0.000015810265,0.00013102811,0.00017520167,0.00022428118,0.000020149746,0.00035199075,0.0000654722,0.00010746511,0.000082516395],"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.000015696194,0.00006576586,0.0000124879425,0.000025335316,0.000026185331,0.0000056020085,0.0004361342,0.0073869275,0.00021797045,0.97253966,0.009253022,0.010015205],"study_design_scores_gemma":[0.010991078,0.0024435185,0.0002941723,0.0003360862,0.00003686338,0.00014470438,0.001418009,0.33138934,0.04754541,0.15625839,0.44707337,0.0020690504],"about_ca_topic_score_codex":0.00015687129,"about_ca_topic_score_gemma":0.00024051382,"teacher_disagreement_score":0.9076039,"about_ca_system_score_codex":0.0001042453,"about_ca_system_score_gemma":0.000092850096,"threshold_uncertainty_score":0.53431714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023604205,0.000048556256,0.9656678,0.00022738495,0.0013362205,0.0001565873,0.0000011989853,0.00016023796,0.00879783],"genre_scores_gemma":[0.99551386,0.000003072882,0.0033259364,0.00068670977,0.00008299289,0.000014336902,0.0000037527218,0.000008980067,0.00036036602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983753,0.00022879527,0.0004196239,0.00038828456,0.0001647836,0.00042321126],"domain_scores_gemma":[0.9991665,0.00018113284,0.00007838752,0.0004237022,0.000068792375,0.00008151161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007235188,0.00015484603,0.00022540626,0.00008544415,0.000108731896,0.00020331946,0.0003536683,0.00011505663,0.00004352757],"category_scores_gemma":[0.00006576321,0.00013309154,0.00009369824,0.0006136068,0.000012506885,0.00025788095,0.00004446795,0.0002070355,0.000026412135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013867473,0.00013773913,0.005871866,0.000009706083,0.000019656482,0.00006715809,0.00012239942,0.9276309,0.000074142736,0.056500617,0.0055412515,0.0040106843],"study_design_scores_gemma":[0.0003979031,0.00004271126,0.0006234044,0.0000520604,0.0000015191314,0.00003324906,0.00004940368,0.9936131,0.00012065135,0.00014790524,0.004722837,0.0001952378],"about_ca_topic_score_codex":0.000119201686,"about_ca_topic_score_gemma":0.00018333492,"teacher_disagreement_score":0.97190964,"about_ca_system_score_codex":0.000097496886,"about_ca_system_score_gemma":0.000054065356,"threshold_uncertainty_score":0.5427316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2789881,0.000044615153,0.71893054,0.0011755757,0.00021186542,0.00027617064,0.0000010064772,0.000040793766,0.0003313206],"genre_scores_gemma":[0.9670491,0.0000067761025,0.030581886,0.0011943275,0.0007817194,0.000014634463,0.000003030476,0.000008009118,0.00036051252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987375,0.00007311571,0.00038633568,0.00036507624,0.00022231374,0.0002156599],"domain_scores_gemma":[0.99925196,0.00014218873,0.00009815971,0.0003426022,0.000032607193,0.00013246934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031847588,0.00013068716,0.00018809958,0.00006534924,0.00009673751,0.00012454612,0.0002018853,0.00006830776,0.000058495247],"category_scores_gemma":[0.00001332637,0.00010422483,0.000043676133,0.00016531668,0.000005828688,0.00031450624,0.00014222447,0.00007040332,0.000072749746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016009095,0.000022674336,0.0012724053,0.0000023565838,0.000013404304,6.19234e-7,0.002338545,0.93611324,0.001021471,0.001139438,0.0020435737,0.05601629],"study_design_scores_gemma":[0.00018531265,0.0001279824,0.0039618257,0.00005401547,0.000004199058,0.0000015019112,0.00005369733,0.95324534,0.0005393999,0.00028899102,0.04138672,0.00015099147],"about_ca_topic_score_codex":0.0005599785,"about_ca_topic_score_gemma":0.0011472475,"teacher_disagreement_score":0.68834865,"about_ca_system_score_codex":0.000057723853,"about_ca_system_score_gemma":0.000009195683,"threshold_uncertainty_score":0.42501655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054930497,0.0004692441,0.9351024,0.002279475,0.0049398197,0.0005947516,0.0000021690792,0.00019266664,0.0014889792],"genre_scores_gemma":[0.99381196,0.0000654233,0.004935755,0.00025050956,0.0006925666,0.00004028952,0.0000039239253,0.00003305068,0.00016652502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681556,0.0009762874,0.00084259675,0.00037188677,0.00046182325,0.00053186965],"domain_scores_gemma":[0.99526423,0.0017150268,0.00035271957,0.0016162355,0.0007576635,0.00029414217],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011473426,0.0002846773,0.00044165592,0.00036234487,0.0005547831,0.0009952034,0.0022754236,0.00021860926,0.000039635936],"category_scores_gemma":[0.00035197302,0.00021646389,0.00010177122,0.0009872323,0.00014176081,0.0005698786,0.0001420266,0.0026513422,0.000023802657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007573852,0.004116254,0.027521748,0.0001241144,0.00087356986,0.0004419707,0.0026544277,0.72676116,0.01794565,0.17489979,0.032783538,0.011120399],"study_design_scores_gemma":[0.0012211759,0.00035901158,0.0023767059,0.000923828,0.000023749135,0.0014929987,0.000039489652,0.9900335,0.00008180778,0.000093197836,0.003030051,0.00032446726],"about_ca_topic_score_codex":0.000111702524,"about_ca_topic_score_gemma":0.00036433447,"teacher_disagreement_score":0.93888146,"about_ca_system_score_codex":0.00014525047,"about_ca_system_score_gemma":0.0002528784,"threshold_uncertainty_score":0.9996496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05100172,0.000023120003,0.9328111,0.0008290004,0.0009726855,0.00019935785,2.4794537e-7,0.00012895615,0.014033823],"genre_scores_gemma":[0.9979069,0.000024732672,0.0008149778,0.00024714673,0.0001269636,0.000011053084,0.000008534159,0.000006471792,0.0008531933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895644,0.00009515185,0.00035110605,0.00023563814,0.00016027245,0.00020139074],"domain_scores_gemma":[0.9992134,0.00011402744,0.000074472875,0.00048216424,0.00006624939,0.00004966169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010585266,0.00009560718,0.00010358003,0.00022001509,0.000090318514,0.00007824583,0.0003683717,0.000083771134,0.000047500922],"category_scores_gemma":[0.000005618903,0.000089732144,0.000041785264,0.00040352982,0.000016059495,0.00037155632,0.000016781616,0.00016556568,0.00010198235],"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.00019038121,0.00073486904,0.0004058982,0.000014781783,0.000033731703,0.000015195206,0.010627073,0.01693808,0.0071789855,0.76441675,0.010071614,0.18937264],"study_design_scores_gemma":[0.0027434619,0.0009206883,0.03534133,0.00022002598,0.0000053612544,0.000094113464,0.0031613722,0.8798801,0.03477044,0.0034204058,0.038478736,0.0009640054],"about_ca_topic_score_codex":0.0001345381,"about_ca_topic_score_gemma":0.00070735323,"teacher_disagreement_score":0.9469052,"about_ca_system_score_codex":0.00010345682,"about_ca_system_score_gemma":0.00001400991,"threshold_uncertainty_score":0.36591706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06115492,0.00006877395,0.87533236,0.0018539964,0.0003492544,0.00011150361,4.2882309e-7,0.0001304609,0.06099833],"genre_scores_gemma":[0.98371404,0.00002921887,0.015021205,0.00029422017,0.000047959704,0.000008709908,8.0616996e-7,0.0000045209144,0.0008793194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928796,0.000061352745,0.00025738552,0.00015122411,0.00013126338,0.00011078599],"domain_scores_gemma":[0.99903965,0.0001281459,0.00008503856,0.0006294685,0.000085359796,0.000032336284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022867741,0.00007742901,0.00011600182,0.00009393807,0.00011298532,0.00007497977,0.00049952866,0.000045035893,0.00009164063],"category_scores_gemma":[0.000038834976,0.000059499915,0.000058598078,0.0002531091,0.000011099465,0.00027194017,0.000063163,0.000121272526,0.000095625495],"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.000004732838,0.00038936964,0.0007619755,0.000015770342,0.000046205965,0.0000012340745,0.0068341843,0.0013791268,0.028052958,0.63534033,0.016777812,0.3103963],"study_design_scores_gemma":[0.0001784035,0.00017327463,0.0006604828,0.00009226582,0.0000035797643,0.000020382939,0.00032049496,0.9802212,0.011030874,0.002200253,0.0049233884,0.00017540574],"about_ca_topic_score_codex":0.0000675049,"about_ca_topic_score_gemma":0.0000938249,"teacher_disagreement_score":0.9788421,"about_ca_system_score_codex":0.000026566484,"about_ca_system_score_gemma":0.0000057512466,"threshold_uncertainty_score":0.24263361},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021978812,0.00030481213,0.66266024,0.006025602,0.002436668,0.00009695671,7.8034645e-8,0.00021928306,0.3260585],"genre_scores_gemma":[0.95409304,0.000020712645,0.0005583666,0.0005065828,0.00021574968,0.0000060321136,3.565326e-8,0.0000025550048,0.04459691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994474,0.00003434676,0.00011478062,0.00013163878,0.000113386304,0.00015847021],"domain_scores_gemma":[0.99946773,0.00007807618,0.00002410093,0.00036136774,0.000034245,0.000034471268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014546012,0.000049920505,0.000048507056,0.000011976525,0.00023563091,0.00025702047,0.00048379396,0.00002358252,0.0001612842],"category_scores_gemma":[0.000007757192,0.000026869599,0.000041331907,0.00013122875,0.000011900978,0.0001379982,0.000068504996,0.000055593322,0.00064889435],"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":[5.0976195e-7,0.000014009047,0.00018145521,0.0000011560633,0.0000100763655,0.0000037208538,0.0004420766,0.00006783004,0.000041709925,0.5898774,0.34685704,0.06250299],"study_design_scores_gemma":[0.00006916989,0.000026220801,0.000092416274,0.000003688372,4.881027e-7,0.000020222651,0.000044434004,0.5057402,0.00014247495,0.0010048061,0.49278834,0.00006750116],"about_ca_topic_score_codex":0.000031628428,"about_ca_topic_score_gemma":0.000097004864,"teacher_disagreement_score":0.9518952,"about_ca_system_score_codex":0.000012719968,"about_ca_system_score_gemma":0.0000016793302,"threshold_uncertainty_score":0.83404404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032915053,0.00001781963,0.9939106,0.00044167737,0.000587299,0.0004139102,0.0000016997412,0.00018250261,0.0044115675],"genre_scores_gemma":[0.9384718,0.0000025582872,0.057178248,0.00027814077,0.00010918408,0.00017699099,0.0000010979684,0.0000053141252,0.0037766513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.00002415087,0.00015582787,0.00019507132,0.00007763624,0.00013514653],"domain_scores_gemma":[0.99961174,0.000052699932,0.000037331898,0.00018478066,0.00007946671,0.00003397785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011121754,0.00007175502,0.00008909241,0.00004795548,0.00007895024,0.00005819311,0.0002240433,0.00006650377,0.00008746709],"category_scores_gemma":[0.0000134435295,0.000056664063,0.00006393885,0.00010124041,0.0000065037957,0.00018954332,0.000011872679,0.00003809098,0.000020855601],"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.000007682456,0.00022076942,0.00010536478,0.000070320464,0.00003373958,0.00000383774,0.0021097567,0.00068147684,0.025881918,0.8499911,0.06285678,0.058037285],"study_design_scores_gemma":[0.00029606602,0.0001384846,0.00007056996,0.000015460844,0.000002284477,0.000014904847,0.00001807561,0.9329826,0.0057153744,0.0030506495,0.05750604,0.00018945194],"about_ca_topic_score_codex":0.000011786204,"about_ca_topic_score_gemma":0.000010312426,"teacher_disagreement_score":0.9384389,"about_ca_system_score_codex":0.00003230422,"about_ca_system_score_gemma":0.000003826842,"threshold_uncertainty_score":0.23106934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95186126,0.00048137837,0.010497445,0.0017259689,0.017392574,0.00025992372,0.000001519233,0.00005790889,0.017722001],"genre_scores_gemma":[0.99808997,0.00005816381,0.00018441025,0.00006847189,0.0008257651,0.0000036995764,2.2731209e-7,0.000009612517,0.0007597044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793196,0.0007592899,0.00064996694,0.00012953827,0.00037598592,0.00015328029],"domain_scores_gemma":[0.9980002,0.0008326056,0.00050441216,0.00033665646,0.00026759008,0.000058544974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018742535,0.00014542024,0.00034925176,0.000114087605,0.0002173979,0.00012663446,0.0007445431,0.000089769615,0.00038383808],"category_scores_gemma":[0.00022685308,0.000084804706,0.00024012422,0.00033034984,0.00010116607,0.00053052086,0.000033048313,0.00024937218,0.0000099796125],"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.0009816295,0.00010940258,0.000009455593,0.000007825835,0.00007233826,0.000012293703,0.001288769,0.00009661943,0.0006281547,0.988169,0.0023395137,0.006284954],"study_design_scores_gemma":[0.0008320945,0.0017292239,0.00004938062,0.00015634492,0.00001726767,0.0001526699,0.00038382228,0.00018792429,0.012838867,0.96248955,0.021029899,0.00013298633],"about_ca_topic_score_codex":0.000008009667,"about_ca_topic_score_gemma":0.0000048164716,"teacher_disagreement_score":0.046228666,"about_ca_system_score_codex":0.000056744906,"about_ca_system_score_gemma":0.000057054127,"threshold_uncertainty_score":0.42027578},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075973,0.00095428206,0.97632104,0.0012687232,0.010544207,0.0002943913,0.0000011099416,0.00016373931,0.010444895],"genre_scores_gemma":[0.75307935,0.0020738882,0.19390427,0.009017793,0.008342589,0.000068149544,0.000007519616,0.00019874309,0.03330767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645716,0.00005602561,0.0005867941,0.001213163,0.0009546951,0.0007321725],"domain_scores_gemma":[0.9968627,0.0007105004,0.00028789777,0.0017129034,0.0002795082,0.00014646209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009979405,0.00044708134,0.0004150192,0.00034032413,0.0009925637,0.0008922415,0.004411725,0.00029041836,0.000011265298],"category_scores_gemma":[0.000059045746,0.0003082607,0.00019723008,0.00049412024,0.00078554486,0.00042015465,0.0010352533,0.00090634404,0.00012111944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005733261,0.000011031857,0.000013649264,0.000010919693,0.000017382023,0.00009160926,0.0013225946,0.048788656,0.000015740643,0.05486147,0.0018026254,0.8930586],"study_design_scores_gemma":[0.0002344818,0.00018488613,0.0000591511,0.00030561324,0.0000041363796,0.000531738,4.013558e-7,0.82801276,0.00022329335,0.051122982,0.118559904,0.0007606726],"about_ca_topic_score_codex":0.000032134154,"about_ca_topic_score_gemma":0.0002218983,"teacher_disagreement_score":0.8922979,"about_ca_system_score_codex":0.00026029858,"about_ca_system_score_gemma":0.0003903977,"threshold_uncertainty_score":0.99993694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018381191,0.00009848981,0.979688,0.00011250371,0.0036591443,0.0003061125,5.670013e-7,0.0002332611,0.014063815],"genre_scores_gemma":[0.96821326,0.000006447852,0.024611842,0.0005598366,0.00021033999,0.000088653265,0.0000011196497,0.000010604912,0.006297875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998925,0.00007848986,0.00026617947,0.0003529928,0.00008970383,0.0002876856],"domain_scores_gemma":[0.99924403,0.0001373145,0.000074345146,0.00035661928,0.000120990655,0.00006669556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004178113,0.00012508314,0.00015340382,0.000055260076,0.00016896409,0.00018977183,0.00030053547,0.00008425385,0.000042430944],"category_scores_gemma":[0.000049989543,0.00010847538,0.00010934855,0.0001995844,0.000014059675,0.0003774342,0.000027244485,0.00009274158,0.000026639467],"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.000011879997,0.000055842374,0.00018931067,0.000016775659,0.00002439305,0.000003066806,0.00026037663,0.043385845,0.00019976973,0.9247856,0.019226229,0.01184087],"study_design_scores_gemma":[0.00040177876,0.0000781982,0.000036419475,0.000017563252,0.0000016985445,0.00003026263,0.000064179454,0.8689277,0.0006987168,0.00097463024,0.1286065,0.00016230824],"about_ca_topic_score_codex":0.000022077114,"about_ca_topic_score_gemma":0.00007990476,"teacher_disagreement_score":0.9663752,"about_ca_system_score_codex":0.000043220924,"about_ca_system_score_gemma":0.000014023702,"threshold_uncertainty_score":0.44234976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30505466,0.00052024185,0.5690401,0.0018250947,0.0053290906,0.00047859276,7.405968e-7,0.0018778743,0.115873605],"genre_scores_gemma":[0.98357826,0.00007491905,0.0054591116,0.0008858175,0.0012042456,0.000024869987,7.5992887e-7,0.000014807548,0.008757208],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824035,0.00008568727,0.00035157378,0.0004417688,0.00027118356,0.0006094621],"domain_scores_gemma":[0.99906164,0.000078807716,0.00012150973,0.0005341871,0.000098774806,0.000105065126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053624075,0.00018949257,0.00022894594,0.000054941604,0.00035367787,0.00025885852,0.00063939707,0.00009361668,0.00038810194],"category_scores_gemma":[0.0000081718445,0.0001603376,0.00007874333,0.00052517036,0.000013296498,0.0005624452,0.0002290694,0.00019468699,0.00060621905],"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.000020782658,0.00045056365,0.018768651,0.00020201558,0.0003039049,0.00009671674,0.009882171,0.014173287,0.00018469393,0.22744647,0.46901307,0.25945768],"study_design_scores_gemma":[0.00030767964,0.000107790336,0.0025847193,0.000049156275,0.000004502336,0.00007471039,0.000019531233,0.9666864,0.00015024963,0.000049350794,0.029707529,0.00025834295],"about_ca_topic_score_codex":0.000128141,"about_ca_topic_score_gemma":0.000033889104,"teacher_disagreement_score":0.95251316,"about_ca_system_score_codex":0.00007962084,"about_ca_system_score_gemma":0.000010438295,"threshold_uncertainty_score":0.7791922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047801418,0.00013390969,0.9872438,0.0006494057,0.00043996243,0.00044183424,0.0000016745072,0.00015214736,0.010459267],"genre_scores_gemma":[0.9909982,8.767252e-7,0.0056574247,0.00026980447,0.0005616105,0.00025024067,0.0000018144581,0.000005155996,0.002254861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994404,0.000013534292,0.0001278701,0.0001263806,0.000074618685,0.0002172431],"domain_scores_gemma":[0.999488,0.00007371585,0.00004690566,0.00023624944,0.0000757976,0.000079331316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020431487,0.000060210696,0.00008463666,0.000028978853,0.00011150755,0.00007530231,0.00028819274,0.000031183754,0.000021898783],"category_scores_gemma":[0.000008066359,0.00004716682,0.000051775176,0.00015527035,0.000007654542,0.0003185522,0.00002225229,0.000036011275,0.000105562605],"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.0000068868135,0.0001923123,0.00071746024,0.00006529875,0.00003219258,8.722496e-8,0.0009282625,0.00010190223,0.00046919298,0.9152376,0.06891031,0.0133385025],"study_design_scores_gemma":[0.0003004909,0.00006896301,0.0012523046,0.00001308953,0.0000059885247,0.000023127655,0.000070821894,0.06822166,0.0020413895,0.0012567374,0.92654115,0.00020425215],"about_ca_topic_score_codex":0.0000106849175,"about_ca_topic_score_gemma":0.000005551083,"teacher_disagreement_score":0.9905202,"about_ca_system_score_codex":0.00002405094,"about_ca_system_score_gemma":0.000019104826,"threshold_uncertainty_score":0.1923407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035708666,0.00036942968,0.96184015,0.0001838791,0.0010248481,0.00028956478,0.000023786417,0.00018426351,0.00037538196],"genre_scores_gemma":[0.9993091,0.000059533388,0.00030656342,0.00007871146,0.0000378431,0.000043499826,0.0000033470762,0.000006242434,0.00015511716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984413,0.00013992448,0.0004400728,0.000423127,0.00020742844,0.00034819118],"domain_scores_gemma":[0.9992874,0.00008893214,0.00009125189,0.00034767197,0.00005841402,0.00012628178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032374196,0.00020047904,0.00029332194,0.00020034691,0.00024440757,0.0002376412,0.0002454195,0.0001302184,0.0000036485064],"category_scores_gemma":[0.0000026584737,0.00017750147,0.00009055904,0.0005414798,0.000021083888,0.0003291103,0.0000013712684,0.000250383,0.00001541724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012382035,0.00043447572,0.0002542376,0.0000632441,0.00007481454,0.00010369783,0.001195139,0.94469494,0.0007167162,0.021346275,0.000436833,0.030555816],"study_design_scores_gemma":[0.0017728969,0.0006340403,0.0016529623,0.0002962567,0.000014777709,0.00027484016,0.0007610437,0.98997164,0.00018172506,0.0030932645,0.00074529386,0.000601244],"about_ca_topic_score_codex":0.00017164549,"about_ca_topic_score_gemma":0.000100316895,"teacher_disagreement_score":0.96360046,"about_ca_system_score_codex":0.00006779006,"about_ca_system_score_gemma":0.00002190607,"threshold_uncertainty_score":0.72383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018609031,0.00008641506,0.9919619,0.0021798096,0.0004940321,0.000287252,8.184922e-7,0.00005439628,0.003074506],"genre_scores_gemma":[0.9579955,0.0000062573417,0.040286426,0.0012331696,0.000056144356,0.00004989352,4.974169e-7,0.000005805624,0.00036632246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921066,0.000124093,0.00021697127,0.00016128397,0.00013249739,0.00015451222],"domain_scores_gemma":[0.9983294,0.0004936442,0.00012431282,0.0009285435,0.00009502293,0.000029085299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030050738,0.00008111957,0.00011805488,0.000039976985,0.00016164492,0.00006396418,0.00085647264,0.00009096262,0.000035006284],"category_scores_gemma":[0.00003411675,0.000052641895,0.00014644877,0.00032218962,0.00003656405,0.00008024427,0.00006920273,0.00014739018,0.0000040984955],"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.000013584046,0.00010184999,0.00023226065,0.000008910813,0.000018377248,1.5218203e-7,0.0002850363,0.13817698,0.0000088171155,0.839393,0.018845577,0.0029154452],"study_design_scores_gemma":[0.00017842247,0.00009566805,0.00015020561,0.00007800136,0.0000027672997,0.0000013712882,0.000022506874,0.99432135,0.00016205665,0.0022330238,0.0026859785,0.00006865622],"about_ca_topic_score_codex":0.000024626914,"about_ca_topic_score_gemma":0.00002698314,"teacher_disagreement_score":0.95613456,"about_ca_system_score_codex":0.00001869957,"about_ca_system_score_gemma":0.0000070548795,"threshold_uncertainty_score":0.21466742},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022571448,0.0000462067,0.9166526,0.0014227988,0.00094945164,0.00016355136,0.0000015843739,0.00021790522,0.057974458],"genre_scores_gemma":[0.9225401,6.7509444e-7,0.074830644,0.0007937355,0.00044900837,0.00002001144,0.0000037180278,0.0000059547137,0.0013561182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926317,0.00001588528,0.00020755925,0.00020562373,0.000103097955,0.00020465448],"domain_scores_gemma":[0.9994117,0.00019764909,0.000056962293,0.00017121287,0.00012876609,0.000033719654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017589987,0.00007420711,0.0001067982,0.000038562033,0.0000835402,0.00021239145,0.0002940131,0.000045921246,0.000027930793],"category_scores_gemma":[0.000008894701,0.000059704405,0.000048029917,0.00015424602,0.000011999074,0.00021430019,0.000064384396,0.000042437776,0.00003997859],"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.000002792182,0.000013878742,0.00054097315,0.000019822346,0.0000090549975,0.000001908323,0.000046136465,0.00026206052,0.00025844006,0.9757392,0.018914353,0.004191379],"study_design_scores_gemma":[0.0005010155,0.000079550104,0.0002251733,0.000031112715,0.0000090093845,0.00015739579,0.00035544697,0.92562515,0.0039242404,0.010813505,0.057990592,0.0002878121],"about_ca_topic_score_codex":0.00032772523,"about_ca_topic_score_gemma":0.0004695767,"teacher_disagreement_score":0.9649257,"about_ca_system_score_codex":0.000021984904,"about_ca_system_score_gemma":0.000014219975,"threshold_uncertainty_score":0.2434675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07383052,0.00012137811,0.7280163,0.0009892135,0.00080764975,0.00010292677,1.8452327e-7,0.00023258,0.1958992],"genre_scores_gemma":[0.9910232,0.0000039169663,0.002111359,0.00016912971,0.00005989792,0.0000015689423,8.967309e-8,0.000002929683,0.006627903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993596,0.00004028107,0.00015441954,0.00017992525,0.00009793247,0.00016780743],"domain_scores_gemma":[0.9996857,0.000044232933,0.000029785577,0.00018146956,0.000025590154,0.000033221204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121606805,0.00006208642,0.00008869606,0.00008517054,0.00004427219,0.00008690411,0.00029859517,0.000032213367,0.00015328961],"category_scores_gemma":[0.000007450065,0.00005234764,0.000031888685,0.00026504413,0.000007860401,0.00028202985,0.00005617352,0.00007101326,0.00011903091],"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.000009853616,0.00032777464,0.016556377,0.000025624657,0.00004063044,0.0004637356,0.015843056,0.07268856,0.0010110411,0.43988734,0.04098572,0.41216028],"study_design_scores_gemma":[0.0001953091,0.000027066088,0.0009591511,0.000023039398,3.3326614e-7,0.000023021592,0.00012810453,0.9892327,0.000033618286,0.00007932044,0.009216056,0.00008225278],"about_ca_topic_score_codex":0.00019164487,"about_ca_topic_score_gemma":0.0007941798,"teacher_disagreement_score":0.9171927,"about_ca_system_score_codex":0.00003057933,"about_ca_system_score_gemma":0.000004251121,"threshold_uncertainty_score":0.2134675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001999511,0.0000040333384,0.94377697,0.00007545949,0.00032890827,0.051470995,0.0000012213042,0.000406656,0.0019362578],"genre_scores_gemma":[0.86407965,1.0103711e-7,0.021834081,0.00018851615,0.00019426538,0.1125633,0.0000016467633,0.000021869946,0.0011165877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982386,0.00009738436,0.00037171223,0.00064261566,0.0002198771,0.0004298046],"domain_scores_gemma":[0.99869853,0.00013170704,0.00018780431,0.0005338252,0.00030024152,0.00014789421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033499493,0.00023846453,0.00022591311,0.00008903662,0.0002772759,0.0004248307,0.0005856244,0.0001166763,0.00011051086],"category_scores_gemma":[0.000022341068,0.00017331482,0.00006775606,0.000357958,0.000050318606,0.0004700375,0.000048610862,0.00015135718,0.000020209962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000360652,0.0023914888,0.0013112924,0.00023221706,0.00007814974,0.000021838418,0.003828659,0.92100924,0.0013864374,0.012354431,0.009361328,0.04766428],"study_design_scores_gemma":[0.0014674903,0.0013181841,0.0000350367,0.00009617587,0.000003308095,0.000036542144,0.00016774771,0.988834,0.0017668656,0.000014292007,0.0059736185,0.00028670634],"about_ca_topic_score_codex":0.000085107706,"about_ca_topic_score_gemma":0.00030386736,"teacher_disagreement_score":0.9219429,"about_ca_system_score_codex":0.00010085743,"about_ca_system_score_gemma":0.000013178614,"threshold_uncertainty_score":0.70675737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15846929,0.00012010809,0.55095893,0.00066549005,0.0010959144,0.00020064194,2.8072193e-7,0.00009271236,0.28839663],"genre_scores_gemma":[0.99524975,0.000010496102,0.0013267109,0.000046664438,0.000036411406,0.000004815616,9.8331654e-8,0.0000015291056,0.0033235326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994351,0.000041522693,0.00020489747,0.0001359,0.000090087626,0.00009245702],"domain_scores_gemma":[0.9996492,0.000047047888,0.000050825915,0.0001942476,0.000040483064,0.000018142333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016011168,0.00003978783,0.00007446576,0.00006148323,0.000017826886,0.00003442112,0.00020658286,0.000029736122,0.00010324726],"category_scores_gemma":[0.00002186268,0.000034176486,0.000020830123,0.00018652747,0.000006933208,0.00032916534,0.000027298049,0.000047499772,0.00003629469],"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.000008332531,0.00023104194,0.006251126,0.00006661139,0.000018595056,0.000023805418,0.010288285,0.011540558,0.007889865,0.66277665,0.023376593,0.27752852],"study_design_scores_gemma":[0.000121613964,0.000032132415,0.00086466497,0.000038783695,2.6427654e-7,0.000008691755,0.00004477212,0.9935631,0.0028400125,0.0005372154,0.0018910279,0.000057710316],"about_ca_topic_score_codex":0.00016382623,"about_ca_topic_score_gemma":0.00022567196,"teacher_disagreement_score":0.9820225,"about_ca_system_score_codex":0.000012684188,"about_ca_system_score_gemma":0.0000031401912,"threshold_uncertainty_score":0.13936767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019360408,0.000031759573,0.9938848,0.0017659711,0.0004320051,0.0008710601,5.599008e-7,0.00025617908,0.002738286],"genre_scores_gemma":[0.51294255,0.000003967588,0.48139766,0.0035124843,0.00045539314,0.0004146838,0.0000022640568,0.000006874689,0.0012641383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866444,0.00029225208,0.00026859174,0.00042074814,0.00008422265,0.00026976445],"domain_scores_gemma":[0.9977948,0.0013035989,0.000070332884,0.00062345073,0.00013521893,0.00007261642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013369316,0.00011476414,0.00019004774,0.000062538034,0.00018072761,0.00008463863,0.0005244296,0.000101417856,0.000013026358],"category_scores_gemma":[0.000058439127,0.00009076628,0.00010386795,0.00026439948,0.000016316815,0.00012324413,0.00002723571,0.000101079786,0.000027939224],"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.000020458587,0.000075932905,0.000008643328,0.0000047614803,0.000009726203,4.339673e-7,0.00010150026,0.08770642,0.000054870292,0.813097,0.026851563,0.072068684],"study_design_scores_gemma":[0.0002188038,0.00045426903,0.00011798419,0.000007845683,0.0000037869831,0.000010686673,0.00001910493,0.90237653,0.00015994516,0.06476566,0.031711426,0.00015395175],"about_ca_topic_score_codex":0.0000054024767,"about_ca_topic_score_gemma":0.0000031676107,"teacher_disagreement_score":0.81467015,"about_ca_system_score_codex":0.00003431947,"about_ca_system_score_gemma":0.000025441826,"threshold_uncertainty_score":0.37013417},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785054,0.00019347451,0.008551861,0.00006216171,0.0016172745,0.00084198784,0.00004915523,0.00052790425,0.009650798],"genre_scores_gemma":[0.9706864,0.00005481607,0.027427433,0.0009583147,0.000102870574,0.0000465133,0.000022706603,0.00005506436,0.0006458946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676067,0.00014769236,0.00077970006,0.00090678735,0.000393258,0.0010119216],"domain_scores_gemma":[0.9977474,0.00046093337,0.00031603302,0.0007404529,0.0003625678,0.0003725657],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0030054275,0.00041367768,0.0004841692,0.00019478492,0.0013498628,0.0002219396,0.00087040424,0.00032167343,0.000033414624],"category_scores_gemma":[0.0001489721,0.00041801267,0.00018523252,0.0005333969,0.00012499857,0.0011906722,0.00041285297,0.00066006824,0.00006681377],"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.00032331946,0.00032367496,0.00031837885,0.00025539973,0.00036692177,0.00005528455,0.000053581167,0.016097499,0.0150589915,0.72414434,0.00011809007,0.24288453],"study_design_scores_gemma":[0.001251814,0.00035437677,0.00058758404,0.00016971541,0.00003225888,0.00016807781,0.000038383525,0.88648796,0.0061327475,0.0054690577,0.098497264,0.0008107325],"about_ca_topic_score_codex":0.00005284628,"about_ca_topic_score_gemma":0.00012977171,"teacher_disagreement_score":0.8703905,"about_ca_system_score_codex":0.00028157042,"about_ca_system_score_gemma":0.000019129833,"threshold_uncertainty_score":0.99995023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27664605,0.000033145483,0.7169259,0.00022911142,0.0005905924,0.00018097425,0.0000021817818,0.000060166447,0.0053318846],"genre_scores_gemma":[0.99609333,0.000005881539,0.0026905516,0.00017180295,0.000041424966,0.000010683658,0.0000016483214,0.0000032517921,0.0009814352],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992182,0.000041639047,0.0002863092,0.00016785042,0.00013015373,0.00015583482],"domain_scores_gemma":[0.99960095,0.00003006841,0.000060962207,0.00020478267,0.00007712751,0.00002611231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020881962,0.00006133257,0.00011675713,0.0000901831,0.000040710715,0.000013105776,0.0002035949,0.000033525495,0.00020859097],"category_scores_gemma":[0.000005566069,0.000050913375,0.000046952573,0.00020007449,0.000010205891,0.00022711373,0.000063296226,0.00005566906,0.00003398694],"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.000039684623,0.00061282975,0.56782144,0.00009834955,0.00010021478,0.00013198293,0.034971863,0.0034706695,0.0030728055,0.2590004,0.08097674,0.04970305],"study_design_scores_gemma":[0.006133681,0.0004237878,0.24342233,0.00014055926,0.000006246173,0.00022381151,0.0077357087,0.6101271,0.06957808,0.0011013249,0.060202345,0.00090503984],"about_ca_topic_score_codex":0.00051064556,"about_ca_topic_score_gemma":0.0011961807,"teacher_disagreement_score":0.71944726,"about_ca_system_score_codex":0.000026369295,"about_ca_system_score_gemma":0.00002911669,"threshold_uncertainty_score":0.22839248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10365126,0.0011463517,0.8819231,0.0006951223,0.0020992605,0.0007234312,0.00007016653,0.0005278423,0.0091634635],"genre_scores_gemma":[0.97027844,0.00025746346,0.025567232,0.00016018216,0.00044443595,0.00005593857,0.000038453818,0.00009570771,0.0031021188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564415,0.00056851073,0.0006330517,0.00093549694,0.00075238623,0.0014664263],"domain_scores_gemma":[0.9967409,0.00026622787,0.0006691607,0.0011921363,0.00045527384,0.0006763184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084595144,0.00068910606,0.0007599501,0.00072431937,0.00079919084,0.0008049988,0.0012128328,0.0005610927,0.00013940051],"category_scores_gemma":[0.000036544534,0.0006894768,0.00031759133,0.0014075278,0.00017674606,0.0026407768,0.000379241,0.0005305187,0.00021904099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000443334,0.0015201239,0.09239313,0.0020204617,0.0017039439,0.0010751842,0.015665973,0.47788143,0.00026479943,0.35463503,0.0075942385,0.044802345],"study_design_scores_gemma":[0.0012425849,0.0003800545,0.012403978,0.0012179546,0.00024866674,0.0008608836,0.004227753,0.9737856,0.000082255785,0.000012545885,0.0045611695,0.0009765872],"about_ca_topic_score_codex":0.0007095819,"about_ca_topic_score_gemma":0.0000942546,"teacher_disagreement_score":0.8666272,"about_ca_system_score_codex":0.0017018755,"about_ca_system_score_gemma":0.0003551566,"threshold_uncertainty_score":0.99955565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038330805,0.00010333545,0.9443276,0.00032893926,0.0014557346,0.00020478608,0.0000022841732,0.00010205029,0.015144451],"genre_scores_gemma":[0.9838425,0.0000012574503,0.0150364945,0.00020177038,0.00028605503,0.00005298735,2.6327794e-7,0.0000074008253,0.0005712671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916893,0.000057810368,0.00023432853,0.00015631596,0.00010752279,0.00027509162],"domain_scores_gemma":[0.99890965,0.0005383616,0.00008557207,0.00031870147,0.00007233613,0.000075393604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044271068,0.000096007396,0.00019181278,0.00009383868,0.00005243193,0.000035065248,0.00041686403,0.000053466778,0.000045057288],"category_scores_gemma":[0.00011285025,0.000071023154,0.00013051018,0.0001182149,0.000021416843,0.00015545043,0.00008639425,0.000049839935,0.000021343843],"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.00006108731,0.00023124085,0.002139596,0.000190656,0.00015427255,8.522326e-7,0.0043025007,0.00056540157,0.0031973342,0.82159734,0.026242347,0.14131735],"study_design_scores_gemma":[0.0013070924,0.0009182892,0.003234473,0.0004999399,0.00007083559,0.00021726721,0.0012509652,0.2815094,0.5435513,0.012167686,0.15381487,0.0014578927],"about_ca_topic_score_codex":0.00004156435,"about_ca_topic_score_gemma":0.000026619387,"teacher_disagreement_score":0.9455117,"about_ca_system_score_codex":0.000016516535,"about_ca_system_score_gemma":0.000012722106,"threshold_uncertainty_score":0.289624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079953845,0.000113382404,0.9908351,0.00028972086,0.00043749064,0.000062390005,3.5397477e-8,0.00007132757,0.007391045],"genre_scores_gemma":[0.9393778,0.000007169451,0.055514887,0.0001083041,0.00011704495,0.0000011893452,2.906544e-8,0.0000028240333,0.0048707738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941796,0.000030868858,0.00015977559,0.0001293204,0.00009904598,0.00016303253],"domain_scores_gemma":[0.99963385,0.000044492637,0.000044806016,0.00019164142,0.000024990115,0.00006023824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010185845,0.000054454096,0.00009327125,0.000029521992,0.0000293155,0.000052353822,0.00026298044,0.000029174447,0.00025140183],"category_scores_gemma":[0.0000076062024,0.000042967025,0.000041301,0.00014309453,0.0000051461843,0.00019218166,0.000036245634,0.000036469803,0.00004487311],"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.000011937173,0.00013720267,0.00263041,0.000038505023,0.00010148209,0.000022488202,0.011174819,0.03416779,0.006750157,0.39311776,0.26569393,0.28615353],"study_design_scores_gemma":[0.00015720952,0.00006968142,0.0001650883,0.00002625413,0.0000015273228,0.000018986633,0.000034264314,0.9919331,0.0039219754,0.00089499285,0.0026860856,0.00009080921],"about_ca_topic_score_codex":0.00023618381,"about_ca_topic_score_gemma":0.000013847193,"teacher_disagreement_score":0.95776534,"about_ca_system_score_codex":0.0000143414045,"about_ca_system_score_gemma":0.000012656981,"threshold_uncertainty_score":0.27526736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009956926,0.0001500453,0.9748861,0.00016331667,0.00081037486,0.000115729425,1.2330264e-7,0.000093003866,0.013824372],"genre_scores_gemma":[0.963633,0.000010678134,0.030454453,0.00016091649,0.000036995105,0.00001565073,3.088814e-7,0.0000046486825,0.005683345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994785,0.000025703264,0.0001336152,0.00017226225,0.000039909937,0.00014998407],"domain_scores_gemma":[0.9996975,0.00005980691,0.000031543255,0.0001316191,0.000039321112,0.000040177838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023270315,0.000061428356,0.00008530914,0.000022100518,0.00010474565,0.00014059323,0.00010163159,0.00005097121,0.000022391829],"category_scores_gemma":[0.000010784031,0.000049891067,0.000028737071,0.000081891965,0.000018463927,0.00018999117,0.000027813094,0.0000438658,0.000003622047],"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.0000034996751,0.000006890396,0.00021139946,0.00000451909,0.000014258731,0.0000017223231,0.00022256079,0.0054300046,0.000020163487,0.9867715,0.005625045,0.00168844],"study_design_scores_gemma":[0.00035743107,0.0001238698,0.00018328661,0.000016973498,0.00000253208,0.00012633597,0.0000678328,0.90446854,0.00019839068,0.001988508,0.09231757,0.0001487214],"about_ca_topic_score_codex":0.00000461564,"about_ca_topic_score_gemma":0.0000030901585,"teacher_disagreement_score":0.984783,"about_ca_system_score_codex":0.0000070472524,"about_ca_system_score_gemma":0.00000659782,"threshold_uncertainty_score":0.20344988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003266725,0.00007875902,0.98891205,0.0008179972,0.00004935153,0.0003522647,0.0000040645778,0.000019810055,0.006498978],"genre_scores_gemma":[0.97826135,0.00007895576,0.020923764,0.00010914395,0.00010780989,0.00038714896,0.0000030279564,0.000007976857,0.00012080614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921536,0.0000497921,0.0002989453,0.00014671787,0.00015810816,0.00013108044],"domain_scores_gemma":[0.9988596,0.00041594155,0.000115069466,0.0005298372,0.00005387588,0.00002569495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076857477,0.00008105327,0.000116569245,0.00002142662,0.0002292785,0.0001493319,0.00053610676,0.000030014224,0.0000018685049],"category_scores_gemma":[0.000015944703,0.000042823645,0.00004636637,0.00027888548,0.000074788506,0.00006504251,0.000066082735,0.00008463094,0.0000068495146],"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":[1.6503387e-7,0.000029996758,0.00010305711,0.000011210509,0.000005413478,9.777878e-8,0.00096831046,0.000021454089,0.000008746378,0.9873749,0.00013747557,0.011339179],"study_design_scores_gemma":[0.00015615886,0.000026077441,0.0010029807,0.00004099534,0.000010210753,0.000037147856,0.0016156919,0.64872557,0.00003082016,0.31645223,0.031747423,0.00015467132],"about_ca_topic_score_codex":0.000023464185,"about_ca_topic_score_gemma":0.000020964299,"teacher_disagreement_score":0.97499466,"about_ca_system_score_codex":0.000004243571,"about_ca_system_score_gemma":0.0000072808407,"threshold_uncertainty_score":0.17634481},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010783627,0.000034080505,0.993733,0.00019129773,0.0006016416,0.001362373,0.0000024207518,0.00018530968,0.0028115322],"genre_scores_gemma":[0.7410057,0.000001661131,0.25672722,0.00052990066,0.000555162,0.0009755551,0.000007060115,0.000012495971,0.00018524492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856436,0.00016848065,0.00026782337,0.0005287829,0.00012986743,0.00034067407],"domain_scores_gemma":[0.99894536,0.00017420836,0.000075859236,0.0005505175,0.00018464243,0.000069444264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032055,0.00015557907,0.0001695605,0.00014286899,0.00026518406,0.00006366242,0.00048924563,0.00013261753,0.000046713743],"category_scores_gemma":[0.000010505841,0.00012758316,0.00009718339,0.00026914928,0.000049018297,0.00006368244,0.000054515593,0.0001573702,0.000029040255],"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.00016398102,0.0004258133,0.0008200638,0.00002994783,0.000069880996,0.000004596626,0.0025903417,0.061253395,0.040342588,0.8399754,0.016134944,0.03818903],"study_design_scores_gemma":[0.00043560122,0.00040039167,0.0007904933,0.00001174586,0.0000022335698,0.000014617748,0.00003337947,0.91925055,0.07163496,0.0026149172,0.004559585,0.00025149592],"about_ca_topic_score_codex":0.00011722774,"about_ca_topic_score_gemma":0.0001792888,"teacher_disagreement_score":0.8579972,"about_ca_system_score_codex":0.000057702993,"about_ca_system_score_gemma":0.000042761258,"threshold_uncertainty_score":0.52026904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021509032,0.00012399317,0.978046,0.000260316,0.0003575002,0.0000635168,3.9288636e-8,0.000080487094,0.01891724],"genre_scores_gemma":[0.9736579,0.000008447316,0.022466112,0.00013131184,0.0000657813,0.0000037075718,3.2572686e-8,0.0000032695132,0.0036634149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940574,0.000044027198,0.00017246125,0.00014485646,0.00010969675,0.00012318704],"domain_scores_gemma":[0.9995615,0.00006805141,0.00004974923,0.00024046906,0.000050224357,0.000030009449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020669743,0.00005805447,0.00010200031,0.000038450522,0.00004530017,0.000051951036,0.00028999848,0.000033301403,0.00024294517],"category_scores_gemma":[0.000007738607,0.000045022636,0.000038659593,0.00012243977,0.0000105472955,0.00020012265,0.00004681018,0.000041412553,0.00011961548],"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.000015289608,0.00042265456,0.0028568455,0.00011228143,0.00017915403,0.00003433131,0.019910978,0.055754114,0.031173887,0.57342356,0.10893799,0.20717888],"study_design_scores_gemma":[0.00009382127,0.000070232,0.000041849762,0.000019427549,0.0000012406324,0.000020215411,0.000051278294,0.99347013,0.003542527,0.0005230302,0.0020805916,0.000085650616],"about_ca_topic_score_codex":0.000065038694,"about_ca_topic_score_gemma":0.0000056824124,"teacher_disagreement_score":0.971507,"about_ca_system_score_codex":0.000012214559,"about_ca_system_score_gemma":0.0000052325936,"threshold_uncertainty_score":0.26600793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08539836,0.0000169743,0.89534634,0.0010154494,0.009655134,0.00043464874,0.0000012776434,0.00018819877,0.007943637],"genre_scores_gemma":[0.9728421,0.0000016972866,0.01672566,0.0005775611,0.0015779908,0.000064750035,0.0000033376512,0.000013548047,0.008193344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888545,0.00003239916,0.00020349042,0.00039657924,0.00019994214,0.00028214062],"domain_scores_gemma":[0.99918526,0.00004324577,0.000091880334,0.00047942039,0.00013214102,0.00006806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003228493,0.00016188373,0.00017644328,0.00007319995,0.0000950843,0.00028796462,0.00068500685,0.00008648103,0.00011608541],"category_scores_gemma":[0.000007231991,0.000109176355,0.00009303737,0.0001287433,0.000028914264,0.0004973749,0.0000878988,0.00015512589,0.000037709393],"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.0005205551,0.00049954595,0.0026154201,0.0003288891,0.00086163264,0.00008762699,0.01015852,0.00035756818,0.05606231,0.46008134,0.37544668,0.09297992],"study_design_scores_gemma":[0.0075931163,0.0028412805,0.0015900268,0.00039497277,0.00008765962,0.0006876386,0.002099772,0.4165763,0.13848515,0.0012801829,0.42594057,0.002423334],"about_ca_topic_score_codex":0.0000748564,"about_ca_topic_score_gemma":0.0008237305,"teacher_disagreement_score":0.8874437,"about_ca_system_score_codex":0.000016905156,"about_ca_system_score_gemma":0.00003345503,"threshold_uncertainty_score":0.44520825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109342225,0.000017879076,0.9860621,0.00021711532,0.00028130558,0.00034301737,0.0000042951124,0.000108054315,0.0020319987],"genre_scores_gemma":[0.82338315,0.000007588215,0.1744995,0.00013320943,0.00025819676,0.000052550004,0.000018664807,0.000008245692,0.0016388926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991541,0.00007691065,0.00025103777,0.0001802425,0.0000991616,0.00023856324],"domain_scores_gemma":[0.9990034,0.00021475143,0.00013341189,0.00037675563,0.00021839497,0.000053248114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076450733,0.0000923979,0.00016992325,0.00015524183,0.00028119734,0.0000951885,0.00026083863,0.000082701175,0.000014148192],"category_scores_gemma":[0.000022180833,0.00007837934,0.00016617744,0.0004941143,0.0000067617575,0.00038342128,0.000036440957,0.000049351358,0.00001287129],"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.00016983083,0.0006789469,0.022297038,0.000116794974,0.0016478373,1.537648e-7,0.0049274717,0.07101198,0.015372532,0.80956805,0.022497766,0.051711578],"study_design_scores_gemma":[0.00016919053,0.00008597528,0.0011213014,0.000012236723,0.000055651904,0.000002152015,0.00001855328,0.9951365,0.0005771129,0.00051484467,0.0021919394,0.00011453574],"about_ca_topic_score_codex":0.00027587122,"about_ca_topic_score_gemma":0.0000674469,"teacher_disagreement_score":0.92412454,"about_ca_system_score_codex":0.000085968255,"about_ca_system_score_gemma":0.000017698443,"threshold_uncertainty_score":0.31962165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031859733,0.0007994904,0.9621046,0.0015278099,0.00044891267,0.00031011732,0.0000030022934,0.00023278342,0.0027135457],"genre_scores_gemma":[0.9725775,0.000038725397,0.025002964,0.00070060877,0.00017753089,0.00012121032,0.0000013225808,0.000009444928,0.0013706967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984322,0.000121414225,0.0005799477,0.0002771776,0.00029664705,0.00029259207],"domain_scores_gemma":[0.9989148,0.00011313427,0.00022054701,0.0005182022,0.00017254578,0.00006078643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005980037,0.00014479713,0.00030586027,0.00005497006,0.0001618252,0.00014298757,0.0007697401,0.000082415776,0.000021869168],"category_scores_gemma":[0.000006376076,0.00008814432,0.000115716386,0.00021933622,0.000016547383,0.0002921845,0.00012625959,0.000108992645,0.000041028292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036617866,0.00015167352,0.00047315794,0.000019491037,0.000040463317,1.9681046e-7,0.00090541714,0.7055139,0.000019113151,0.2708459,0.021863442,0.00016360398],"study_design_scores_gemma":[0.00053333095,0.00002313892,0.0000435524,0.000021112903,0.000007737519,0.0000055097803,0.00025486172,0.98476845,0.00021491227,0.00014499584,0.013857241,0.0001251604],"about_ca_topic_score_codex":0.00013924016,"about_ca_topic_score_gemma":0.00019185989,"teacher_disagreement_score":0.94071776,"about_ca_system_score_codex":0.000045363766,"about_ca_system_score_gemma":0.000038394777,"threshold_uncertainty_score":0.35944209},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82637584,0.0000464082,0.1651427,0.00012058402,0.0001473796,0.00007028456,0.0000010259281,0.00010094953,0.007994819],"genre_scores_gemma":[0.9961688,0.000011491778,0.0010010982,0.000054486827,0.000041485375,0.0000054431266,0.0000012430472,0.0000052173027,0.0027107706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989768,0.000025958894,0.00027331035,0.00027606028,0.00023270653,0.00021511663],"domain_scores_gemma":[0.99925834,0.00004369649,0.000120620774,0.00041525508,0.000101595004,0.000060480903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018872076,0.00012222909,0.0003050292,0.0002602994,0.00008384127,0.00008349097,0.0003743559,0.000045968773,0.00012783769],"category_scores_gemma":[0.0000040738732,0.00008325183,0.00011257929,0.0012212782,0.000028510129,0.00030615137,0.000039307717,0.000074057985,0.00002123996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007279635,0.0006749999,0.1572019,0.00021633216,0.004754978,0.00002625282,0.023831615,0.51530886,0.0009715429,0.010955474,0.011047029,0.27493823],"study_design_scores_gemma":[0.00015537236,0.00013606802,0.0069757667,0.00002808014,0.00006405957,0.000008593075,0.0001690113,0.99158376,0.00042472966,0.0000014070722,0.00032249192,0.00013066658],"about_ca_topic_score_codex":0.000036748268,"about_ca_topic_score_gemma":0.00012074537,"teacher_disagreement_score":0.4762749,"about_ca_system_score_codex":0.000026828015,"about_ca_system_score_gemma":0.0000067181436,"threshold_uncertainty_score":0.3394911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011317418,0.000027058688,0.98283464,0.0023112434,0.0013643095,0.00021235915,6.57954e-7,0.00030364725,0.0016286537],"genre_scores_gemma":[0.8475898,4.0951394e-7,0.1507744,0.000973241,0.00035739466,0.000043528053,0.0000015467007,0.000007396019,0.0002523045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991091,0.000013823842,0.00022033519,0.00028372888,0.00013287418,0.0002401687],"domain_scores_gemma":[0.9993582,0.00007798794,0.000059481674,0.00031561597,0.00011986381,0.00006887713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030172107,0.000105095096,0.00013471664,0.00007130479,0.00013947555,0.00018022256,0.0004007137,0.00006973271,0.00001217569],"category_scores_gemma":[0.00003803698,0.00008590866,0.00010542702,0.0001882409,0.000014051135,0.00025996627,0.00004241097,0.000068499154,0.00003972955],"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.000032276224,0.00016485646,0.00022787998,0.00007795235,0.00005127324,0.000008007634,0.0007491103,0.24619092,0.004618905,0.73029554,0.0036808199,0.01390247],"study_design_scores_gemma":[0.0016356225,0.0002580737,0.00007727544,0.00008983698,0.0000046099444,0.000012570412,0.00009085603,0.93773776,0.034224883,0.014894989,0.010647519,0.00032597495],"about_ca_topic_score_codex":0.00007838629,"about_ca_topic_score_gemma":0.000062012,"teacher_disagreement_score":0.83627236,"about_ca_system_score_codex":0.000059075846,"about_ca_system_score_gemma":0.00010144355,"threshold_uncertainty_score":0.35032535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22433424,0.0000055766445,0.77281517,0.000018555826,0.00011386254,0.00006701131,5.076093e-7,0.000023072495,0.002621972],"genre_scores_gemma":[0.91459066,0.0000014927753,0.08367625,0.00008052234,0.000013534161,0.000010008271,6.29522e-7,0.0000026842138,0.001624198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993608,0.000025502944,0.00022068118,0.00016654845,0.0000888117,0.00013762906],"domain_scores_gemma":[0.9995086,0.000039821756,0.00006414239,0.00025403043,0.00010159191,0.000031794603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033524123,0.00006091352,0.00016790953,0.00014735851,0.00006375738,0.000036802376,0.00019695313,0.000029370713,0.0000076770275],"category_scores_gemma":[0.000013108557,0.000048194823,0.000121431956,0.00044429876,0.000005123498,0.00016572357,0.000019667994,0.000031325588,0.000001228313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003226551,0.000020929956,0.00064972806,0.000008645457,0.00013912877,1.1058237e-7,0.0005836032,0.7330669,0.0008191382,0.2630496,0.00009811694,0.001560832],"study_design_scores_gemma":[0.0001407599,0.000021921645,0.00017854599,0.0000034709435,0.000032425003,0.0000010812257,0.000017581848,0.99849236,0.0007604127,0.00015245573,0.00013367918,0.000065300694],"about_ca_topic_score_codex":0.000022947394,"about_ca_topic_score_gemma":0.000042163007,"teacher_disagreement_score":0.6902564,"about_ca_system_score_codex":0.000013824943,"about_ca_system_score_gemma":0.00002027231,"threshold_uncertainty_score":0.19653279},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031615968,0.000012886969,0.99103105,0.0025713623,0.00042100812,0.0003549693,3.6124877e-7,0.00023214387,0.0050600446],"genre_scores_gemma":[0.919435,0.0000010656132,0.077224776,0.0011011881,0.00036072274,0.000025938743,0.0000028422278,0.000005075884,0.0018433612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913263,0.00007292979,0.00021083117,0.0002497005,0.00012281106,0.0002111195],"domain_scores_gemma":[0.9994724,0.000099773264,0.000069008835,0.00024262293,0.00007096812,0.000045275534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043184834,0.00009684799,0.00011751388,0.000058880265,0.00011660656,0.00022752016,0.00028095525,0.00005589868,0.000011576747],"category_scores_gemma":[0.000026055677,0.00007661986,0.00006597848,0.00014047991,0.0000062233867,0.00035435642,0.000014174741,0.00006963894,0.000024560832],"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.000055475957,0.00008963852,0.000022843522,0.000015656948,0.000028525752,0.000004775058,0.006781889,0.060133412,0.0068080663,0.58885175,0.056162253,0.2810457],"study_design_scores_gemma":[0.00043080532,0.0004248201,0.000063994106,0.00003060201,0.0000028404509,0.000022177028,0.00012843264,0.9489157,0.0056761717,0.02744665,0.016631518,0.0002262571],"about_ca_topic_score_codex":0.00000615328,"about_ca_topic_score_gemma":0.0000057471043,"teacher_disagreement_score":0.9191189,"about_ca_system_score_codex":0.000025391146,"about_ca_system_score_gemma":0.000019524463,"threshold_uncertainty_score":0.3124467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10779314,0.00006454827,0.82691824,0.00018230909,0.0012940123,0.00009830054,1.6361066e-7,0.00011963216,0.063529655],"genre_scores_gemma":[0.95659935,0.0000036900312,0.042722102,0.000049916674,0.00015164657,9.036453e-7,1.0105023e-7,0.000003520098,0.0004687368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933726,0.0000016236842,0.00021183128,0.00015454293,0.0001463577,0.0001483709],"domain_scores_gemma":[0.99958384,0.0000139648855,0.00011405184,0.00006560511,0.00015747415,0.000065067215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031918258,0.000060369908,0.00009687637,0.00011162712,0.00004057705,0.00005243203,0.00022555355,0.000036122994,0.00001532044],"category_scores_gemma":[0.000014233111,0.000055141914,0.000047414855,0.00037451106,0.000021300928,0.00030979607,0.00004179742,0.00006246631,0.000011304807],"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.000007898978,0.000008293052,0.0053254664,0.00002080048,0.000010255947,8.955046e-7,0.00092766684,0.0000013935144,0.00308302,0.9080177,0.007252757,0.07534387],"study_design_scores_gemma":[0.0037974047,0.0015286134,0.034362853,0.0008156004,0.0000552602,0.003266012,0.0058890632,0.043722264,0.3354543,0.267084,0.30204296,0.0019816924],"about_ca_topic_score_codex":0.000055346318,"about_ca_topic_score_gemma":0.000003840637,"teacher_disagreement_score":0.84880626,"about_ca_system_score_codex":0.000014796093,"about_ca_system_score_gemma":0.000016053358,"threshold_uncertainty_score":0.22486219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1355256,0.000025958823,0.8371508,0.00010170872,0.00052213727,0.00005363204,2.0185807e-8,0.00007648857,0.02654365],"genre_scores_gemma":[0.93251765,7.7639305e-7,0.06693571,0.0002016422,0.00004087017,0.0000037114585,5.4737704e-8,0.0000038618455,0.00029569998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917746,0.000085878724,0.00021457489,0.00020849408,0.00009461915,0.00021895624],"domain_scores_gemma":[0.9995994,0.00010337285,0.00003515433,0.00018809245,0.000029771205,0.000044205004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006036857,0.00006839383,0.000096114476,0.00007102133,0.00006344685,0.00012528815,0.00018554165,0.000037738795,0.000015635822],"category_scores_gemma":[0.00012520232,0.000058075133,0.00002856205,0.00022477457,0.0000035456062,0.0002452165,0.00003934361,0.00012820169,0.00004005248],"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.000002025177,0.00006747471,0.01741867,0.000019543084,0.000011073427,0.00005756386,0.0028030635,0.035210226,0.0023536356,0.9229541,0.00024241443,0.01886021],"study_design_scores_gemma":[0.00019394336,0.000011911981,0.0002910258,0.00004468227,3.8045565e-7,0.000032362586,0.00015437444,0.9967825,0.000495259,0.0007352648,0.0011507877,0.00010750212],"about_ca_topic_score_codex":0.000088196226,"about_ca_topic_score_gemma":0.00012852169,"teacher_disagreement_score":0.9615723,"about_ca_system_score_codex":0.00003144464,"about_ca_system_score_gemma":0.000017255104,"threshold_uncertainty_score":0.23682351},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074790916,0.0002106973,0.98393685,0.00046941792,0.0005132431,0.00016022511,5.887397e-7,0.00010981595,0.0071200784],"genre_scores_gemma":[0.90771335,0.0000035143503,0.085880704,0.00016037523,0.00014637204,0.0000246008,2.985192e-7,0.0000053316403,0.006065433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992138,0.000021759432,0.00017233125,0.0002580006,0.00010372301,0.0002303674],"domain_scores_gemma":[0.9995978,0.00007785129,0.00004253889,0.00017844776,0.00004441307,0.000058942715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864979,0.00008385353,0.000111767506,0.00003520779,0.00019375031,0.00025474263,0.00019354482,0.000040823903,0.00003250963],"category_scores_gemma":[0.000011051584,0.000066878994,0.000048105172,0.000092481554,0.000017312152,0.000079880214,0.000080418125,0.000047651072,0.000013982236],"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.000009351853,0.00017407404,0.00020773486,0.00003840338,0.00006678096,0.000015514232,0.0050109546,0.08770381,0.0001221473,0.78456515,0.028120972,0.09396513],"study_design_scores_gemma":[0.00028847365,0.00006855261,0.00003959578,0.000009321149,0.0000016959788,0.000029833202,0.00007495444,0.9922671,0.000019886167,0.000076653385,0.007023927,0.00010005302],"about_ca_topic_score_codex":0.000016502612,"about_ca_topic_score_gemma":0.0000031050904,"teacher_disagreement_score":0.90456325,"about_ca_system_score_codex":0.00001683382,"about_ca_system_score_gemma":0.0000035919113,"threshold_uncertainty_score":0.27272463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007029166,0.00013799583,0.8981111,0.00023178147,0.00042713725,0.0000802547,1.3123408e-8,0.000119297314,0.10082212],"genre_scores_gemma":[0.8134171,0.00001587738,0.18258446,0.0005824173,0.000049783604,0.000012574763,2.4334864e-7,0.0000035846965,0.003334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992097,0.00030707105,0.00013526967,0.00012168072,0.0000780197,0.00014823227],"domain_scores_gemma":[0.9992362,0.000115726194,0.00003807912,0.0005267031,0.00004840896,0.00003487111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070585776,0.000052770713,0.00006541706,0.000017610828,0.00014197687,0.00011854497,0.00038774774,0.000034145174,0.00006911981],"category_scores_gemma":[0.000016236918,0.000043630076,0.00002823444,0.00020619798,0.000009471977,0.00019848651,0.000038540846,0.000059598908,0.00013318045],"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":[4.512747e-7,0.000007780164,0.00007479774,6.017824e-7,0.000004364884,4.595891e-7,0.00009092241,0.010434436,0.000007876214,0.93829715,0.049283367,0.0017978166],"study_design_scores_gemma":[0.00027993557,0.00007981615,0.00016166545,0.00003001121,0.000002671457,0.00006348214,0.000057819954,0.59087545,0.0006316602,0.04323815,0.36431417,0.00026516546],"about_ca_topic_score_codex":0.0000128895435,"about_ca_topic_score_gemma":0.000010011556,"teacher_disagreement_score":0.895059,"about_ca_system_score_codex":0.000016710494,"about_ca_system_score_gemma":0.000016898908,"threshold_uncertainty_score":0.17791829},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05046611,0.00012552836,0.9174168,0.00023944238,0.004604024,0.0001368636,2.6516437e-7,0.00015432254,0.026856618],"genre_scores_gemma":[0.99523675,0.0000045843126,0.0034041358,0.00019800969,0.0007302002,0.000012518433,5.4628987e-7,0.0000066343614,0.00040661817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911255,0.00004626748,0.00020254141,0.00025104414,0.000109697336,0.0002779029],"domain_scores_gemma":[0.9993728,0.00016635787,0.0000592638,0.00029020308,0.000055136952,0.000056284756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003515998,0.0000932166,0.00012375323,0.00006655193,0.00007351203,0.00011583056,0.00041120645,0.000107397784,0.00002449848],"category_scores_gemma":[0.000034882243,0.00008435307,0.00003537707,0.0004123131,0.000020169573,0.00023502366,0.00009710989,0.00041699893,0.0000213121],"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.000035897585,0.00020623165,0.038731888,0.000018888155,0.000044653058,0.00021723946,0.0034400946,0.2754927,0.0009835107,0.24349695,0.02064723,0.41668472],"study_design_scores_gemma":[0.00017732097,0.000027412663,0.004996333,0.000030972078,6.6038695e-7,0.000032119926,0.000026050455,0.984586,0.00001885076,0.00040508035,0.009574105,0.00012510501],"about_ca_topic_score_codex":0.00012095397,"about_ca_topic_score_gemma":0.004158698,"teacher_disagreement_score":0.94477063,"about_ca_system_score_codex":0.000016866532,"about_ca_system_score_gemma":0.000027261038,"threshold_uncertainty_score":0.34398183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013135815,0.000107025066,0.98797166,0.0010794073,0.0011214677,0.00030199304,0.0000025821166,0.0002534114,0.007848882],"genre_scores_gemma":[0.9660005,0.000002387555,0.019761289,0.000829791,0.00013425374,0.000054906814,0.0000018945254,0.000012498396,0.013202464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988926,0.00005643676,0.00022473455,0.00036782035,0.00016955237,0.00028883095],"domain_scores_gemma":[0.99923396,0.000118557284,0.00005720597,0.00038432988,0.00012875118,0.000077213044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019334815,0.00015650195,0.00018605741,0.000083861974,0.00014657014,0.00023817677,0.0005478688,0.000099346216,0.0003364689],"category_scores_gemma":[0.000013398046,0.00011087656,0.000105727806,0.0002274194,0.000015665002,0.00011960686,0.000069845504,0.00011406448,0.000052076135],"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.000014550735,0.00009108194,0.00001635459,0.00003483591,0.000089349705,0.0000045482866,0.00095055706,0.008989655,0.0016272641,0.8939782,0.062045563,0.03215808],"study_design_scores_gemma":[0.0005886481,0.00016978203,0.000041379004,0.0000360628,0.0000075062644,0.000053040243,0.00017118437,0.9090503,0.00459295,0.052537046,0.03244959,0.00030253522],"about_ca_topic_score_codex":0.000074578966,"about_ca_topic_score_gemma":0.00013351614,"teacher_disagreement_score":0.96821034,"about_ca_system_score_codex":0.000022263162,"about_ca_system_score_gemma":0.0000098119535,"threshold_uncertainty_score":0.45214146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030692348,0.000020242052,0.9924487,0.0006884074,0.0025318086,0.00026055233,0.000009447809,0.0001932493,0.0007783744],"genre_scores_gemma":[0.8413169,0.000007213379,0.153472,0.001917564,0.0025349322,0.000060638245,0.00001703206,0.00004544325,0.0006282959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982166,0.00027791152,0.00040279113,0.00043821917,0.00033602724,0.0003284228],"domain_scores_gemma":[0.998494,0.00013350432,0.0001610815,0.0008938507,0.00016441836,0.00015311356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008220274,0.00018057716,0.00027936784,0.00016590486,0.00022782809,0.00012208588,0.0011070706,0.00008278868,0.000015350788],"category_scores_gemma":[0.000016770235,0.00013117978,0.0001262606,0.00065801106,0.000053342344,0.00031952444,0.00014741064,0.00015561405,0.00016112598],"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.0000108928125,0.00017562634,0.00003389735,0.000010758627,0.00008892121,0.000004016283,0.0013109663,0.0039329436,0.0026729053,0.018493492,0.025849279,0.9474163],"study_design_scores_gemma":[0.00019959352,0.00053282146,0.0004743028,0.000026273725,0.00000784159,0.000051232746,0.00001718554,0.96793413,0.002728745,0.0031320176,0.024697969,0.00019791389],"about_ca_topic_score_codex":0.00014198702,"about_ca_topic_score_gemma":0.000013160318,"teacher_disagreement_score":0.9640012,"about_ca_system_score_codex":0.000028384833,"about_ca_system_score_gemma":0.000026270538,"threshold_uncertainty_score":0.5349356},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050177637,0.000045744233,0.8992192,0.00012308959,0.0005205033,0.0000452235,9.923414e-8,0.00007868488,0.049789783],"genre_scores_gemma":[0.991507,0.0000043184405,0.005531365,0.00006088889,0.000041473533,0.0000019100721,5.376009e-8,0.0000018237372,0.0028511456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995975,0.000016649527,0.00012246001,0.000101681566,0.000080944454,0.00008076943],"domain_scores_gemma":[0.9996868,0.0000332114,0.000029561088,0.00020044557,0.00002900843,0.000021019077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000745837,0.00003493965,0.00006167947,0.000032957025,0.000030346373,0.000019975416,0.00018289212,0.000020283354,0.000116493284],"category_scores_gemma":[0.0000066536327,0.000027489987,0.000032163865,0.00009455084,0.0000056133836,0.00014028928,0.000046635418,0.000027230048,0.00006195262],"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.0000080079835,0.0002911888,0.013939895,0.00010042364,0.000062477426,0.000031197942,0.0108514745,0.010430694,0.03347329,0.61008495,0.06706271,0.25366372],"study_design_scores_gemma":[0.000117894524,0.00002600798,0.00030244203,0.000015237046,3.7905954e-7,0.0000074976633,0.000041006868,0.99042064,0.0050385715,0.00008496131,0.0038993666,0.000045989455],"about_ca_topic_score_codex":0.00005245695,"about_ca_topic_score_gemma":0.000016939139,"teacher_disagreement_score":0.97998995,"about_ca_system_score_codex":0.0000062596187,"about_ca_system_score_gemma":0.0000012433161,"threshold_uncertainty_score":0.12755197},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027111853,0.000116502924,0.8923602,0.0005639073,0.0017675081,0.00008913034,1.1229136e-7,0.00022891257,0.10216251],"genre_scores_gemma":[0.97822475,0.0000024198864,0.01496291,0.00060933887,0.00034835807,0.0000065258987,9.8994605e-8,0.0000040446994,0.0058415756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992046,0.00004069969,0.00016052046,0.000209043,0.0001357119,0.00024946054],"domain_scores_gemma":[0.9994732,0.0000567528,0.000031459498,0.00032625237,0.000043716052,0.00006857621],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001649379,0.000073000854,0.00009134595,0.000024594023,0.00011446426,0.00011855923,0.00032383815,0.000035157438,0.00048297542],"category_scores_gemma":[0.000007093121,0.00005644593,0.000050414572,0.00023554679,0.000013405372,0.00004383268,0.00008159449,0.000064163454,0.0010814153],"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.0000018019583,0.00011743984,0.0004514799,0.000005255823,0.000019490653,0.000021599135,0.000711738,0.2398255,0.000038804188,0.45744887,0.28157714,0.019780863],"study_design_scores_gemma":[0.000111354355,0.000027274074,0.00006007693,0.000008458965,6.899382e-7,0.000021842805,0.000009613826,0.96665394,0.00002231255,0.00007496092,0.032928213,0.00008123881],"about_ca_topic_score_codex":0.00001299449,"about_ca_topic_score_gemma":0.000006228428,"teacher_disagreement_score":0.9755135,"about_ca_system_score_codex":0.000018624034,"about_ca_system_score_gemma":0.0000023126192,"threshold_uncertainty_score":0.9996964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025599122,0.000269744,0.9697762,0.001486687,0.0016700173,0.00011857523,4.5334613e-7,0.00039271158,0.023725664],"genre_scores_gemma":[0.9894913,0.000034781504,0.001277863,0.002279043,0.00021086678,0.000016698832,8.7590763e-7,0.000009046563,0.006679535],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987124,0.00008731658,0.000303986,0.00040731963,0.00017038493,0.00031858674],"domain_scores_gemma":[0.9990857,0.00010354043,0.00008151925,0.0004899581,0.00013423258,0.00010503957],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019134211,0.00015676352,0.00018094861,0.00007291043,0.00012708644,0.00020916128,0.0005196972,0.00012109938,0.0009756149],"category_scores_gemma":[0.000017444649,0.00013283605,0.00008528018,0.00036823784,0.000045473043,0.00045832255,0.00011043943,0.00020171776,0.000380625],"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.000015521977,0.00019832596,0.00092127494,0.000020045572,0.00009721742,0.000060154995,0.0019520246,0.034911998,0.00011124048,0.17253146,0.5790133,0.21016745],"study_design_scores_gemma":[0.00020812124,0.00007566043,0.00019086196,0.000042499265,0.00000222593,0.000070503105,0.000050083618,0.9817548,0.0001387477,0.00029261908,0.016991248,0.00018267018],"about_ca_topic_score_codex":0.000046141777,"about_ca_topic_score_gemma":0.00006442901,"teacher_disagreement_score":0.9869314,"about_ca_system_score_codex":0.0000593001,"about_ca_system_score_gemma":0.0000051660772,"threshold_uncertainty_score":0.99993765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051380385,0.00014928996,0.8724995,0.0048219706,0.0008046894,0.00032914625,3.2915e-7,0.00030094292,0.0697137],"genre_scores_gemma":[0.9939074,0.000008129911,0.0021995448,0.0021239477,0.0002014047,0.0000069680164,2.7036123e-7,0.000003840209,0.0015484793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893403,0.00007029672,0.00023398382,0.00028927665,0.00019570223,0.00027668642],"domain_scores_gemma":[0.99940825,0.00009075055,0.00010458845,0.00030652233,0.00004043353,0.00004948881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068949565,0.00011335542,0.00010637046,0.00004460399,0.00030801923,0.00029631582,0.0003135359,0.000033638895,0.000015846157],"category_scores_gemma":[0.000029034889,0.00006749262,0.00004833582,0.00017033448,0.00001627501,0.00013841574,0.00007068779,0.0001207559,0.00001566423],"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.0000041588405,0.00006953395,0.0009498788,0.0000045583483,0.000030136625,0.000008581021,0.00340189,0.0004999783,0.0003516906,0.63910943,0.017341208,0.33822897],"study_design_scores_gemma":[0.0007747407,0.0010020442,0.01071434,0.00029064395,0.000013117458,0.000104157196,0.0009191024,0.93927526,0.001667385,0.015649261,0.02887804,0.00071188505],"about_ca_topic_score_codex":0.00005664493,"about_ca_topic_score_gemma":0.000015888385,"teacher_disagreement_score":0.94252706,"about_ca_system_score_codex":0.000015286101,"about_ca_system_score_gemma":0.0000071855247,"threshold_uncertainty_score":0.28573802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06357651,0.000021504604,0.9297003,0.0009988531,0.00090885325,0.00014949476,5.226828e-7,0.00025246968,0.0043915063],"genre_scores_gemma":[0.9891658,8.374014e-7,0.0076477295,0.0016879209,0.00040316253,0.0000031605946,8.30104e-7,0.0000065083664,0.0010840574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862766,0.000051442654,0.00027882573,0.00051613833,0.00019634656,0.00032961267],"domain_scores_gemma":[0.99902844,0.000029996518,0.00006149159,0.00068801874,0.00009999138,0.0000920826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034640776,0.00015899216,0.0001896497,0.00008444889,0.00016026464,0.00025768607,0.000627057,0.000098808225,0.000035946636],"category_scores_gemma":[0.000015717624,0.00012110474,0.00010764141,0.00025842036,0.000013713859,0.00037449066,0.00017245357,0.00020961728,0.000026390773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001220466,0.0007940006,0.0062634232,0.00022130426,0.00015981212,0.00019729736,0.019049233,0.6340137,0.0077877115,0.17731766,0.020552272,0.13352153],"study_design_scores_gemma":[0.00017398265,0.00008002975,0.0018948887,0.000058181336,0.0000027512701,0.00007780536,0.000025930927,0.9868053,0.00042871994,0.008307752,0.0018995991,0.00024502835],"about_ca_topic_score_codex":0.00013283,"about_ca_topic_score_gemma":0.000028265646,"teacher_disagreement_score":0.92558926,"about_ca_system_score_codex":0.00007134746,"about_ca_system_score_gemma":0.000022303071,"threshold_uncertainty_score":0.4938508},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014174514,0.00003382397,0.97663826,0.00006907743,0.0000506485,0.00027310144,1.1129234e-7,0.00007197616,0.008688502],"genre_scores_gemma":[0.8951622,0.000042225765,0.10456325,0.00011738824,0.000019762492,0.000038729722,0.0000012231776,0.000009358072,0.00004583331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991895,0.000045215605,0.00028294977,0.0001800238,0.00012482978,0.0001774746],"domain_scores_gemma":[0.9989923,0.00037314201,0.00011187785,0.00046731145,0.000017159888,0.00003817656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049168157,0.000109874585,0.00017401921,0.000056121648,0.00015770644,0.00006791617,0.0003289682,0.00006423678,0.0000025258867],"category_scores_gemma":[0.000016860728,0.00009486828,0.000021763168,0.00017853388,0.00003598148,0.000094706906,0.00011747883,0.00015496589,0.000011514153],"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.0000041362614,0.000033531727,0.000017251956,0.000012045621,0.0000060790803,0.0000033426504,0.0036530804,0.020796502,0.000043525724,0.9738572,0.00038010193,0.0011931808],"study_design_scores_gemma":[0.00022194868,0.000023654364,0.00007046446,0.00007391432,0.0000016779057,0.000024631066,0.00016256777,0.9807242,0.00007792922,0.018464303,0.000033159424,0.00012155415],"about_ca_topic_score_codex":0.0000060279267,"about_ca_topic_score_gemma":0.0000033213025,"teacher_disagreement_score":0.9599277,"about_ca_system_score_codex":0.00002679752,"about_ca_system_score_gemma":0.000009198033,"threshold_uncertainty_score":0.3868616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014638801,0.00004755662,0.97918826,0.00022800165,0.0010244107,0.00012697204,0.0000021157252,0.000025983047,0.004717886],"genre_scores_gemma":[0.99715537,0.0000054322227,0.00095780235,0.0006731068,0.0010934152,0.000034855962,0.000001979904,0.0000060520642,0.00007197519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896675,0.000111865054,0.00038099923,0.00018475368,0.00022537449,0.00013025227],"domain_scores_gemma":[0.9985708,0.0004188792,0.0003112065,0.0002643618,0.00034238113,0.000092349444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015407247,0.00009961111,0.00013847681,0.00015240909,0.0001487483,0.00018239304,0.0008514596,0.00008082063,0.000027309627],"category_scores_gemma":[0.00007651701,0.000081381026,0.00010274103,0.00011292668,0.00010158876,0.00028002542,0.000054725017,0.0004392306,0.000004777898],"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.000021537975,0.000093125505,0.00022919924,0.0000034178443,0.000031734235,0.00000178404,0.00009968114,0.0013962627,0.00047210997,0.9354574,0.000044674198,0.062149055],"study_design_scores_gemma":[0.0020772608,0.0004000415,0.0022163605,0.00007149164,0.00005069899,0.0020063613,0.00042979242,0.29651472,0.0009641776,0.6494858,0.045201857,0.0005813922],"about_ca_topic_score_codex":0.0000025632726,"about_ca_topic_score_gemma":0.000001630665,"teacher_disagreement_score":0.9825166,"about_ca_system_score_codex":0.000025844909,"about_ca_system_score_gemma":0.00006376757,"threshold_uncertainty_score":0.33186218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1917337,0.000033187127,0.80454636,0.00007121247,0.00015620784,0.0008073408,0.00000300204,0.00003914883,0.0026098222],"genre_scores_gemma":[0.98905563,3.6323937e-7,0.010425856,0.00002384744,0.00004871039,0.000104885185,0.0000024993883,0.000004843029,0.00033336884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999163,0.00001723234,0.00040394726,0.00015923263,0.000111510155,0.00014510502],"domain_scores_gemma":[0.9992947,0.000065363245,0.00021387597,0.00014734101,0.00026382392,0.000014876855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002583151,0.000066112065,0.00014520978,0.000058325313,0.000053858166,0.000042476935,0.00018571745,0.000032045536,0.000024847655],"category_scores_gemma":[0.000008540432,0.000056443747,0.000060648348,0.00017097875,0.000016486289,0.00021696772,0.000018199202,0.000020914556,0.0000010498381],"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.000091130765,0.00039001883,0.013106215,0.0010565615,0.000074745614,8.330666e-7,0.0033890246,0.0036175956,0.3680745,0.55487615,0.0036366913,0.051686507],"study_design_scores_gemma":[0.0013592904,0.000393286,0.0016814047,0.000081784674,0.0000056875256,0.0000053366293,0.00065403915,0.108904414,0.8795704,0.0031761553,0.004003192,0.00016500012],"about_ca_topic_score_codex":0.001268485,"about_ca_topic_score_gemma":0.00040757912,"teacher_disagreement_score":0.7973219,"about_ca_system_score_codex":0.000016024442,"about_ca_system_score_gemma":0.000032297954,"threshold_uncertainty_score":0.23017092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50699455,0.00001755667,0.47353065,0.0051088985,0.000117298536,0.0005753355,0.000002657366,0.00006999332,0.013583085],"genre_scores_gemma":[0.9940539,0.000010738986,0.0022225245,0.00089134264,0.000016973629,0.000019126177,0.0000076868555,0.00000271928,0.0027750146],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994009,0.00007206396,0.00020963547,0.00014109825,0.00010309549,0.00007320595],"domain_scores_gemma":[0.9993426,0.000045784825,0.00008924084,0.00030554403,0.0001958678,0.000020953279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024154002,0.00006674544,0.00009030659,0.000045650853,0.00021426073,0.000106403844,0.00023281004,0.00003639175,0.000009743609],"category_scores_gemma":[0.000018030069,0.000044627883,0.000019340867,0.00023429716,0.000022508602,0.00025478494,0.000030247917,0.000060020906,0.0000018785728],"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.000040147228,0.0016945555,0.0009128943,0.000033376433,0.0000436787,0.0000017764501,0.024531528,0.0015210178,0.7224359,0.2374884,0.0023775538,0.0089191925],"study_design_scores_gemma":[0.00056727376,0.0007037324,0.014276914,0.00008666254,0.000009679072,0.000017094493,0.00052996376,0.7416483,0.240047,0.0003544111,0.0015004256,0.00025853366],"about_ca_topic_score_codex":0.000016324759,"about_ca_topic_score_gemma":0.000037537924,"teacher_disagreement_score":0.7401273,"about_ca_system_score_codex":0.000026071371,"about_ca_system_score_gemma":0.00004059241,"threshold_uncertainty_score":0.18198723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059462763,0.00005301556,0.93434143,0.00012067815,0.00020165369,0.00011304543,1.3830378e-7,0.00003464727,0.0056726076],"genre_scores_gemma":[0.99479663,0.000025441712,0.0043449034,0.00006282529,0.0000746861,0.000013367648,3.0928754e-7,0.0000024721369,0.0006793729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995397,0.00001213464,0.00015851822,0.0001284913,0.000057728117,0.000103442275],"domain_scores_gemma":[0.9996921,0.000076052085,0.00004747515,0.00009630438,0.000059805472,0.000028293582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013543991,0.00004638461,0.000084567124,0.0000306267,0.00006807834,0.000037646714,0.00011000044,0.000036002682,0.000012482034],"category_scores_gemma":[0.000010569538,0.000038320508,0.000020215,0.000076618264,0.000024604306,0.00021519599,0.00002143457,0.00004164321,0.0000013640893],"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.000035313937,0.00010629221,0.0053543723,0.0002604689,0.000046012967,0.0000010315523,0.0036455337,0.05718124,0.0007731804,0.36456558,0.004660388,0.5633706],"study_design_scores_gemma":[0.00020044377,0.00007683085,0.00045695505,0.000019002304,9.811945e-7,0.0000058923624,0.000013154854,0.9977897,0.0005122738,0.00005559023,0.0008190809,0.00005013344],"about_ca_topic_score_codex":0.0000035795942,"about_ca_topic_score_gemma":0.000002821412,"teacher_disagreement_score":0.94060844,"about_ca_system_score_codex":0.000004622983,"about_ca_system_score_gemma":0.000002050743,"threshold_uncertainty_score":0.1562665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048428262,0.0003322579,0.9820363,0.0014110975,0.015086039,0.00029338858,1.5867579e-7,0.00014255352,0.00021393444],"genre_scores_gemma":[0.6247298,0.000024727595,0.36812755,0.0011189898,0.0058358843,0.00003143738,7.395769e-7,0.000016090322,0.00011474366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998389,0.00042017284,0.0004031161,0.00015903516,0.00016273661,0.0004659235],"domain_scores_gemma":[0.9983076,0.000749906,0.00029384697,0.0003448196,0.00017649235,0.00012737869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002850532,0.00014863588,0.00017604398,0.00008932308,0.0006515979,0.00066571496,0.00074342726,0.000111834815,0.00002900457],"category_scores_gemma":[0.00003481083,0.00009880623,0.00014435676,0.00021465303,0.000019340356,0.0010091922,0.00005862525,0.0004226598,0.000034684028],"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.000056316636,0.00010862561,0.000118708915,0.000014347963,0.00018078694,0.0000024342037,0.004828357,0.25852847,0.00005624455,0.3407332,0.0928802,0.3024923],"study_design_scores_gemma":[0.00019566303,0.0001547028,0.00015640112,0.000077653596,0.000009469335,0.00087332405,0.000033378547,0.96565557,0.000120370285,0.025343966,0.0072388663,0.00014062872],"about_ca_topic_score_codex":0.0000024191593,"about_ca_topic_score_gemma":4.6481006e-7,"teacher_disagreement_score":0.7071271,"about_ca_system_score_codex":0.00009680828,"about_ca_system_score_gemma":0.000026305383,"threshold_uncertainty_score":0.6419505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02339896,0.00007147459,0.96329623,0.00040590824,0.009249779,0.0018046275,0.000076350996,0.00049820606,0.0011984514],"genre_scores_gemma":[0.9918377,0.000016611652,0.0017758439,0.0006271303,0.00035110392,0.00037979888,0.000024796524,0.000028826453,0.0049582273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967572,0.00020564074,0.00093256606,0.0008660195,0.00057229784,0.0006662562],"domain_scores_gemma":[0.99806285,0.00021696839,0.00033442644,0.00079099316,0.0004232294,0.0001715379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077513495,0.00045573132,0.0005456059,0.00036282328,0.000632338,0.0006778836,0.0007133301,0.00027846257,0.000047629706],"category_scores_gemma":[0.000015081396,0.00037727944,0.00027818204,0.0005763474,0.000039669332,0.00079904986,0.000003270443,0.00041272,0.00022178107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027926504,0.010326084,0.000067025656,0.000649925,0.0011554696,0.00005974489,0.011882236,0.31667233,0.064989276,0.30617264,0.048145983,0.23708664],"study_design_scores_gemma":[0.0033239964,0.0057286024,0.000043383225,0.0013136432,0.000069712965,0.00007723445,0.0015666456,0.8707611,0.097613975,0.002194148,0.01608538,0.001222207],"about_ca_topic_score_codex":0.00010121586,"about_ca_topic_score_gemma":0.0002318298,"teacher_disagreement_score":0.9684387,"about_ca_system_score_codex":0.0003069996,"about_ca_system_score_gemma":0.000064552616,"threshold_uncertainty_score":0.9998679},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27678782,0.000021938282,0.71203953,0.00017581662,0.00065568025,0.00020861231,0.0000017452757,0.000084974665,0.010023868],"genre_scores_gemma":[0.983241,0.000013091411,0.0115826335,0.0001742497,0.00012697719,0.000020951564,0.0000024149053,0.000008219209,0.004830449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999023,0.000016773924,0.00034413484,0.0002551494,0.00013539068,0.00022550937],"domain_scores_gemma":[0.999269,0.0000432836,0.00007799657,0.00033947095,0.0002257139,0.000044497825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021620521,0.000102255086,0.0002085915,0.00006960148,0.00013033232,0.000038743,0.00038725845,0.0000607796,0.000074667194],"category_scores_gemma":[0.000008982324,0.00008160652,0.00007956014,0.00014192174,0.000011392186,0.00049451774,0.000032353928,0.000057186742,0.000024200728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044271076,0.0005438448,0.005076823,0.00069325085,0.00040719553,0.000020076557,0.013758844,0.63637006,0.019100962,0.19618614,0.10088528,0.026514823],"study_design_scores_gemma":[0.00037477454,0.00011238764,0.00009639319,0.000037684167,0.0000019191882,0.000027491027,0.000019195504,0.9954619,0.002848303,0.00021871943,0.00068309956,0.00011815229],"about_ca_topic_score_codex":0.00015762621,"about_ca_topic_score_gemma":0.000010555646,"teacher_disagreement_score":0.7064532,"about_ca_system_score_codex":0.00002283463,"about_ca_system_score_gemma":0.00003382138,"threshold_uncertainty_score":0.33278176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48539287,0.0017429065,0.37645283,0.0066298554,0.010545213,0.0010976243,0.0000011169484,0.002235931,0.11590163],"genre_scores_gemma":[0.9821678,0.00020361463,0.0014520983,0.00077288586,0.0012013013,0.000035902965,5.81294e-7,0.000015852584,0.014150002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798745,0.00014899201,0.00040833393,0.00041692876,0.00032673625,0.00071156526],"domain_scores_gemma":[0.9986771,0.00023944124,0.00016004394,0.0007025775,0.00012698073,0.00009390561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009603787,0.00020256673,0.00020775976,0.000033774904,0.00095755013,0.0004927177,0.00095290673,0.00009133616,0.00013034137],"category_scores_gemma":[0.000015972544,0.0001330216,0.00009353665,0.00054051966,0.000027551776,0.0004222497,0.00026299557,0.00024839758,0.00040135084],"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.000032192373,0.0002410552,0.006754623,0.00008568025,0.00030178565,0.00004585381,0.005716884,0.006570469,0.00012037061,0.21858947,0.37074712,0.39079452],"study_design_scores_gemma":[0.00033823893,0.000103199345,0.0021793935,0.00003825461,0.000005280331,0.00004914665,0.000039396553,0.94586134,0.00013409636,0.000072600706,0.050953243,0.00022580496],"about_ca_topic_score_codex":0.000121352205,"about_ca_topic_score_gemma":0.00008419411,"teacher_disagreement_score":0.9392909,"about_ca_system_score_codex":0.00008137826,"about_ca_system_score_gemma":0.000015216775,"threshold_uncertainty_score":0.7364798},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02920435,0.00029667094,0.928856,0.0034230861,0.03632993,0.00048550358,4.875439e-7,0.000016517419,0.0013874212],"genre_scores_gemma":[0.99639404,0.00006140653,0.0030943064,0.000049284397,0.0002691034,0.0000027300925,1.6948742e-7,0.000005402025,0.00012357344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986769,0.00020288181,0.0005368293,0.00007345812,0.00038960695,0.000120343306],"domain_scores_gemma":[0.9980013,0.00012223043,0.0007511223,0.00027440808,0.000809413,0.000041528507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221783,0.00007792065,0.00015281356,0.000036447793,0.00018411086,0.0002011341,0.00074279204,0.000044994027,0.00001528551],"category_scores_gemma":[0.00006922129,0.000040811043,0.00014744043,0.00031254697,0.000034536995,0.00040682012,0.00007911028,0.00012823024,0.0000018062098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004692646,0.00018485455,0.00088442693,0.000012041201,0.0001234396,9.549041e-7,0.0007067944,0.88931006,0.00046360822,0.07170032,0.035082266,0.0014842835],"study_design_scores_gemma":[0.0031514415,0.00062737893,0.0013136927,0.00026316714,0.0000388568,0.00005050704,0.00028488005,0.9585174,0.0024657324,0.022588242,0.010462955,0.00023579242],"about_ca_topic_score_codex":0.000012725693,"about_ca_topic_score_gemma":7.5171397e-7,"teacher_disagreement_score":0.96718967,"about_ca_system_score_codex":0.000048496306,"about_ca_system_score_gemma":0.000054277665,"threshold_uncertainty_score":0.19395408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044880994,0.00003600618,0.9498529,0.00039713178,0.0011755896,0.00030120826,6.9459514e-7,0.00005785348,0.0032976149],"genre_scores_gemma":[0.9942987,0.000005200543,0.0041960846,0.00037721824,0.0002594299,0.000032944827,3.9149532e-7,0.000004989976,0.00082503643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990676,0.0000671671,0.00031149664,0.00024144755,0.00012274027,0.0001895398],"domain_scores_gemma":[0.998758,0.0004279593,0.000119962424,0.0005488389,0.000111573005,0.00003366174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007862698,0.00008484284,0.00014788569,0.000025971844,0.00018713115,0.000035432295,0.00045060672,0.000050075723,0.000011743974],"category_scores_gemma":[0.000085646614,0.000049952116,0.00015943259,0.00015887214,0.00004919808,0.00014282297,0.00008421084,0.00008632977,0.000004964879],"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.00038905477,0.0006349607,0.00634754,0.00021155115,0.00021201656,0.000008017597,0.00287706,0.15505368,0.0021985658,0.45158383,0.07337074,0.307113],"study_design_scores_gemma":[0.00021454904,0.00027390543,0.0016217162,0.000016979706,0.0000020915793,0.000023328123,0.00003383065,0.9932551,0.0018224884,0.0012688088,0.0013625596,0.00010468635],"about_ca_topic_score_codex":0.00011102735,"about_ca_topic_score_gemma":0.000025254687,"teacher_disagreement_score":0.9494177,"about_ca_system_score_codex":0.000028499398,"about_ca_system_score_gemma":0.000032994172,"threshold_uncertainty_score":0.20369881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017657036,0.00004356682,0.9234899,0.0031417771,0.0025757893,0.00013991335,0.0000025057636,0.00032456443,0.052624892],"genre_scores_gemma":[0.994529,0.000004192088,0.00087049685,0.0005962271,0.00035568522,0.0000036559024,0.000008370224,0.0000022206748,0.0036301287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916863,0.00004505689,0.00021939802,0.00022764462,0.000121574514,0.00021770665],"domain_scores_gemma":[0.99950385,0.000017833006,0.000050524002,0.0002928571,0.00006923587,0.00006571752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021841725,0.00008668552,0.00012172187,0.00001984518,0.00011796613,0.0002124395,0.00030133012,0.00006187227,0.000101948506],"category_scores_gemma":[0.000007526538,0.000070370785,0.000061369334,0.00016126203,0.0000061278474,0.00031009206,0.0000120560435,0.00007211156,0.00017104634],"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.000020698704,0.00008330542,0.000031674128,0.0000050464,0.000010849411,0.0000131641755,0.00029845999,0.0012486312,0.0021520494,0.7768708,0.16611052,0.05315481],"study_design_scores_gemma":[0.0010922134,0.0005412209,0.001840943,0.00007025943,0.0000056385916,0.00017557462,0.0000788667,0.4642347,0.011377868,0.016652932,0.5033261,0.00060366915],"about_ca_topic_score_codex":0.000057866775,"about_ca_topic_score_gemma":0.0000128577685,"teacher_disagreement_score":0.97687197,"about_ca_system_score_codex":0.000038607268,"about_ca_system_score_gemma":0.000020257887,"threshold_uncertainty_score":0.28696373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066772364,0.0008148873,0.9870216,0.0007825766,0.0008729503,0.0014127941,0.000043590477,0.00085515244,0.0015191924],"genre_scores_gemma":[0.98873585,0.00015343429,0.0032947904,0.00009845645,0.000065192115,0.002695839,0.000009843945,0.000024327523,0.0049222363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980465,0.00008328055,0.0005434782,0.00072989764,0.00014311317,0.0004537291],"domain_scores_gemma":[0.9976904,0.00038067266,0.00018043054,0.0014464777,0.00019711995,0.000104946484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036653242,0.00025592025,0.00043982812,0.0006801603,0.0010649037,0.00008709205,0.0008586265,0.0003881846,0.000027945887],"category_scores_gemma":[0.000046909045,0.00023981174,0.00010672213,0.0010192713,0.00014306039,0.0003641234,0.000011309591,0.00030726867,0.000086041735],"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.00029099683,0.0017791764,0.0009516603,0.000996807,0.0013066413,0.00008141728,0.0022680073,0.012130113,0.012474342,0.51904446,0.01590492,0.43277147],"study_design_scores_gemma":[0.004205224,0.0018733803,0.0001222854,0.00066080055,0.00016534103,0.0047285976,0.0043657827,0.38174182,0.053348284,0.013752875,0.5327529,0.002282736],"about_ca_topic_score_codex":0.00006584599,"about_ca_topic_score_gemma":0.000026905935,"teacher_disagreement_score":0.98372686,"about_ca_system_score_codex":0.00006411552,"about_ca_system_score_gemma":0.000069180314,"threshold_uncertainty_score":0.97792387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018640597,0.00007719084,0.994783,0.00042680217,0.0006953583,0.0009098142,0.0000012706665,0.0001668068,0.001075687],"genre_scores_gemma":[0.66109896,0.0000132447685,0.33763656,0.00058269786,0.00007173674,0.00018496407,4.900174e-7,0.000013012068,0.00039835926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755573,0.0012658446,0.00027189456,0.0004512921,0.00016273269,0.0002924815],"domain_scores_gemma":[0.9910014,0.007924373,0.00010992435,0.00077274494,0.00009920735,0.000092331255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433592,0.00018723721,0.00024838015,0.000063000916,0.00046209595,0.0008465343,0.00044962487,0.000092283495,0.0000028296051],"category_scores_gemma":[0.0010600636,0.000094731746,0.000046888617,0.00014720022,0.000057403988,0.00030753235,0.000043977692,0.00010963077,0.0000038824287],"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.000857789,0.00019102302,0.00008921533,0.00015088399,0.000113982904,0.000027272072,0.0018688565,0.023633912,0.0021681201,0.8540207,0.024316967,0.09256126],"study_design_scores_gemma":[0.0012428293,0.0029548851,0.00016462985,0.00015059974,0.000015562255,0.00008118936,0.001310048,0.97208536,0.008146733,0.0094269775,0.004051358,0.00036982208],"about_ca_topic_score_codex":0.000014319037,"about_ca_topic_score_gemma":0.000009705961,"teacher_disagreement_score":0.94845146,"about_ca_system_score_codex":0.00003899315,"about_ca_system_score_gemma":0.000050394076,"threshold_uncertainty_score":0.816315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08985143,0.00066913624,0.9055278,0.00012937849,0.0034908357,0.00023561063,7.470991e-7,0.000017682998,0.00007742589],"genre_scores_gemma":[0.9975184,0.00003951497,0.0012081958,0.0002448206,0.0009615565,0.0000034880916,5.7586016e-7,0.000009855065,0.000013585675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853647,0.00006294668,0.00071551814,0.00020244425,0.00021752685,0.0002651108],"domain_scores_gemma":[0.99885255,0.0002238184,0.00042392293,0.00013342759,0.00021048335,0.00015578332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016917655,0.00014076845,0.00030512153,0.00020591635,0.00015951999,0.00037734382,0.00022578401,0.00006557038,2.684593e-7],"category_scores_gemma":[0.000006433227,0.000116230665,0.000088905545,0.00011872901,0.000013279051,0.00039915892,0.000035115147,0.00012630057,2.2893651e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072955314,0.000065764354,0.0018183019,0.00022822268,0.0003362639,0.000059807167,0.004136161,0.48688808,0.00023970494,0.20730995,0.0040990785,0.2947457],"study_design_scores_gemma":[0.00093011244,0.00048072985,0.00038422053,0.0002437683,0.000012042138,0.0005844245,0.0007221355,0.9949765,0.000010638394,0.00028593134,0.00121691,0.00015257273],"about_ca_topic_score_codex":0.000039988576,"about_ca_topic_score_gemma":0.000011137658,"teacher_disagreement_score":0.907667,"about_ca_system_score_codex":0.000055114775,"about_ca_system_score_gemma":0.000026359414,"threshold_uncertainty_score":0.47397488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5458005,0.00007898167,0.44288272,0.00081135123,0.00028109972,0.00017163798,1.5784747e-7,0.000078669946,0.0098948665],"genre_scores_gemma":[0.9972493,0.000004437091,0.0012318268,0.00054320344,0.000079399695,0.000013957275,4.966317e-7,0.000004968096,0.0008723883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00014348587,0.00022092613,0.00018957852,0.00041495537,0.00014370243],"domain_scores_gemma":[0.9992637,0.000061564824,0.00008065182,0.0003172794,0.00024230947,0.00003448383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068130717,0.00008526176,0.00013258358,0.000070279304,0.00006870925,0.00004278736,0.00031885086,0.00004887105,0.0002531141],"category_scores_gemma":[0.000009128355,0.00006476443,0.00005229907,0.00033437155,0.000010842405,0.0001601117,0.000038122053,0.00008205898,0.00006486539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006734724,0.000030374384,0.00003861045,0.000015597014,0.000012081312,7.345221e-8,0.001595282,0.9263916,0.00010862036,0.00035447322,0.0007164679,0.070730105],"study_design_scores_gemma":[0.0010283346,0.000031667194,0.00024829514,0.000029054569,0.000008398078,0.00001858272,0.00006346672,0.99728584,0.00014996821,0.00003383747,0.0010203109,0.00008222192],"about_ca_topic_score_codex":0.000021203094,"about_ca_topic_score_gemma":0.0000595398,"teacher_disagreement_score":0.4514488,"about_ca_system_score_codex":0.000026422773,"about_ca_system_score_gemma":0.000014938154,"threshold_uncertainty_score":0.2771422},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27738228,0.00007365918,0.46156204,0.014185003,0.0027997624,0.00029099724,3.4714827e-7,0.00042286783,0.24328305],"genre_scores_gemma":[0.992293,0.0000053354584,0.00066180003,0.0025607042,0.00019769596,0.000007911671,5.433503e-8,0.0000045797938,0.0042689145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991683,0.000082068924,0.00014927339,0.00022269913,0.00018701842,0.00019068549],"domain_scores_gemma":[0.999166,0.00020574925,0.0000385658,0.0005127858,0.000033833414,0.000043027434],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034363585,0.00009028707,0.00008822939,0.000028921848,0.00022425712,0.00020665556,0.00051051116,0.000021149372,0.00032707784],"category_scores_gemma":[0.000031693024,0.0000489883,0.000062558924,0.00015881888,0.000007884956,0.00017703752,0.00008232562,0.00016735688,0.00086591515],"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.0000024027004,0.00012735193,0.0019405626,0.0000051398415,0.00002695353,0.000014993003,0.0019951274,0.0002819987,0.00051456806,0.7802663,0.1235084,0.09131621],"study_design_scores_gemma":[0.00016981088,0.000053444826,0.0005503724,0.000020995705,0.0000013858519,0.00005714738,0.00012238088,0.90105826,0.00063819,0.0012447938,0.09591317,0.00017006126],"about_ca_topic_score_codex":0.000083094375,"about_ca_topic_score_gemma":0.000033119322,"teacher_disagreement_score":0.90077627,"about_ca_system_score_codex":0.000022644232,"about_ca_system_score_gemma":0.0000030757237,"threshold_uncertainty_score":0.999912},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2886962,0.00011792525,0.56796914,0.00033128788,0.0018865856,0.000114012255,1.2016814e-7,0.00027862273,0.14060614],"genre_scores_gemma":[0.9937633,0.0000096408985,0.0037750297,0.00028291624,0.00003592622,0.0000045393335,1.7686651e-7,0.0000029994974,0.002125441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993035,0.000037644873,0.00017960704,0.00019097314,0.00011095482,0.00017729965],"domain_scores_gemma":[0.99966264,0.000039542258,0.000028594313,0.00020186865,0.000030055086,0.00003730151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013912511,0.00006248492,0.0000927488,0.00010911642,0.000081730024,0.000033481883,0.00028060487,0.000034608005,0.00004198017],"category_scores_gemma":[0.000007213242,0.000051016126,0.00003916671,0.00040238677,0.000013294412,0.0002555208,0.000060265476,0.00007957177,0.000088571396],"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.000004623966,0.00009890356,0.039925355,0.000009966263,0.000014097075,0.0002643377,0.0026849627,0.00032100576,0.00026980296,0.8815874,0.039774954,0.03504463],"study_design_scores_gemma":[0.00045211488,0.00006407019,0.011602173,0.000046323756,5.732685e-7,0.00050998305,0.00006800075,0.96785855,0.00035783878,0.0073171235,0.011461894,0.0002613666],"about_ca_topic_score_codex":0.00016577927,"about_ca_topic_score_gemma":0.000082172686,"teacher_disagreement_score":0.9675375,"about_ca_system_score_codex":0.000017714445,"about_ca_system_score_gemma":0.000015616855,"threshold_uncertainty_score":0.20803772},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014697829,0.00006784366,0.9564422,0.0004028123,0.0026566582,0.00022081539,7.143073e-7,0.00021498848,0.025296135],"genre_scores_gemma":[0.96675336,0.000013950523,0.015913375,0.0026586954,0.0016276769,0.000055661163,0.0000017609939,0.000011639121,0.012963888],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990244,0.00003275393,0.00019753144,0.0002894927,0.00013592515,0.00031988305],"domain_scores_gemma":[0.99934894,0.00009452684,0.00005275691,0.00037150335,0.0000646054,0.000067639994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020348866,0.00010788953,0.00014158113,0.000030943098,0.0003702965,0.0000877009,0.00040358552,0.00006146332,0.00003288576],"category_scores_gemma":[0.000010346516,0.00008449946,0.00010863017,0.0002162227,0.000021979147,0.00013533304,0.000054009026,0.00006546631,0.00011336056],"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.00002222026,0.00006590884,0.00059834146,0.000010215446,0.00003102003,0.000014452978,0.00043871344,0.030554483,0.00005560967,0.33306745,0.6224683,0.0126732895],"study_design_scores_gemma":[0.0006503277,0.00050251663,0.0022242654,0.000026163672,0.0000027441988,0.0001424968,0.000014351261,0.6086275,0.0007837945,0.0029518455,0.38368845,0.00038556661],"about_ca_topic_score_codex":0.000018966884,"about_ca_topic_score_gemma":0.000015397489,"teacher_disagreement_score":0.9520555,"about_ca_system_score_codex":0.000026711596,"about_ca_system_score_gemma":0.000027344862,"threshold_uncertainty_score":0.3445788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131503865,0.0001116687,0.86847323,0.0023779306,0.0016539454,0.000163639,0.0000010127916,0.0004743837,0.11359381],"genre_scores_gemma":[0.9822681,7.6150826e-7,0.004510525,0.0016615074,0.0002116692,0.0000123080845,0.0000010662995,0.000008725777,0.01132532],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989229,0.00005670643,0.00022330749,0.00032015643,0.00020660536,0.00027033532],"domain_scores_gemma":[0.9992073,0.00008183479,0.000051920462,0.00048704675,0.0000811973,0.00009066106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001448125,0.000121682206,0.00013953724,0.000063993015,0.00011104625,0.00027499578,0.00047834576,0.00006876541,0.0014040811],"category_scores_gemma":[0.000017609924,0.000097099204,0.00008851364,0.0002601912,0.000013025078,0.00026201276,0.000059435308,0.00009106564,0.0007552906],"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.000018466686,0.00086785166,0.005220362,0.00006928271,0.000094895484,0.00009872893,0.0026702145,0.0045935437,0.005970566,0.14140941,0.7716938,0.067292854],"study_design_scores_gemma":[0.0003601325,0.000120818426,0.00027695176,0.000028655504,0.0000022220984,0.000022716187,0.000016986407,0.94497025,0.0012884603,0.00020250602,0.05249281,0.00021749822],"about_ca_topic_score_codex":0.00008370636,"about_ca_topic_score_gemma":0.000069270594,"teacher_disagreement_score":0.9691177,"about_ca_system_score_codex":0.000047050096,"about_ca_system_score_gemma":0.00000880258,"threshold_uncertainty_score":0.9995088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022640483,0.00008766895,0.97658294,0.000120911194,0.0003252487,0.00011711781,0.000002112785,0.000067753186,0.00005576445],"genre_scores_gemma":[0.9615778,0.00009025811,0.038123164,0.00010347698,0.000074112395,0.0000042221245,0.000007834964,0.0000078675175,0.000011281634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998827,0.000081289305,0.0003757308,0.0004019403,0.00014846661,0.0001655888],"domain_scores_gemma":[0.9987324,0.00016149825,0.00006277305,0.00091968273,0.000078507524,0.000045162455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033672218,0.00011921872,0.00017570585,0.00017712874,0.00009670149,0.00007538584,0.0005816004,0.000090280984,0.0000022124068],"category_scores_gemma":[0.000002341831,0.000116359246,0.000036881484,0.0003097732,0.000011413927,0.00093842286,0.000040040188,0.00016111507,0.0000010840479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001556407,0.00004398131,0.000023136337,0.000003702336,0.00000975181,0.0000017131997,0.00021696037,0.8806864,5.6712275e-7,0.000763538,0.000004497411,0.1182302],"study_design_scores_gemma":[0.00034928223,0.0000643489,0.00001752692,0.000066485685,0.000005226501,0.000011944642,0.000011769643,0.99399006,9.921054e-7,0.005333126,0.00003453599,0.000114691225],"about_ca_topic_score_codex":0.00011199419,"about_ca_topic_score_gemma":0.00007214472,"teacher_disagreement_score":0.9389373,"about_ca_system_score_codex":0.000018817902,"about_ca_system_score_gemma":0.0000135934115,"threshold_uncertainty_score":0.47449926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013026347,0.000043204534,0.9930289,0.000024849092,0.00058426044,0.00022462581,1.5488288e-7,0.0001674818,0.004623918],"genre_scores_gemma":[0.91065633,6.939162e-7,0.08873983,0.0000617024,0.000072567746,0.000020878964,1.9058152e-7,0.000003775286,0.00044401284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943846,0.000043206885,0.00016036764,0.000184863,0.000042704047,0.00013039424],"domain_scores_gemma":[0.99961543,0.0000847489,0.00003408716,0.00015171751,0.00008105244,0.00003294408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032183962,0.000058058973,0.00009609759,0.000046430418,0.00009809829,0.000046287965,0.00012915565,0.000053109077,0.0000058671512],"category_scores_gemma":[0.0000073514084,0.000047173675,0.000024265317,0.000054378634,0.000006698688,0.00020160606,0.000034396977,0.000024243185,0.0000072867583],"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.00001671518,0.000008099189,0.000029673714,0.000027005988,0.000009868658,7.389155e-7,0.00092190667,0.38368562,0.00003333808,0.6115923,0.0001271712,0.0035475679],"study_design_scores_gemma":[0.00013281383,0.000087002874,0.0000035105486,0.000011628754,0.000002235611,0.000011307801,0.00014015785,0.9966588,0.000261853,0.002485703,0.00014202928,0.00006296384],"about_ca_topic_score_codex":0.000076035416,"about_ca_topic_score_gemma":0.0000053416156,"teacher_disagreement_score":0.90935373,"about_ca_system_score_codex":0.00001783308,"about_ca_system_score_gemma":0.000010203473,"threshold_uncertainty_score":0.19236866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037316957,0.00015090124,0.99387753,0.00029474995,0.0008156533,0.00043607937,8.583427e-7,0.00029113365,0.0004014024],"genre_scores_gemma":[0.9769905,0.000005087689,0.021167805,0.00087136094,0.00027794368,0.00009110594,0.0000065749077,0.00001612177,0.0005734815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854857,0.000026289605,0.00028572234,0.00047834107,0.00013577445,0.0005253003],"domain_scores_gemma":[0.9990655,0.000050268372,0.00007034003,0.0005349292,0.00013708038,0.0001418709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027337734,0.0001766816,0.00023664447,0.000053420903,0.00019706598,0.00022011503,0.0006760061,0.000128728,0.000027771353],"category_scores_gemma":[0.0000042821566,0.00014477878,0.0001617346,0.0002156456,0.000027526392,0.000423723,0.000055564673,0.00016225656,0.000021483069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029934668,0.00026455603,0.00012218014,0.000013863598,0.00019337927,0.000010559343,0.00040722537,0.77106047,0.00020694158,0.21098538,0.0020482296,0.014657262],"study_design_scores_gemma":[0.0008339711,0.00047498944,0.000045166864,0.000013367394,0.000017956074,0.000051033032,0.000053749478,0.9951264,0.00029347872,0.0013767426,0.0014912464,0.00022189414],"about_ca_topic_score_codex":0.00011530913,"about_ca_topic_score_gemma":0.00062606926,"teacher_disagreement_score":0.9732588,"about_ca_system_score_codex":0.0001335701,"about_ca_system_score_gemma":0.00007747597,"threshold_uncertainty_score":0.59039074},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06124002,0.0003701847,0.8891243,0.0044370038,0.005521492,0.0006118834,0.000021947188,0.00048856554,0.0381846],"genre_scores_gemma":[0.99442315,0.000035749188,0.0046952125,0.0002409256,0.00015840675,0.000023792958,0.0000034201726,0.000015183073,0.00040414778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984662,0.000060092312,0.00038366552,0.00040672687,0.000360926,0.00032238112],"domain_scores_gemma":[0.998935,0.000038339767,0.00015374529,0.00065992045,0.000096596654,0.000116390445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026237077,0.00017956855,0.00024769263,0.00016948409,0.0001014356,0.000091643495,0.00063798117,0.00008420121,0.00001162452],"category_scores_gemma":[0.000008125356,0.00014712653,0.00017891268,0.00048830826,0.00005798268,0.000318011,0.00010580884,0.00013195907,0.000087851375],"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.000035508874,0.0002556606,0.0003285287,0.00005669099,0.00013368843,0.00005529217,0.001434176,0.034130752,0.018225987,0.9359263,0.0016343106,0.0077830865],"study_design_scores_gemma":[0.011965513,0.00923718,0.011779156,0.0022838262,0.00012484805,0.0005357188,0.0006476586,0.37350604,0.3268313,0.19421592,0.064309314,0.0045635286],"about_ca_topic_score_codex":0.00012952136,"about_ca_topic_score_gemma":0.000016830823,"teacher_disagreement_score":0.93318313,"about_ca_system_score_codex":0.000047394864,"about_ca_system_score_gemma":0.000043521588,"threshold_uncertainty_score":0.59996456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056846034,0.0013082292,0.93219936,0.00026908182,0.0068936916,0.00010154784,4.306711e-7,0.00003169342,0.0023499066],"genre_scores_gemma":[0.99557334,0.000047235448,0.001176854,0.00014006645,0.0027504163,0.0000026489608,3.41888e-7,0.000015069912,0.00029404825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772173,0.00021620098,0.000965985,0.0002499327,0.00044433543,0.0004018372],"domain_scores_gemma":[0.9985055,0.0001745271,0.000744479,0.0003135136,0.00016119686,0.00010083388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017843834,0.0001920229,0.0003967212,0.00031992505,0.00014167036,0.00022042941,0.00054353505,0.00016373281,0.0000022442732],"category_scores_gemma":[0.000030015402,0.00014567061,0.00016030202,0.000573044,0.000033570082,0.00035505425,0.000048856215,0.0006773981,0.0000018549698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023860097,0.000115217255,0.00040035695,0.00006582647,0.00007243725,0.00037955723,0.0051803133,0.8945826,0.0024946318,0.0659256,0.0027614231,0.027783405],"study_design_scores_gemma":[0.008439311,0.005096654,0.0091286795,0.014548695,0.00005132665,0.052028794,0.005049032,0.599008,0.008276741,0.014953164,0.28049108,0.0029285015],"about_ca_topic_score_codex":0.00014085839,"about_ca_topic_score_gemma":0.00007600105,"teacher_disagreement_score":0.93872726,"about_ca_system_score_codex":0.00019786823,"about_ca_system_score_gemma":0.000043935222,"threshold_uncertainty_score":0.5940275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58798563,0.00006763157,0.40056908,0.00011623858,0.00072664936,0.00011174028,2.5039424e-7,0.00015490998,0.01026784],"genre_scores_gemma":[0.95718616,0.0000070936653,0.039759025,0.00018656504,0.00008345698,0.000010701157,6.439189e-7,0.0000074246213,0.0027589207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875677,0.000066122746,0.00032175842,0.00033070982,0.00018661478,0.00033802222],"domain_scores_gemma":[0.999461,0.000055164168,0.000058757345,0.00029313122,0.00005567759,0.000076270844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000300293,0.000119077784,0.00017815082,0.00011678516,0.00019605696,0.0001315467,0.00044290462,0.00006640671,0.00006761398],"category_scores_gemma":[0.000017256922,0.000104932544,0.00008068928,0.0005618352,0.000041976982,0.00044126823,0.00012846102,0.00015964714,0.00009429492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120029596,0.00067125855,0.04037233,0.00005488114,0.00010032274,0.0015491414,0.019327186,0.58003336,0.0011631303,0.24284676,0.07215837,0.04160324],"study_design_scores_gemma":[0.0004563266,0.000093544004,0.0010961822,0.000018421768,6.9841695e-7,0.00032147672,0.00010472228,0.9943145,0.00020951366,0.000052008032,0.0031611347,0.00017145544],"about_ca_topic_score_codex":0.00028075412,"about_ca_topic_score_gemma":0.00003641857,"teacher_disagreement_score":0.41428116,"about_ca_system_score_codex":0.000030681276,"about_ca_system_score_gemma":0.000050729082,"threshold_uncertainty_score":0.4279025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14164086,0.00007560888,0.736892,0.0018990334,0.0006628596,0.00012671463,1.2320264e-7,0.00035583985,0.118347004],"genre_scores_gemma":[0.9945913,0.0000011201925,0.0035124512,0.0006786575,0.0000842555,0.0000018830177,2.6231112e-7,0.0000017010614,0.001128359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.00004324041,0.00019108037,0.00018608531,0.00008789429,0.0001793235],"domain_scores_gemma":[0.9996579,0.00005176783,0.000033176944,0.0001869983,0.000035907986,0.00003423871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019144305,0.00006417456,0.00010006764,0.00008648734,0.000038738217,0.00010719594,0.00026897498,0.0000353883,0.000035009005],"category_scores_gemma":[0.000026470869,0.00005311398,0.00002887331,0.0003329574,0.000004654913,0.0002325635,0.000025323046,0.00006986854,0.000039319126],"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.000011305423,0.00012160349,0.0029629231,0.000004350741,0.000008154899,0.000081836195,0.0016911513,0.0037742683,0.0034209464,0.70517516,0.009556651,0.27319166],"study_design_scores_gemma":[0.000570767,0.000231941,0.029117532,0.000060494815,7.916491e-7,0.000080231686,0.0001389857,0.95805156,0.0006952379,0.0042910883,0.006507584,0.0002537646],"about_ca_topic_score_codex":0.0000694827,"about_ca_topic_score_gemma":0.00021214306,"teacher_disagreement_score":0.95427734,"about_ca_system_score_codex":0.000021545862,"about_ca_system_score_gemma":0.000012683714,"threshold_uncertainty_score":0.21659254},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002578926,0.000093924835,0.9935165,0.00027974264,0.0015886311,0.0014492979,0.00023784385,0.00011792846,0.00013721976],"genre_scores_gemma":[0.9966445,0.000005569292,0.0017568972,0.000080207705,0.00010181971,0.0011165753,0.000011548092,0.000013756077,0.00026910097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818826,0.00011280684,0.0005809857,0.00047954498,0.00019894356,0.00043944136],"domain_scores_gemma":[0.99892527,0.00027367575,0.00014736582,0.0003066595,0.00019395197,0.00015308693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034737115,0.000249347,0.00040867663,0.00011818646,0.00025550256,0.00031557024,0.00026613762,0.00016312087,0.000010480226],"category_scores_gemma":[0.0000067709757,0.00021512533,0.00013385854,0.00025911862,0.00003086814,0.00039025288,0.000002470636,0.00021361522,0.000028410828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008835743,0.00024239483,0.0000541681,0.0000492689,0.00010059636,0.000003277529,0.00043956804,0.9887361,0.00058622664,0.0046121855,0.00086707564,0.0042207614],"study_design_scores_gemma":[0.0023808132,0.00023472,0.00028277838,0.000117783165,0.000012963978,0.00004717791,0.00047121884,0.99576724,0.000026142749,0.00007394095,0.00032752697,0.0002576821],"about_ca_topic_score_codex":0.0016107922,"about_ca_topic_score_gemma":0.00026090108,"teacher_disagreement_score":0.9940656,"about_ca_system_score_codex":0.00012877544,"about_ca_system_score_gemma":0.000044279815,"threshold_uncertainty_score":0.8772556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8453414,0.00007102437,0.15059878,0.00022572228,0.00016739835,0.00014191693,0.0000013752311,0.00006880839,0.0033835901],"genre_scores_gemma":[0.9954773,0.000021137223,0.0036315718,0.000049932034,0.000048102458,0.000008038748,0.0000011381339,0.000005231527,0.0007575037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999103,0.00003855555,0.0003232532,0.0001758189,0.00020246238,0.0001569254],"domain_scores_gemma":[0.99930704,0.000055954268,0.00014296013,0.0002759575,0.00018251022,0.00003559604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017530263,0.00008553213,0.00019216936,0.000107195956,0.000080677506,0.000020668262,0.00020376376,0.000047382848,0.00007858811],"category_scores_gemma":[0.00000444918,0.00006593789,0.000048446003,0.00040652943,0.000045912213,0.00023020557,0.000027065224,0.0000782848,0.000007702249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002707163,0.0015074464,0.004748989,0.0005790927,0.0003228037,0.00001652297,0.0071811504,0.80082005,0.02052809,0.13011752,0.0063162465,0.027591351],"study_design_scores_gemma":[0.00063852477,0.00039837748,0.0015880336,0.00017346277,0.0000060572243,0.00004677205,0.00007899507,0.99559927,0.0011868106,0.000017629009,0.00016969081,0.00009635989],"about_ca_topic_score_codex":0.000035103487,"about_ca_topic_score_gemma":0.0000810133,"teacher_disagreement_score":0.19477922,"about_ca_system_score_codex":0.000024407027,"about_ca_system_score_gemma":0.00001946361,"threshold_uncertainty_score":0.26888692},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009329491,0.000061384126,0.9875945,0.0002820192,0.0012631294,0.0002833771,0.0000016042322,0.0001653545,0.0010191553],"genre_scores_gemma":[0.96998316,0.0000052085875,0.028678851,0.000391555,0.00041654546,0.000045370052,0.0000012424309,0.000007865348,0.00047021854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901426,0.000042376883,0.00022356273,0.0002886393,0.00017169878,0.0002594818],"domain_scores_gemma":[0.999105,0.00019605439,0.000045690595,0.00048761343,0.00009973423,0.000065947956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004583381,0.000101137535,0.00011481468,0.000026596019,0.00050008635,0.0001146728,0.0005355053,0.00003716847,0.000012219522],"category_scores_gemma":[0.000014172492,0.000058611244,0.00009353933,0.00014895348,0.000030345398,0.00013372491,0.000069319554,0.00007461829,0.000019105268],"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.000004994837,0.00034773993,0.00064639206,0.0000058370933,0.000055903914,0.00003208349,0.0061285235,0.066496365,0.0003890007,0.13175064,0.0077940975,0.7863484],"study_design_scores_gemma":[0.00010915714,0.0000953117,0.0007805632,0.00000604778,0.0000023108316,0.00012595324,0.00019200407,0.99592596,0.00016488574,0.000040107305,0.002454156,0.000103527185],"about_ca_topic_score_codex":0.000106401094,"about_ca_topic_score_gemma":0.000019124021,"teacher_disagreement_score":0.96065366,"about_ca_system_score_codex":0.000028860562,"about_ca_system_score_gemma":0.00002660857,"threshold_uncertainty_score":0.38463104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22822407,0.0005187492,0.76476395,0.0032097297,0.00033795444,0.00016198936,6.688331e-7,0.00012529409,0.0026576172],"genre_scores_gemma":[0.9931219,0.000005128846,0.004870227,0.0017915557,0.00010838444,0.000014668974,7.791157e-7,0.000011514456,0.000075808995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854183,0.00013443633,0.00030512357,0.0004154856,0.0002468222,0.0003562993],"domain_scores_gemma":[0.9995278,0.00006553158,0.000099014906,0.00020265303,0.000019587193,0.00008537982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005153001,0.00016693382,0.00022590162,0.000090827176,0.00013568443,0.00027730665,0.00029969608,0.00007507953,0.000002880208],"category_scores_gemma":[0.000030278177,0.0001517823,0.000037134585,0.00027743232,0.000050741888,0.00047825483,0.000041708197,0.00020936965,0.000011355453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007279876,0.00034129195,0.20788515,0.0005554592,0.00015519874,0.00059078,0.050553698,0.014274065,0.0053351396,0.037337814,0.02474389,0.6581547],"study_design_scores_gemma":[0.016134312,0.0012301968,0.3051215,0.0032382563,0.00010606581,0.0012829604,0.0026919013,0.51851404,0.001598447,0.008036136,0.13485216,0.007194047],"about_ca_topic_score_codex":0.000029662575,"about_ca_topic_score_gemma":0.000015251169,"teacher_disagreement_score":0.7648979,"about_ca_system_score_codex":0.00007005351,"about_ca_system_score_gemma":0.00005995169,"threshold_uncertainty_score":0.61895025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6273411,0.0000052228124,0.36480474,0.000032030646,0.00041329718,0.0000665653,2.111021e-7,0.000051792988,0.007285013],"genre_scores_gemma":[0.9976829,0.000005959093,0.0011522328,0.000038342543,0.000024051176,0.0000033244064,6.5598107e-7,0.0000017403628,0.0010907882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966514,0.000025200417,0.000115188705,0.00009645484,0.00004559557,0.00005241681],"domain_scores_gemma":[0.99979407,0.0000072247794,0.000047951606,0.0000926407,0.000039553317,0.000018534216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001002203,0.000034076882,0.000060292907,0.000048075406,0.000031998323,0.000018117948,0.000073058196,0.000026421529,0.000039742423],"category_scores_gemma":[0.0000020364378,0.000028362265,0.000013107157,0.00012781277,0.000009232793,0.00018173624,0.000018638839,0.000018775312,0.000004089302],"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.00010639647,0.0005336472,0.009085607,0.0001578795,0.00013425399,0.000008646195,0.03862394,0.00011960225,0.12551507,0.5583461,0.0048936508,0.2624752],"study_design_scores_gemma":[0.0005830891,0.0005861799,0.08797892,0.00004973843,0.00000737249,0.00008877284,0.00015330933,0.864631,0.041228935,0.00050515553,0.0039015026,0.00028603597],"about_ca_topic_score_codex":0.000031142423,"about_ca_topic_score_gemma":0.000015140791,"teacher_disagreement_score":0.8645114,"about_ca_system_score_codex":0.0000050084805,"about_ca_system_score_gemma":0.000006694611,"threshold_uncertainty_score":0.11565796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008811161,0.000005305701,0.9546046,0.0005446961,0.000534911,0.037176315,0.000006392295,0.000087808876,0.006158832],"genre_scores_gemma":[0.9833998,2.367182e-7,0.0060881916,0.00038764533,0.00014759545,0.009782989,0.000014604978,0.0000056472077,0.00017325385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983377,0.00019509956,0.00040874843,0.0004054634,0.00046734101,0.0001856548],"domain_scores_gemma":[0.99811786,0.00012546241,0.00016339743,0.0009764244,0.0005706767,0.000046154248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033410976,0.000108600885,0.00017973996,0.00008743164,0.00005683067,0.00008968946,0.0011626126,0.000051667266,0.000058739173],"category_scores_gemma":[0.00024809435,0.00008733205,0.00006491411,0.00016022823,0.000015491252,0.0006602928,0.00013679067,0.000050195267,0.000008166421],"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.000084840765,0.0002472675,0.00003709236,0.000026764777,0.00007553517,5.891709e-7,0.0005361961,0.0012386264,0.0017357862,0.27563748,0.03398955,0.6863903],"study_design_scores_gemma":[0.0014293126,0.00072932936,0.00005568856,0.00005130864,0.000014691894,0.0000074538543,0.00008189075,0.98203367,0.0020996958,0.0030320573,0.010345072,0.0001198362],"about_ca_topic_score_codex":0.000025969648,"about_ca_topic_score_gemma":0.000042633827,"teacher_disagreement_score":0.98251873,"about_ca_system_score_codex":0.000053219763,"about_ca_system_score_gemma":0.000100508216,"threshold_uncertainty_score":0.3561298},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045639448,0.0005195581,0.9226629,0.00008368576,0.0023472272,0.00013066511,7.5439985e-8,0.00013324482,0.028483208],"genre_scores_gemma":[0.9924629,0.000016515643,0.0060319332,0.00038410517,0.00030876088,0.000017432072,4.4569188e-7,0.000009415694,0.00076853146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987658,0.0001570712,0.00028042943,0.00029982527,0.0001244727,0.00037240013],"domain_scores_gemma":[0.9994695,0.000065829925,0.00007023193,0.00029387945,0.0000356343,0.00006493471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711178,0.00011419356,0.00016487078,0.00007432668,0.00008520553,0.00014479278,0.00031465237,0.00009394444,0.000034796096],"category_scores_gemma":[0.000030925232,0.0001083427,0.000056099987,0.00044949117,0.000012438366,0.00021661603,0.00005519056,0.00021939738,0.000020714224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012646735,0.000083562285,0.020992363,0.000012731589,0.000025551228,0.00009429917,0.0007656077,0.49602306,0.00010645658,0.4263688,0.012222806,0.043292116],"study_design_scores_gemma":[0.0004717076,0.000025844136,0.0010384425,0.000044356628,0.0000010552893,0.000055557688,0.00001589809,0.96294206,0.000038474638,0.000851901,0.034337237,0.00017748044],"about_ca_topic_score_codex":0.000057055553,"about_ca_topic_score_gemma":0.00006886986,"teacher_disagreement_score":0.9468234,"about_ca_system_score_codex":0.000048030244,"about_ca_system_score_gemma":0.000018420804,"threshold_uncertainty_score":0.4418087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6173699,0.00019360412,0.36209753,0.00096010295,0.00059020723,0.00024296445,0.0000015597445,0.00027815404,0.01826599],"genre_scores_gemma":[0.9894648,0.000008565975,0.009511112,0.00011657699,0.000024026378,0.000005728714,7.500575e-7,0.000004470712,0.0008639738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992846,0.000042942986,0.00018928004,0.00019280793,0.00016501657,0.00012531209],"domain_scores_gemma":[0.99946433,0.000047783535,0.000085046515,0.00025502467,0.00010426888,0.00004356633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012045393,0.00008476294,0.0001439264,0.00009970629,0.000067139146,0.000048304708,0.0002641228,0.00003279281,0.0001254872],"category_scores_gemma":[0.000003971854,0.000060126735,0.000040063238,0.0002912688,0.00004717772,0.00028210966,0.000045444653,0.00005507151,0.000026649954],"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.000053264448,0.00031798525,0.006142676,0.00009635739,0.00015525588,0.00004454808,0.009494503,0.005422512,0.00912644,0.912019,0.037825923,0.019301511],"study_design_scores_gemma":[0.0005334969,0.00097616756,0.0028185411,0.00010999917,0.0000066791335,0.00005719379,0.00033630186,0.9854454,0.0005456785,0.0017563641,0.0071720737,0.00024214789],"about_ca_topic_score_codex":0.00016999857,"about_ca_topic_score_gemma":0.00013608696,"teacher_disagreement_score":0.98002285,"about_ca_system_score_codex":0.00001391977,"about_ca_system_score_gemma":0.0000043100067,"threshold_uncertainty_score":0.24518971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06900575,0.000032769884,0.9250343,0.00011484615,0.00056567544,0.00014147194,0.0000010582846,0.00008230829,0.0050218566],"genre_scores_gemma":[0.9882235,0.0000057531906,0.011475558,0.00023176036,0.000034793036,0.000007819129,8.0595555e-7,0.000004328611,0.000015692744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761283,0.00025889723,0.00039979615,0.00063894613,0.0007122032,0.00037729426],"domain_scores_gemma":[0.99805355,0.00037749333,0.00014016086,0.0007636675,0.00051370077,0.00015145459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022497603,0.0001601098,0.00037251296,0.00059136655,0.00027237713,0.00022304295,0.0012428793,0.00005717772,0.00003881265],"category_scores_gemma":[0.00022392988,0.000119728815,0.00015896732,0.0056114504,0.0010359617,0.0003584603,0.00013569211,0.00012122969,0.0000135379705],"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.000014188068,0.000065922504,0.00016288749,0.000010684841,0.00003980269,0.0000023444666,0.00028150517,0.0052429335,0.00015335431,0.9911182,0.000042115375,0.0028660654],"study_design_scores_gemma":[0.0005107831,0.00036684453,0.0005659977,0.000060467697,0.00006456103,0.000015836285,0.000014232483,0.90913135,0.010830447,0.07779676,0.00038046547,0.00026227286],"about_ca_topic_score_codex":0.0000033484666,"about_ca_topic_score_gemma":0.0000019875322,"teacher_disagreement_score":0.91921777,"about_ca_system_score_codex":0.000036362497,"about_ca_system_score_gemma":0.0001040396,"threshold_uncertainty_score":0.48823994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10154449,0.000049122064,0.6482722,0.0067668753,0.0022052317,0.0003459295,0.000030964296,0.00012260908,0.24066256],"genre_scores_gemma":[0.99229646,0.000063261905,0.005620647,0.00012502696,0.00009427055,0.000037632108,0.000008268678,0.000006621241,0.0017477863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988361,0.00009764178,0.00040468603,0.0001895108,0.00032603994,0.0001460479],"domain_scores_gemma":[0.9976996,0.0001196861,0.00023646808,0.0014360627,0.0004836936,0.000024482079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021489381,0.00011307853,0.00012475086,0.00008410164,0.00022237588,0.000104103005,0.003090093,0.00005338717,0.000029530085],"category_scores_gemma":[0.000011207616,0.000087953675,0.000088190616,0.00021817895,0.000102919636,0.0002444723,0.00024033524,0.00022277387,0.000044078384],"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.0000109620505,0.00024107516,0.0027776554,0.0000077006125,0.00003095732,3.2246882e-7,0.0002478782,0.13160175,0.0026123824,0.85747886,0.001970938,0.0030195215],"study_design_scores_gemma":[0.00017449318,0.000019877378,0.0016435202,0.000105134015,0.0000027094552,0.0000064178826,0.000024012365,0.992187,0.001264215,0.001651761,0.0028229582,0.00009789589],"about_ca_topic_score_codex":0.0003049964,"about_ca_topic_score_gemma":0.00015443859,"teacher_disagreement_score":0.890752,"about_ca_system_score_codex":0.00006200306,"about_ca_system_score_gemma":0.00006631216,"threshold_uncertainty_score":0.57422125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026711964,0.000058461614,0.9725352,0.00039947437,0.0010012354,0.0004630837,2.1308719e-7,0.00018833979,0.025086854],"genre_scores_gemma":[0.9739148,0.000004114695,0.02255572,0.0001782426,0.000255408,0.00018260101,5.2723055e-7,0.000006623203,0.0029019737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992143,0.00003206721,0.0002281402,0.0002446662,0.000080266684,0.00020057087],"domain_scores_gemma":[0.9994764,0.00006627341,0.00006518932,0.0002705979,0.00007895801,0.000042629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036438767,0.000079575904,0.000097384516,0.000056798595,0.00015179825,0.00014736626,0.00024514337,0.00006448742,0.00006349385],"category_scores_gemma":[0.000014074983,0.000066345325,0.00006579697,0.000161389,0.000008499675,0.000080024474,0.000030465795,0.00006656809,0.000021769423],"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.000008651467,0.00012522169,0.000020914698,0.00002894344,0.000028873306,0.0000048960856,0.000581953,0.3864951,0.0048476676,0.50592035,0.046166442,0.055770956],"study_design_scores_gemma":[0.00010260458,0.000059751426,0.0000079525735,0.000023516515,0.0000010672753,0.000028585855,0.000011367489,0.9889431,0.00205193,0.00020689215,0.0084655285,0.00009769513],"about_ca_topic_score_codex":0.000008440168,"about_ca_topic_score_gemma":0.0000069479647,"teacher_disagreement_score":0.97364765,"about_ca_system_score_codex":0.000039888673,"about_ca_system_score_gemma":0.000003894938,"threshold_uncertainty_score":0.27054837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026621257,0.00006845877,0.9639025,0.0004973453,0.0025039017,0.00023085045,3.4045658e-7,0.00031110397,0.029823404],"genre_scores_gemma":[0.99438,0.000016903985,0.0012594248,0.00051794585,0.00046620378,0.000081956154,8.4461055e-7,0.000008987385,0.0032677099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905694,0.00004038169,0.00023999816,0.00030766008,0.00009339325,0.00026160738],"domain_scores_gemma":[0.9993372,0.00011178952,0.00007283645,0.00030779972,0.00011522613,0.000055158092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001925695,0.00011794622,0.00014393823,0.000075578086,0.000121067285,0.0009995445,0.0006776231,0.00008149834,0.00011016323],"category_scores_gemma":[0.000006160267,0.00009811859,0.00009437137,0.00024016538,0.000016273776,0.0015560983,0.00010470503,0.00008628491,0.00002616756],"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.0000075004837,0.0000629193,0.00010625202,0.000022425074,0.000037646372,0.0000026280452,0.0004414386,0.01669257,0.000053485415,0.80043995,0.12027162,0.06186153],"study_design_scores_gemma":[0.00019998148,0.00008497676,0.000024293464,0.000017759723,0.0000021021988,0.000019690775,0.00015489278,0.9851791,0.00006708407,0.0029738273,0.011133519,0.00014277213],"about_ca_topic_score_codex":0.00004745855,"about_ca_topic_score_gemma":0.00013841357,"teacher_disagreement_score":0.9917179,"about_ca_system_score_codex":0.000031127696,"about_ca_system_score_gemma":0.0000074851187,"threshold_uncertainty_score":0.963863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3226905,0.00012946842,0.6668975,0.00017658595,0.0019006683,0.000040060273,7.997223e-8,0.00004165382,0.00812352],"genre_scores_gemma":[0.9539437,0.000008824155,0.04524528,0.00020431155,0.0005072939,6.43034e-7,1.7057753e-8,0.000008210756,0.00008167748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998737,0.00009281113,0.0005346779,0.0001350486,0.00028573076,0.00021474669],"domain_scores_gemma":[0.99882114,0.00019955957,0.0005085729,0.00018280171,0.00019562502,0.00009232679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013171325,0.00010276724,0.00021755662,0.000120964054,0.00012479501,0.00013412324,0.0005162253,0.000056865014,0.000027160697],"category_scores_gemma":[0.00021615218,0.00008045272,0.00013591861,0.00020388696,0.00001135615,0.0005094235,0.00007502544,0.0003409277,0.000018194607],"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.0004526385,0.0008540359,0.016602004,0.0001830582,0.00097103504,0.0016769164,0.04571932,0.06646258,0.03600682,0.7382778,0.0012688331,0.091524996],"study_design_scores_gemma":[0.0042755483,0.0024479928,0.015466961,0.0047453246,0.00008639642,0.0025940002,0.0040444005,0.90195656,0.046371497,0.0147563135,0.0019081198,0.0013468765],"about_ca_topic_score_codex":0.000011549558,"about_ca_topic_score_gemma":0.0000014762927,"teacher_disagreement_score":0.835494,"about_ca_system_score_codex":0.00004851582,"about_ca_system_score_gemma":0.000038177433,"threshold_uncertainty_score":0.3280767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036342032,0.000188353,0.9740579,0.00080286997,0.0032159807,0.0003210164,0.000001035155,0.00030426538,0.017474364],"genre_scores_gemma":[0.97583413,0.000030051528,0.0020522838,0.0015283935,0.00082444976,0.000082729355,0.0000034216864,0.00001719602,0.019627364],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985724,0.000054065957,0.00035067892,0.00042620103,0.0001534623,0.00044317744],"domain_scores_gemma":[0.998949,0.00016256569,0.000091239344,0.0005324029,0.00014284386,0.000121981764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027048017,0.00017562903,0.00022639803,0.00007960446,0.00014675019,0.00025343333,0.0006283416,0.00012810565,0.00033040982],"category_scores_gemma":[0.000025280924,0.0001393152,0.00015787665,0.00027543033,0.000021676604,0.00035387222,0.00014335992,0.00013716937,0.0001512638],"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.000023754506,0.00018445986,0.00079014536,0.00003049264,0.00010622402,0.000008302073,0.00047317237,0.0074183987,0.000042785447,0.0835001,0.8060038,0.101418324],"study_design_scores_gemma":[0.00041586885,0.00014053068,0.00014285842,0.000026093247,0.0000040830278,0.000017023196,0.000019843259,0.95257,0.00009464055,0.00081743597,0.045552533,0.0001990714],"about_ca_topic_score_codex":0.000043869702,"about_ca_topic_score_gemma":0.00012249322,"teacher_disagreement_score":0.9721999,"about_ca_system_score_codex":0.0000923201,"about_ca_system_score_gemma":0.000006156238,"threshold_uncertainty_score":0.5681109},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022130629,0.000013360319,0.97271997,0.0010105509,0.0008930194,0.0001064646,0.0000030214176,0.0002892268,0.002833782],"genre_scores_gemma":[0.9756739,4.6294502e-7,0.023410883,0.00057252997,0.000117695265,0.000008716899,0.0000038496946,0.000005856538,0.00020606503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899113,0.000038358372,0.00025865043,0.0002861833,0.0001672195,0.00025848378],"domain_scores_gemma":[0.99933004,0.000088606364,0.000062186926,0.00034250043,0.00009479966,0.00008185541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021529227,0.00010945267,0.0001351131,0.00005133167,0.00013523498,0.00018887194,0.00034387538,0.000056717854,0.000022430784],"category_scores_gemma":[0.00004719272,0.00008867538,0.000084934334,0.00026863898,0.000013341404,0.00022926826,0.00006411073,0.000099405166,0.000103067614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019922474,0.00022059618,0.00025268405,0.000027676422,0.00003960155,0.000097769334,0.0003224934,0.9373048,0.0012591428,0.046158444,0.003039519,0.01125734],"study_design_scores_gemma":[0.0006963634,0.00008381025,0.00022483319,0.00006926816,0.0000023906084,0.000042384156,0.000033226926,0.9923298,0.0017781473,0.0004597132,0.004094702,0.00018540915],"about_ca_topic_score_codex":0.00015382498,"about_ca_topic_score_gemma":0.000051057777,"teacher_disagreement_score":0.9535433,"about_ca_system_score_codex":0.00007897899,"about_ca_system_score_gemma":0.00005478735,"threshold_uncertainty_score":0.3616077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.359678,0.000015209496,0.63969254,0.000008552721,0.00021326836,0.0001440813,0.0000020933776,0.00004280862,0.0002034083],"genre_scores_gemma":[0.8213667,1.279503e-7,0.17837726,0.00002631375,0.00008197993,0.0000049669434,8.6808535e-7,0.0000058907663,0.00013585608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991245,0.000037295464,0.00032662717,0.00020414212,0.00014842054,0.00015896825],"domain_scores_gemma":[0.9993019,0.00019549951,0.00013275234,0.00021929045,0.00011672878,0.000033826225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013909908,0.0000898827,0.00020843321,0.00008951433,0.00015400593,0.00002879569,0.00021613158,0.000036324087,0.0000036649178],"category_scores_gemma":[0.000012123716,0.000077213685,0.0000719762,0.000115781135,0.000019992,0.00011347175,0.000056860175,0.000054694905,8.5093376e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075983935,0.000025109828,0.0005489644,0.000012431433,0.000008984787,5.144671e-7,0.0011597587,0.9753583,0.0008282739,0.02061979,0.00002079639,0.0014094505],"study_design_scores_gemma":[0.00042891857,0.000043791224,0.00027967675,0.000022642575,0.0000024739588,0.000006966559,0.000022280763,0.99447536,0.002673886,0.0019223627,0.000026160942,0.00009549157],"about_ca_topic_score_codex":0.0004973661,"about_ca_topic_score_gemma":0.00009332994,"teacher_disagreement_score":0.46168873,"about_ca_system_score_codex":0.000027973554,"about_ca_system_score_gemma":0.000019036665,"threshold_uncertainty_score":0.31486827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010575906,0.000009534317,0.96945935,0.000079121535,0.00003973691,0.013941571,7.733103e-7,0.00009846408,0.0057955445],"genre_scores_gemma":[0.98407465,2.0975928e-7,0.0014487498,0.00007261743,0.00003341648,0.013987243,3.4048313e-7,0.0000034655523,0.00037930536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991057,0.0000498674,0.00030580585,0.00026144725,0.0001577199,0.000119486635],"domain_scores_gemma":[0.9993846,0.00003320798,0.00011003201,0.00029779784,0.00010298642,0.000071420545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002905835,0.00007592255,0.00020354877,0.00023496167,0.00006201449,0.000067465895,0.00025552118,0.000023963172,0.00002075909],"category_scores_gemma":[0.000005921963,0.00006047805,0.00005922489,0.00074351195,0.0000026029957,0.00016893874,0.00008264652,0.00003799115,0.000040741365],"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.00006906472,0.00049099105,0.0050686523,0.0012574184,0.0029394913,0.000037448972,0.010351607,0.10076166,0.028504472,0.51562893,0.012798986,0.32209125],"study_design_scores_gemma":[0.00010226057,0.000036132198,0.0002183461,0.000025519183,0.00002506065,0.000014260007,0.000024682016,0.99648726,0.0009514885,0.0000060328803,0.0020351664,0.000073776246],"about_ca_topic_score_codex":0.00007398908,"about_ca_topic_score_gemma":0.000024646935,"teacher_disagreement_score":0.97349876,"about_ca_system_score_codex":0.000030628533,"about_ca_system_score_gemma":0.0000034793854,"threshold_uncertainty_score":0.24662232},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060490016,0.00004413234,0.98025465,0.0048078,0.0024254743,0.00023240698,7.40164e-7,0.00049812597,0.00568766],"genre_scores_gemma":[0.75630426,0.000004110832,0.23514585,0.0053491206,0.0027480244,0.000030344989,0.0000041093886,0.000028805782,0.000385366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744266,0.00041078715,0.00039750861,0.00073270046,0.00042909157,0.000587244],"domain_scores_gemma":[0.99687946,0.0006701979,0.000111685935,0.0020011612,0.00010363164,0.00023387776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054185546,0.00028921227,0.0003437479,0.00021991474,0.00021519144,0.0003613306,0.0028584935,0.00011242789,0.000026676476],"category_scores_gemma":[0.00010649854,0.00023341953,0.00019475279,0.0004063088,0.000054955897,0.00020242242,0.0011743556,0.0004515851,0.0002286505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011293717,0.00005359498,0.00044740242,0.000028750339,0.00004725794,0.000018029717,0.0015601754,0.009606202,0.00031956026,0.051184237,0.030406129,0.90631735],"study_design_scores_gemma":[0.0006773852,0.00056196953,0.0011760894,0.00008407539,0.000006357909,0.00032481496,0.0000065202116,0.36786368,0.0003543902,0.042780634,0.5855785,0.00058560126],"about_ca_topic_score_codex":0.00007516168,"about_ca_topic_score_gemma":0.000082641585,"teacher_disagreement_score":0.9057318,"about_ca_system_score_codex":0.000035874058,"about_ca_system_score_gemma":0.00003766187,"threshold_uncertainty_score":0.9518572},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48356014,0.000020355545,0.5018661,0.0001836108,0.00051687146,0.0001353517,0.0000038317726,0.00007837995,0.013635359],"genre_scores_gemma":[0.9881222,0.0000041123335,0.004324251,0.000053091375,0.00003564886,0.0000068195086,0.000010606643,0.0000037397788,0.0074395076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920946,0.000019728239,0.00030248475,0.00020812353,0.00009866886,0.00016153515],"domain_scores_gemma":[0.99939525,0.0000622041,0.00011666543,0.00029008614,0.000116462405,0.000019350913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023888815,0.00007660323,0.00023277286,0.00021330525,0.00005760646,0.000059241163,0.00029440352,0.00003869211,0.00004281063],"category_scores_gemma":[0.0000033504814,0.00006240329,0.00013268834,0.0005889617,0.000013413514,0.00024546345,0.000014326588,0.000027456543,0.000006012424],"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.00008483113,0.0002876,0.01763027,0.00020297217,0.0020212198,0.0000031411012,0.0007578883,0.36622903,0.010427511,0.5248419,0.022524998,0.054988656],"study_design_scores_gemma":[0.00013661424,0.00006304373,0.007615602,0.000009480595,0.00004324404,0.0000011040643,0.000018955196,0.98936653,0.0019032802,0.00027132916,0.00048210562,0.00008871379],"about_ca_topic_score_codex":0.001173644,"about_ca_topic_score_gemma":0.00061075186,"teacher_disagreement_score":0.62313753,"about_ca_system_score_codex":0.000035452715,"about_ca_system_score_gemma":0.000012880072,"threshold_uncertainty_score":0.25447324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15728728,0.00008831455,0.8419938,0.000020102445,0.0002238611,0.0002256778,4.8154203e-7,0.00012012071,0.000040371106],"genre_scores_gemma":[0.5857266,0.000001327765,0.41403714,0.000022494303,0.00019813812,0.0000014034326,4.365236e-7,0.000004982938,0.0000074626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991392,0.000044740784,0.00023201213,0.00029623872,0.00010273504,0.00018509544],"domain_scores_gemma":[0.9993144,0.00038063087,0.000084626336,0.000118555276,0.00006767318,0.00003409023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036852693,0.00011599572,0.00015941454,0.00009041895,0.00027650187,0.00047470166,0.00012321226,0.00007913546,0.0000010732123],"category_scores_gemma":[0.000022361626,0.00009226212,0.00002789151,0.00009981272,0.000016261809,0.00026464195,0.00009919208,0.000058894395,6.356733e-8],"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.000032456992,0.000026719377,0.003887293,0.000048721493,0.000023841434,0.000007454627,0.0005420859,0.07681163,0.02827917,0.02849541,0.0007808647,0.8610644],"study_design_scores_gemma":[0.00015025547,0.000060819126,0.00033184647,0.00008036138,0.0000036802535,0.00005243459,0.00002817347,0.9881689,0.0055880686,0.005278605,0.0001301386,0.00012673615],"about_ca_topic_score_codex":0.00030088236,"about_ca_topic_score_gemma":0.00017060326,"teacher_disagreement_score":0.9113572,"about_ca_system_score_codex":0.000022263148,"about_ca_system_score_gemma":0.000010176014,"threshold_uncertainty_score":0.4577559},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24724782,0.0003363378,0.75022215,0.0003732275,0.0014985456,0.0001747353,2.6962553e-7,0.000024960997,0.00012197408],"genre_scores_gemma":[0.9743141,0.000014927443,0.024020901,0.0003452744,0.0012707401,0.0000022412937,5.055747e-7,0.000013228734,0.000018107667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982103,0.0004175183,0.00058217824,0.00016250981,0.00031776383,0.0003096961],"domain_scores_gemma":[0.99817693,0.0008123654,0.00037331684,0.00032884468,0.0002549387,0.000053604515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005177432,0.00015381764,0.00023567585,0.000053463136,0.00080797356,0.0002919125,0.00080704456,0.00003288959,0.0000022071376],"category_scores_gemma":[0.00006844453,0.00008171727,0.00019483439,0.00020564157,0.000027963204,0.00031960852,0.00013474113,0.00027781984,0.0000010226449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004910465,0.000076881595,0.00096213334,0.000043345688,0.00023779007,0.0000010450997,0.008116858,0.92493266,0.009807655,0.0058143586,0.0022219047,0.047736235],"study_design_scores_gemma":[0.00052031607,0.0001659945,0.00020106688,0.000104583894,0.000036628648,0.00016279322,0.0013541913,0.9960254,0.00014231403,0.00025800467,0.00092425395,0.00010449746],"about_ca_topic_score_codex":0.000036132707,"about_ca_topic_score_gemma":0.000010636056,"teacher_disagreement_score":0.7270663,"about_ca_system_score_codex":0.000046353183,"about_ca_system_score_gemma":0.000023431301,"threshold_uncertainty_score":0.62143606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005131717,0.0000853472,0.9863577,0.0003063035,0.00076693186,0.00018198429,1.2756004e-7,0.00010668071,0.0070631974],"genre_scores_gemma":[0.96884894,0.0000020559019,0.03009321,0.0005383928,0.00022198963,0.000036871308,5.7255835e-7,0.0000055546648,0.0002523797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923867,0.000018021652,0.00021928262,0.00021934479,0.00006413893,0.00024054015],"domain_scores_gemma":[0.99961203,0.000099298195,0.000038274822,0.0001790115,0.000030642608,0.000040721658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026173802,0.00007428238,0.000110930545,0.000064117674,0.00005908125,0.000095238305,0.00025914446,0.000046756057,0.000004582788],"category_scores_gemma":[0.000024957699,0.00006462843,0.000050029124,0.0002310645,0.000007939459,0.00019030852,0.000046684905,0.00008795978,0.000008654395],"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.000010001588,0.00006246,0.00040398515,0.000019919573,0.000008642413,0.000026182975,0.0005222293,0.31494212,0.00001806808,0.67424107,0.0011488181,0.00859653],"study_design_scores_gemma":[0.00052348647,0.00006951157,0.00030478882,0.00006247725,7.9431254e-7,0.000034415407,0.000039019713,0.98275685,0.00003334056,0.015032586,0.0010256162,0.000117126496],"about_ca_topic_score_codex":0.00006990509,"about_ca_topic_score_gemma":0.000091970454,"teacher_disagreement_score":0.9637173,"about_ca_system_score_codex":0.000044109456,"about_ca_system_score_gemma":0.00002842701,"threshold_uncertainty_score":0.26354712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047082687,0.000081097685,0.989466,0.00066625106,0.0006557841,0.00020157677,8.8924054e-7,0.0002979142,0.003922196],"genre_scores_gemma":[0.44648996,2.8591563e-7,0.5525279,0.00030415694,0.00016649766,0.000034343,8.2560314e-7,0.0000054736242,0.0004705166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904966,0.00008454777,0.00023241485,0.00032303578,0.00008001376,0.00023029618],"domain_scores_gemma":[0.9978137,0.0017265779,0.000075779026,0.00021669404,0.00013401773,0.000033240914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007759499,0.00011376892,0.0001771707,0.00007787195,0.0001280274,0.00021385994,0.00025428936,0.000058229252,0.0000038363883],"category_scores_gemma":[0.00025113134,0.00008793619,0.000050471626,0.00017681674,0.000026373085,0.00020682823,0.00007842096,0.0000563677,0.0000037308635],"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.000032773594,0.000096207754,0.003118471,0.00019281726,0.0000512156,0.000021097503,0.0003565267,0.00944027,0.0095973965,0.53159887,0.024683753,0.42081058],"study_design_scores_gemma":[0.00039497,0.00018946025,0.0006402078,0.000037038008,0.0000036628637,0.000027528053,0.00006195953,0.97133917,0.0058129677,0.017447412,0.0038632962,0.00018230373],"about_ca_topic_score_codex":0.00028580654,"about_ca_topic_score_gemma":0.00009202375,"teacher_disagreement_score":0.9618989,"about_ca_system_score_codex":0.000019022638,"about_ca_system_score_gemma":0.000021913556,"threshold_uncertainty_score":0.35859337},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016941449,0.00017606585,0.97394973,0.00009087448,0.002492449,0.0003612075,4.4643295e-7,0.00038310295,0.020851992],"genre_scores_gemma":[0.9544212,9.886861e-7,0.04211084,0.0002241006,0.0005331947,0.000040807376,0.0000010721823,0.000012596466,0.0026551692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875313,0.000032867803,0.00032506944,0.00032096385,0.00015853284,0.00040940818],"domain_scores_gemma":[0.9992835,0.00007855245,0.000119730284,0.0002878881,0.0001527871,0.00007752009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062036567,0.00013571995,0.00021789326,0.000041693387,0.0003184014,0.0003391181,0.0003383548,0.00008702608,0.000012099296],"category_scores_gemma":[0.000014837414,0.00010602898,0.000086556545,0.00030306555,0.00001141727,0.00040254887,0.000034685992,0.0000714225,0.000032968608],"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.000005535542,0.000012121323,0.00003123116,0.00008732793,0.000014726365,0.0000027259641,0.000187358,0.0051534567,0.00002042221,0.9771696,0.012230974,0.005084556],"study_design_scores_gemma":[0.0008496247,0.00015030999,0.000022757828,0.0002610813,0.000009360183,0.00015254387,0.0004264047,0.93737054,0.0005821377,0.0047919923,0.055000752,0.0003824697],"about_ca_topic_score_codex":0.00002656336,"about_ca_topic_score_gemma":0.000022511327,"teacher_disagreement_score":0.9723776,"about_ca_system_score_codex":0.000085237756,"about_ca_system_score_gemma":0.00006360519,"threshold_uncertainty_score":0.43237364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01379805,0.000034710894,0.9749519,0.0000637741,0.0013805839,0.00015274361,4.864916e-7,0.00027931048,0.009338412],"genre_scores_gemma":[0.94731826,5.9307365e-7,0.04968508,0.000588314,0.0011040415,0.0000048278885,0.0000024137657,0.000013908172,0.0012825665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845296,0.00025472112,0.00030443072,0.0003885302,0.0002255787,0.0003737488],"domain_scores_gemma":[0.99913424,0.000107142136,0.00008314569,0.00053237856,0.000058736216,0.00008435115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822371,0.0001667143,0.00017927002,0.000077998346,0.00023218174,0.00030908766,0.00052470516,0.000079688485,0.000075657816],"category_scores_gemma":[0.000004637702,0.00013425865,0.00006723534,0.00032089977,0.000019470579,0.00038061535,0.00005688967,0.000119958924,0.000072586845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014168686,0.00006688785,0.0002118408,0.0000012156996,0.000009311401,0.000015478252,0.00008085968,0.7787214,0.0005964471,0.20616695,0.010921783,0.0031936425],"study_design_scores_gemma":[0.00021456972,0.0002619644,0.00014772384,0.000016099533,0.0000025136821,0.00004383593,0.000013517728,0.99572915,0.00049957534,0.0020403923,0.0008371351,0.00019354442],"about_ca_topic_score_codex":0.00036237884,"about_ca_topic_score_gemma":0.00007497178,"teacher_disagreement_score":0.9335202,"about_ca_system_score_codex":0.000044305438,"about_ca_system_score_gemma":0.00003075831,"threshold_uncertainty_score":0.54749084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022448808,0.000055058124,0.96232593,0.0010887417,0.001014047,0.00006757694,0.0000018803671,0.00018824216,0.01280971],"genre_scores_gemma":[0.98545784,7.329871e-7,0.011014538,0.0022769046,0.0002511443,0.000006376426,0.000007793416,0.000007004925,0.0009776897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892,0.00008578366,0.00023006123,0.00029529186,0.00028535846,0.00018349205],"domain_scores_gemma":[0.9990299,0.00033725737,0.000083141225,0.00027226662,0.00020314984,0.00007428076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032601273,0.000104926046,0.00014423687,0.00017498396,0.00013834049,0.00016072935,0.00045865835,0.000053520078,0.00014133725],"category_scores_gemma":[0.00005790387,0.000094324125,0.00008055528,0.000583012,0.000024208195,0.00020914098,0.00010271668,0.0000965107,0.00049676426],"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.00000386348,0.000057647852,0.0008261653,0.000014439086,0.000052588053,0.0000064369297,0.00039495318,0.04840941,0.000030260258,0.89040846,0.034925066,0.024870686],"study_design_scores_gemma":[0.00025601703,0.000053970212,0.005085697,0.000012342674,0.0000022185081,0.00008282048,0.000011187125,0.9023747,0.00004523207,0.057295658,0.03462591,0.0001542639],"about_ca_topic_score_codex":0.0000068311806,"about_ca_topic_score_gemma":7.798276e-7,"teacher_disagreement_score":0.963009,"about_ca_system_score_codex":0.000022860562,"about_ca_system_score_gemma":0.000025184014,"threshold_uncertainty_score":0.6385065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3350881,0.000004538087,0.645987,0.000044096832,0.0003898434,0.000061701176,0.0000025102715,0.000042656884,0.018379569],"genre_scores_gemma":[0.99846756,3.6519972e-7,0.0010579848,0.00013141216,0.000017740273,0.000001114745,0.0000073689866,0.0000029890862,0.00031346336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991232,0.00009969274,0.00023070436,0.00028723173,0.00015438894,0.00010477052],"domain_scores_gemma":[0.9989238,0.00013969008,0.00009629413,0.00076522666,0.000043138127,0.00003185394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048447968,0.00006724328,0.0001399554,0.00021997216,0.00007760114,0.00006387556,0.00027982693,0.000030787505,0.00006486152],"category_scores_gemma":[0.00006287418,0.00005352314,0.000055481207,0.0008113343,0.000006230826,0.00017891343,0.00004439458,0.00005234546,0.000015829952],"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.0000029556743,0.00005098511,0.0016304873,0.000003350146,0.00018823247,0.00008210861,0.00047677147,0.066609494,0.000013026028,0.92810524,0.00076077913,0.0020765665],"study_design_scores_gemma":[0.00007714348,0.000050320858,0.00043751526,0.0000112305925,0.000039285995,0.000052938423,0.00019867592,0.9985934,0.00013657693,0.00016902527,0.00016064539,0.00007323423],"about_ca_topic_score_codex":0.0002059014,"about_ca_topic_score_gemma":0.00024075467,"teacher_disagreement_score":0.9319839,"about_ca_system_score_codex":0.000026502885,"about_ca_system_score_gemma":0.000009992592,"threshold_uncertainty_score":0.21826103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027240828,0.00012051,0.96503,0.003125797,0.0012948031,0.00027526767,0.000032822227,0.0002523226,0.002627613],"genre_scores_gemma":[0.9822032,0.00007308672,0.015631419,0.00038140488,0.00094168534,0.00017351522,0.0000655792,0.0000150849055,0.0005150642],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983958,0.0000069257267,0.0004085742,0.00052334636,0.0003233168,0.00034204274],"domain_scores_gemma":[0.9988326,0.000047159596,0.00023989276,0.00008102159,0.0006692804,0.00013008929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002464094,0.00021240841,0.00021049676,0.00011858949,0.00055370264,0.00036478235,0.000456829,0.000111131296,0.000006901702],"category_scores_gemma":[0.00003513037,0.00019706106,0.00009657541,0.00022247488,0.00008634397,0.0011274744,0.00008029259,0.00013877287,0.0000067429496],"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.0017030033,0.0020630015,0.07244319,0.0022034463,0.0013426024,0.00014142368,0.023670074,0.05113991,0.04336031,0.38225916,0.39756703,0.022106852],"study_design_scores_gemma":[0.0011479284,0.00014748843,0.00064518687,0.0001867174,0.000017038683,0.00039574996,0.00010950524,0.9552539,0.0007808993,0.0030331155,0.037825745,0.0004567063],"about_ca_topic_score_codex":0.000012516464,"about_ca_topic_score_gemma":0.0000013073334,"teacher_disagreement_score":0.9549623,"about_ca_system_score_codex":0.00007328265,"about_ca_system_score_gemma":0.00006740392,"threshold_uncertainty_score":0.80359167},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12171724,0.000012929283,0.8773229,0.00014611249,0.00015023135,0.00014362,3.221467e-7,0.00003760117,0.00046904874],"genre_scores_gemma":[0.96910596,0.000001418999,0.030524554,0.00004190109,0.000047690675,0.00000405779,7.913613e-7,0.0000027673398,0.00027083734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938995,0.000048642683,0.00020509807,0.00014846773,0.0001003678,0.000107490676],"domain_scores_gemma":[0.99966705,0.000059628488,0.00006257954,0.00012807222,0.00006200369,0.000020663118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020199898,0.00005592215,0.00009187353,0.00005400189,0.00004007054,0.000060065184,0.0001080092,0.000022159813,0.0000319784],"category_scores_gemma":[0.0000017972858,0.000045263852,0.000018363164,0.00013933181,0.000010335457,0.0001690074,0.000038437112,0.00002302865,0.0000066720345],"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.0000150722035,0.00011287467,0.0045831203,0.000036515277,0.000041763382,0.000009003404,0.0012591905,0.009877251,0.023558756,0.8805812,0.013589216,0.06633605],"study_design_scores_gemma":[0.0013106532,0.00025319343,0.022214895,0.000020607551,0.000008444998,0.000046373836,0.0003608912,0.94302,0.02821625,0.00367716,0.00064300554,0.000228562],"about_ca_topic_score_codex":0.0023968797,"about_ca_topic_score_gemma":0.00012986727,"teacher_disagreement_score":0.9331427,"about_ca_system_score_codex":0.000012628841,"about_ca_system_score_gemma":0.0000109476605,"threshold_uncertainty_score":0.3623381},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005061731,0.00010288133,0.96646416,0.0009773812,0.0006376675,0.00018574414,0.0000012036376,0.00036357774,0.026205674],"genre_scores_gemma":[0.9668041,0.000007051382,0.01804125,0.0007905757,0.00012165601,0.000022523165,0.0000011462463,0.000014019452,0.014197699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863565,0.00005008634,0.0002430336,0.0004276825,0.00031150322,0.00033207083],"domain_scores_gemma":[0.9990079,0.000053157437,0.0000825259,0.00061947334,0.00011823533,0.00011870574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018382874,0.00018949357,0.0002190322,0.00007012651,0.0001504592,0.00026443403,0.00063655997,0.00010176917,0.0003820004],"category_scores_gemma":[0.000006089689,0.00012921548,0.00006888601,0.00031331464,0.00001860526,0.00039873266,0.00012101365,0.00013835057,0.00029416571],"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.000069493,0.0004018751,0.00043685266,0.000057435544,0.0005138498,0.00015551082,0.0050315843,0.0037627358,0.0029183447,0.75780046,0.18034664,0.048505213],"study_design_scores_gemma":[0.0012983324,0.0009362414,0.0002567958,0.00008567723,0.000024745172,0.00029988986,0.00028307448,0.9444832,0.005906333,0.0048534675,0.040776633,0.0007955633],"about_ca_topic_score_codex":0.00011494341,"about_ca_topic_score_gemma":0.00015328036,"teacher_disagreement_score":0.96174234,"about_ca_system_score_codex":0.000027337486,"about_ca_system_score_gemma":0.000011283597,"threshold_uncertainty_score":0.52692544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006424678,0.00016623327,0.973075,0.00024592894,0.0004937257,0.00013395511,5.3085e-7,0.00010864925,0.01935133],"genre_scores_gemma":[0.98106396,0.000003514778,0.013831603,0.00014039806,0.00006046767,0.000008574678,1.5236311e-7,0.0000048547495,0.0048864447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911845,0.00005212189,0.00023518266,0.00021749077,0.00018581687,0.00019091596],"domain_scores_gemma":[0.9993362,0.00008281313,0.00006778631,0.00037659451,0.0000823481,0.000054259242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033010042,0.000083377075,0.0001423948,0.00006552031,0.000059947866,0.00006996425,0.0003926516,0.000044870532,0.0005907882],"category_scores_gemma":[0.000016624736,0.000064544176,0.000055310516,0.00025809603,0.000019710638,0.000086798726,0.00007862489,0.00005267825,0.00025258222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015705196,0.0007009651,0.00051464536,0.00010204415,0.00009258803,0.000024667239,0.0059260195,0.5565823,0.008524675,0.049914114,0.31910798,0.058494296],"study_design_scores_gemma":[0.00013378395,0.0000681137,0.00004842095,0.0000257287,0.0000014158683,0.000014121045,0.000044045013,0.9950389,0.0037815357,0.00014553944,0.00060940575,0.00008897042],"about_ca_topic_score_codex":0.00003045751,"about_ca_topic_score_gemma":0.0000022710794,"teacher_disagreement_score":0.9746393,"about_ca_system_score_codex":0.000020546346,"about_ca_system_score_gemma":0.000008609379,"threshold_uncertainty_score":0.6468716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43877575,0.00007899284,0.48451552,0.00023224192,0.0007725383,0.00011148833,1.3786226e-7,0.00019462281,0.0753187],"genre_scores_gemma":[0.9903273,9.343895e-7,0.0056383037,0.00009116258,0.000103636055,0.0000099322315,5.9756013e-7,0.000004175624,0.0038239842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914443,0.000025278126,0.000243654,0.00022759514,0.00011473799,0.00024427622],"domain_scores_gemma":[0.99965817,0.000027904134,0.0000422884,0.00020723054,0.000035297326,0.000029127888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537309,0.00007664945,0.00010132794,0.00012247221,0.00005686655,0.00016937478,0.00026479055,0.000039427738,0.000035386503],"category_scores_gemma":[0.000002197022,0.00006556644,0.0000444448,0.00045904575,0.000011559213,0.00033202974,0.00007353225,0.00007727493,0.00007384789],"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.000011791119,0.00008567733,0.01526136,0.000009861212,0.0000059621684,0.00003070858,0.00022106193,0.066193305,0.00086817134,0.90179497,0.010508488,0.0050086477],"study_design_scores_gemma":[0.00090409856,0.00005759809,0.0029969702,0.0000445958,0.0000011630406,0.00004358029,0.000049980215,0.9819512,0.002477067,0.0022929015,0.008918815,0.0002620332],"about_ca_topic_score_codex":0.0010808862,"about_ca_topic_score_gemma":0.0004777161,"teacher_disagreement_score":0.9157579,"about_ca_system_score_codex":0.000020112771,"about_ca_system_score_gemma":0.00001224864,"threshold_uncertainty_score":0.2673722},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35304162,0.0036631469,0.6029371,0.006225363,0.0047122897,0.0007956615,0.0000011068015,0.00033408392,0.028289631],"genre_scores_gemma":[0.991877,0.00007289043,0.0016773251,0.00022345598,0.00010530793,0.000012557855,4.2677064e-7,0.0000033841106,0.006027655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994074,0.00008890345,0.00012487273,0.0001435246,0.00011023896,0.00012503451],"domain_scores_gemma":[0.99968314,0.000043985303,0.000036750003,0.00015494756,0.000050849056,0.000030325386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039674438,0.000054403303,0.000051395928,0.000018331588,0.00024195724,0.00019028212,0.0001323106,0.000020632926,0.000042543437],"category_scores_gemma":[0.000011748385,0.000033854598,0.000016619786,0.00008939763,0.000006497439,0.00026536666,0.0000381876,0.000037594087,0.000024526009],"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.0000015975385,0.000008911233,0.00024032436,0.000004788312,0.000011332376,0.0000018429321,0.0010856292,0.000022130249,0.0018202593,0.94117785,0.040869556,0.014755813],"study_design_scores_gemma":[0.00050018355,0.00013974741,0.0009524535,0.00001754564,0.0000026322396,0.00004487023,0.0022190518,0.09688887,0.011378017,0.0024834163,0.8851371,0.00023614458],"about_ca_topic_score_codex":0.00002898937,"about_ca_topic_score_gemma":0.00007397774,"teacher_disagreement_score":0.9386944,"about_ca_system_score_codex":0.000013443179,"about_ca_system_score_gemma":0.00001222757,"threshold_uncertainty_score":0.1860964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009640845,0.00021326685,0.9091782,0.0098726405,0.0015775223,0.00027137305,3.8644995e-7,0.00034408658,0.068901666],"genre_scores_gemma":[0.98349905,0.000051972343,0.01048229,0.0019118851,0.00034035952,0.000035494475,9.968866e-7,0.000007924237,0.0036700498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888605,0.0002478575,0.00022550272,0.00022005518,0.0001710335,0.00024949017],"domain_scores_gemma":[0.998681,0.0002864664,0.00007955019,0.00083998305,0.00007256194,0.0000404265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064652396,0.00010780258,0.00010037024,0.000037218768,0.00042286146,0.0002592061,0.00080365257,0.00005554392,0.00046353345],"category_scores_gemma":[0.000020519376,0.00006814935,0.00007119396,0.00029407407,0.000029501925,0.00028899024,0.00016529154,0.00020929272,0.00044378533],"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.000004652336,0.000069917995,0.000030345318,0.000002033219,0.00003388584,0.0000018671127,0.0012266956,0.021493785,0.000012110625,0.7134364,0.23962693,0.024061348],"study_design_scores_gemma":[0.00009473119,0.00011611257,0.000057272657,0.000028274717,0.0000016078884,0.000018424664,0.0001457023,0.9508213,0.000064918706,0.00087135314,0.04767766,0.0001026404],"about_ca_topic_score_codex":0.000059494203,"about_ca_topic_score_gemma":0.00003586094,"teacher_disagreement_score":0.9738582,"about_ca_system_score_codex":0.000049128186,"about_ca_system_score_gemma":0.0000033975637,"threshold_uncertainty_score":0.570411},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012529031,0.00012051228,0.96671844,0.00060148904,0.00083532056,0.00010430219,1.271407e-7,0.00009687254,0.030270018],"genre_scores_gemma":[0.9952448,0.0000072248845,0.0012112131,0.0011959188,0.00015554676,0.000010307067,7.6613865e-8,0.0000036557863,0.0021712538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923784,0.000057959613,0.00019158961,0.00019598275,0.000092332266,0.00022427422],"domain_scores_gemma":[0.99954796,0.00008548727,0.00002758125,0.0002635539,0.00002601534,0.000049385166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017453806,0.00007245862,0.00011808147,0.00005410359,0.000035956313,0.00010102982,0.0002802172,0.0000527186,0.00025232256],"category_scores_gemma":[0.000010095248,0.000059122627,0.000041535615,0.00020680571,0.000009880848,0.00021698239,0.000035103516,0.00010227584,0.00015920939],"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.00001955139,0.00052919437,0.026275272,0.000014800006,0.00006310096,0.00021663944,0.0014753205,0.30010077,0.00012409706,0.3995919,0.15533556,0.116253816],"study_design_scores_gemma":[0.000496532,0.000024750396,0.000877916,0.000009589789,4.6953858e-7,0.000014539422,0.000008719632,0.9929746,0.0000033283682,0.00005972067,0.005449891,0.000079937505],"about_ca_topic_score_codex":0.00004568186,"about_ca_topic_score_gemma":0.00009624369,"teacher_disagreement_score":0.9939919,"about_ca_system_score_codex":0.000024825817,"about_ca_system_score_gemma":0.0000019918689,"threshold_uncertainty_score":0.27627552},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.508967e-7,0.00014021057,0.5610171,0.00024148432,0.0012889882,0.00061116065,0.0000019456825,0.00015882311,0.43653992],"genre_scores_gemma":[0.006260547,0.000046156303,0.1164286,0.0014942987,0.0019192897,0.00026444468,0.0000062598538,0.00008644832,0.87349397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980894,0.0000064843257,0.0005707007,0.00061042287,0.00027704478,0.00044597362],"domain_scores_gemma":[0.9979755,0.00037100443,0.00041407242,0.0009673845,0.00018688552,0.00008512294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058989675,0.0003906251,0.000416731,0.00013217413,0.00042219518,0.00038762626,0.0014733379,0.00053954375,0.0003961182],"category_scores_gemma":[0.000015844453,0.00024626718,0.0003626473,0.000053218206,0.000050436487,0.0002744611,0.00035422482,0.0005940686,0.00016161651],"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.000003865671,0.0000041133303,9.1310864e-7,0.000058372007,0.00007574366,0.0000038068874,0.0009318045,0.000012232122,0.0000012702282,0.9667092,0.019391371,0.012807287],"study_design_scores_gemma":[0.00007227912,0.00006718886,9.90099e-7,0.0006266274,0.000010038496,0.000035605957,0.000035155765,0.020151813,0.000005769135,0.6129896,0.3657083,0.00029666413],"about_ca_topic_score_codex":0.000027637072,"about_ca_topic_score_gemma":0.00003083344,"teacher_disagreement_score":0.4445885,"about_ca_system_score_codex":0.00008442217,"about_ca_system_score_gemma":0.000074214695,"threshold_uncertainty_score":0.999999},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03846756,0.00009240109,0.8687453,0.00039028327,0.00041053118,0.00031372163,5.329117e-7,0.00024352655,0.09133611],"genre_scores_gemma":[0.9818638,0.0000035104597,0.010019682,0.00060972077,0.000035701825,0.000036821828,4.241818e-7,0.000007813322,0.0074225552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990388,0.000072651776,0.0001657867,0.0003350041,0.00015611573,0.00023162118],"domain_scores_gemma":[0.99937534,0.00005324105,0.00006255985,0.00025745248,0.00015398895,0.00009743884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022494329,0.00011819081,0.0001592913,0.00004914738,0.00013346893,0.00025270917,0.00019598237,0.000050809846,0.00007364032],"category_scores_gemma":[0.000021445801,0.00008380031,0.000021059484,0.00032447808,0.000032505566,0.00028863287,0.000020116016,0.00008088265,0.000023528795],"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.000056617864,0.00019682586,0.0041061332,0.0001035772,0.00015782335,0.0000565821,0.0041280473,0.0002449508,0.0027637274,0.9445728,0.040339135,0.0032737989],"study_design_scores_gemma":[0.008002571,0.003945329,0.0033551264,0.0004500281,0.000065400134,0.0038167909,0.0035964882,0.18434946,0.020169247,0.007459024,0.7617343,0.0030562452],"about_ca_topic_score_codex":0.000039739407,"about_ca_topic_score_gemma":0.00041139816,"teacher_disagreement_score":0.9433962,"about_ca_system_score_codex":0.000015790742,"about_ca_system_score_gemma":0.0000673771,"threshold_uncertainty_score":0.34172776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01439552,0.000005790019,0.8679038,0.0001343487,0.0013635248,0.00009314262,2.612537e-7,0.00021515312,0.115888424],"genre_scores_gemma":[0.98245406,0.0000013233221,0.011085442,0.0005023309,0.00011178516,0.000014724834,3.4210214e-7,0.000004340501,0.0058256686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990928,0.00005796706,0.00021452778,0.00031871488,0.00011914067,0.00019684827],"domain_scores_gemma":[0.9991452,0.000027284425,0.00004466647,0.000605721,0.00011217376,0.00006494092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026097405,0.00008974833,0.000116402975,0.000031265477,0.00007041066,0.00006521949,0.00047947996,0.000058488917,0.00047377468],"category_scores_gemma":[0.000010601957,0.00006696773,0.00007049149,0.00013831351,0.000017012726,0.00036408342,0.0001182011,0.000082910614,0.00037997137],"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.000074288364,0.0006230166,0.007130471,0.00008766141,0.000103426064,0.000044232398,0.023678651,0.00031663902,0.0022430236,0.7837638,0.08887546,0.09305932],"study_design_scores_gemma":[0.0023514896,0.0014006448,0.040219013,0.00020698039,0.00002134475,0.00015664895,0.0009261754,0.64540046,0.14628458,0.05181679,0.10852759,0.0026882894],"about_ca_topic_score_codex":0.00022732171,"about_ca_topic_score_gemma":0.000059641083,"teacher_disagreement_score":0.9680585,"about_ca_system_score_codex":0.000026540118,"about_ca_system_score_gemma":0.000017921757,"threshold_uncertainty_score":0.5187501},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087051734,0.0004964154,0.8957963,0.00022158439,0.00029982824,0.0023358692,0.0000069714833,0.00011921881,0.01367209],"genre_scores_gemma":[0.993197,0.000009838142,0.0048498563,0.000073469644,0.00019397463,0.00034874305,0.0000014753095,0.0000050095327,0.0013206238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990646,0.000057874862,0.0002715246,0.0002959231,0.00012668163,0.00018337523],"domain_scores_gemma":[0.99924,0.00015357486,0.00007481044,0.00033715903,0.0001354229,0.00005906905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018696596,0.00010819076,0.00025158323,0.00005202596,0.0001532383,0.00006626595,0.00027047336,0.00004330711,0.000046754983],"category_scores_gemma":[0.000001965524,0.000088392815,0.000039030976,0.00025808852,0.000022923025,0.00016275045,0.00008684768,0.000054825003,0.0000067874466],"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.00004379667,0.0034117294,0.021251433,0.00021067556,0.00064176775,0.0000060440934,0.05800425,0.0044362503,0.00012443149,0.6015375,0.28552228,0.024809813],"study_design_scores_gemma":[0.0020736065,0.0030267627,0.003290003,0.000053668722,0.000043208227,0.000021380636,0.008812356,0.9151613,0.00019476075,0.0019655474,0.06482318,0.0005341918],"about_ca_topic_score_codex":0.000064844244,"about_ca_topic_score_gemma":0.0012473342,"teacher_disagreement_score":0.91072506,"about_ca_system_score_codex":0.000012862584,"about_ca_system_score_gemma":0.000003967866,"threshold_uncertainty_score":0.36045542},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040774725,0.00015296966,0.9554965,0.00082785543,0.0006679647,0.0006817317,0.000066188244,0.00003976812,0.0012922775],"genre_scores_gemma":[0.99537283,0.000047511356,0.003317927,0.00012621669,0.00035192407,0.00031127164,0.000022197673,0.0000065274444,0.00044359517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998768,0.00006668925,0.0004565605,0.00034671463,0.00022328869,0.00013875304],"domain_scores_gemma":[0.99856335,0.0001805624,0.00029964096,0.0005636012,0.0003586715,0.000034171473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024035265,0.00014898098,0.000262067,0.00018701822,0.00022097383,0.00026218733,0.00074564875,0.00006643365,0.0000021214685],"category_scores_gemma":[0.0000032198793,0.00011051522,0.00008914527,0.0003414533,0.000082690174,0.000119140816,0.00010573335,0.00011298904,0.0000015097527],"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.00003568679,0.0002063244,0.013157201,0.00012369124,0.00051162305,2.974302e-7,0.00031013862,0.046602983,0.0009879124,0.8826716,0.003386561,0.05200596],"study_design_scores_gemma":[0.00032683063,0.00004905967,0.017051574,0.000094808944,0.000038249327,0.000014745883,0.000019787129,0.9641992,0.0001141107,0.0003858773,0.017564505,0.00014125959],"about_ca_topic_score_codex":0.0002379738,"about_ca_topic_score_gemma":0.00010108055,"teacher_disagreement_score":0.9545981,"about_ca_system_score_codex":0.000027942448,"about_ca_system_score_gemma":0.000026909584,"threshold_uncertainty_score":0.450668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04124326,0.00024587134,0.9556183,0.00014799119,0.0017530248,0.00060214853,0.00012146862,0.00013765792,0.00013027967],"genre_scores_gemma":[0.9982496,0.000008574003,0.0010452685,0.000019698022,0.000101802034,0.0003468826,0.000018539726,0.00001103104,0.00019861228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.00010103873,0.00049128954,0.0004486692,0.000189216,0.00034846726],"domain_scores_gemma":[0.99928516,0.00017553115,0.000107898486,0.00025235917,0.00009536703,0.00008367959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003450236,0.0001971124,0.00029324813,0.00020044274,0.00025505864,0.00021218153,0.00017926615,0.00013957839,0.0000017543776],"category_scores_gemma":[0.0000031575696,0.00018090811,0.000113270646,0.0003847946,0.000033605105,0.00011267143,0.0000019123884,0.00013239465,0.0000073738156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003302177,0.00015381964,0.000028403028,0.00003832064,0.000014993614,0.0000055901887,0.00008049631,0.9949277,0.0001476544,0.003466479,0.0003250121,0.00077849324],"study_design_scores_gemma":[0.0011781061,0.00012396988,0.00020754423,0.00011295289,0.00000959567,0.00005723161,0.00016750043,0.996945,0.000037250633,0.00019219394,0.0007513317,0.00021728118],"about_ca_topic_score_codex":0.00057446695,"about_ca_topic_score_gemma":0.00010349113,"teacher_disagreement_score":0.95700634,"about_ca_system_score_codex":0.000087196066,"about_ca_system_score_gemma":0.000024207295,"threshold_uncertainty_score":0.73772186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005761031,0.00012609639,0.9773041,0.000105308594,0.0011211513,0.00011529978,5.8912747e-7,0.000089273075,0.015377141],"genre_scores_gemma":[0.98524845,0.000007071795,0.013210646,0.00035135465,0.000047691472,0.0000069333682,5.3057954e-7,0.000005541741,0.0011217587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893874,0.00012186675,0.00033428398,0.0002305163,0.00014256648,0.00023204894],"domain_scores_gemma":[0.99911684,0.00010764184,0.00009043807,0.00046412062,0.00014382647,0.00007710544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003111714,0.00009766721,0.00019736498,0.00005207708,0.0000962233,0.000047567526,0.00028817594,0.000052036008,0.00008042469],"category_scores_gemma":[0.000025696347,0.00007599018,0.000092627226,0.0002631019,0.000029281558,0.00015237645,0.00005328972,0.000089089226,0.000039667782],"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.0000055069518,0.00011034628,0.00084132125,0.000010440746,0.00003993216,0.000013435234,0.0003656588,0.14448975,0.0013633001,0.83604157,0.013722211,0.0029964985],"study_design_scores_gemma":[0.00022783167,0.00004237713,0.00042725957,0.00002579915,0.0000022184488,0.000035602763,0.000040428287,0.967241,0.00030084624,0.00033509653,0.03120988,0.00011165625],"about_ca_topic_score_codex":0.000047278576,"about_ca_topic_score_gemma":0.00004131212,"teacher_disagreement_score":0.9794874,"about_ca_system_score_codex":0.000010684303,"about_ca_system_score_gemma":0.00001567686,"threshold_uncertainty_score":0.30987898},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020456797,0.000010814873,0.9487815,0.0004096948,0.0067790463,0.00073281646,9.724187e-7,0.0002506367,0.022577748],"genre_scores_gemma":[0.98993236,0.0000013832564,0.006029002,0.0013712168,0.0011965646,0.00021882444,0.0000017523711,0.000013852456,0.0012350297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998902,0.000040713836,0.00019635094,0.00041281176,0.00012613738,0.00032196473],"domain_scores_gemma":[0.998871,0.00034716175,0.00006948016,0.0005135393,0.00011143512,0.000087326735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622863,0.00015734514,0.00017547993,0.000057224526,0.00021792031,0.00025614453,0.00056670065,0.0001408908,0.00005773685],"category_scores_gemma":[0.000030388845,0.00011768053,0.00013136394,0.00020027823,0.000024137556,0.00028298795,0.00008522853,0.00027967137,0.00005787175],"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.000018085299,0.0000544999,0.0003848046,0.0000068747268,0.000031582873,0.0000029834803,0.0002057816,0.0018227741,0.00018324616,0.9143557,0.03833251,0.044601135],"study_design_scores_gemma":[0.0006039462,0.00045089616,0.0015969113,0.00002257074,0.0000047735466,0.000027298382,0.000041814812,0.91604,0.0016287725,0.006279341,0.07294814,0.00035555],"about_ca_topic_score_codex":0.000024976032,"about_ca_topic_score_gemma":0.0001282986,"teacher_disagreement_score":0.96947557,"about_ca_system_score_codex":0.000020617144,"about_ca_system_score_gemma":0.000016716112,"threshold_uncertainty_score":0.47988728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061407365,0.0000131226925,0.93526,0.000114235576,0.0007094275,0.00014245011,0.000001377961,0.00016180638,0.0021902404],"genre_scores_gemma":[0.9780113,0.000001149869,0.021062063,0.00029281795,0.000075865784,0.000008596183,3.7764343e-7,0.000013675463,0.0005341594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998486,0.00007744133,0.00044213384,0.00039109954,0.00028412355,0.0003192204],"domain_scores_gemma":[0.9990401,0.00016000091,0.0001873408,0.00036798388,0.00015887828,0.000085652115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023689185,0.00019716765,0.00024691256,0.00019286932,0.00015091787,0.00012174829,0.0003802017,0.000077499004,0.000029767041],"category_scores_gemma":[0.0000071951736,0.00016708735,0.00011260914,0.0004097517,0.0000376888,0.00038958126,0.0000026289495,0.00028390184,0.000021593662],"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.00028955366,0.0008858599,0.00017831456,0.00011701914,0.00028043092,0.0001795751,0.006693978,0.4165464,0.03307124,0.003876246,0.00044930683,0.5374321],"study_design_scores_gemma":[0.0011019445,0.0009573893,0.00017672774,0.0007523273,0.000037673926,0.00059667457,0.00010102069,0.9313192,0.064003564,0.00013422732,0.00036379558,0.00045545452],"about_ca_topic_score_codex":0.000054007913,"about_ca_topic_score_gemma":0.000020963034,"teacher_disagreement_score":0.9166039,"about_ca_system_score_codex":0.000042608208,"about_ca_system_score_gemma":0.000030299556,"threshold_uncertainty_score":0.6813624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01288511,0.00012316021,0.9814291,0.00037123167,0.0009591993,0.00019378931,0.000005435585,0.00019773866,0.0038352378],"genre_scores_gemma":[0.99293953,0.0000061823744,0.0046069496,0.00014329681,0.00010933486,0.000009622746,0.0000055979235,0.0000054203515,0.0021740666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887335,0.00009065853,0.00030186964,0.00027629727,0.00018989918,0.00026792954],"domain_scores_gemma":[0.9992689,0.00004031142,0.00009455435,0.0003231961,0.0001955508,0.00007751288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020788895,0.000105009705,0.0001425522,0.00005718036,0.00019282631,0.00019753914,0.0002501306,0.00006748555,0.00022600345],"category_scores_gemma":[0.00003996787,0.0000885977,0.000082831415,0.00022337436,0.000024290002,0.00048181615,0.000080092614,0.00008580227,0.00013508405],"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.00008063787,0.0014259372,0.0047895946,0.000105495565,0.0003390709,0.00014645254,0.002057961,0.06833622,0.039417475,0.6494166,0.20551728,0.028367275],"study_design_scores_gemma":[0.00041552732,0.00004375734,0.00028077175,0.00004022061,0.00000404151,0.00004530767,0.000091305934,0.9942703,0.00035571668,0.00007554426,0.004256219,0.00012126738],"about_ca_topic_score_codex":0.00035283912,"about_ca_topic_score_gemma":0.000043608114,"teacher_disagreement_score":0.98005444,"about_ca_system_score_codex":0.000099289326,"about_ca_system_score_gemma":0.00000472031,"threshold_uncertainty_score":0.36129093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37569326,0.000078761914,0.61758345,0.0017359279,0.001987784,0.00067790627,5.0113596e-7,0.0000460742,0.002196342],"genre_scores_gemma":[0.9976197,0.0000044418043,0.0011679393,0.00046976394,0.0002785411,0.000064711385,3.6595702e-7,0.0000074013133,0.00038712082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987869,0.00016914197,0.00030661665,0.00025187715,0.00029256192,0.00019289587],"domain_scores_gemma":[0.99890375,0.00019958573,0.0001313414,0.00043096842,0.00029844203,0.000035887628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001867377,0.00010330657,0.0001229508,0.000046639543,0.00029629478,0.000099665616,0.00040682073,0.00006389586,0.000033284126],"category_scores_gemma":[0.00009427005,0.000060624836,0.000081607366,0.00033485974,0.000025740917,0.00022267249,0.000069611655,0.000114808136,0.000007252523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028920074,0.000070409944,0.009243601,0.00004127652,0.000046064026,1.0013976e-7,0.001491582,0.6797589,0.0002554078,0.010430916,0.010936179,0.2876966],"study_design_scores_gemma":[0.00031711397,0.00008998877,0.0031712975,0.00007219498,0.000014267679,0.00000811407,0.000062556006,0.99401826,0.00036205203,0.000030151406,0.0017679257,0.00008608298],"about_ca_topic_score_codex":0.000022302804,"about_ca_topic_score_gemma":0.00007024834,"teacher_disagreement_score":0.6219264,"about_ca_system_score_codex":0.00006620029,"about_ca_system_score_gemma":0.000016743528,"threshold_uncertainty_score":0.24722092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003150877,0.000008495002,0.9129894,0.00020543323,0.0019799764,0.00010310066,1.7696111e-7,0.0002430779,0.08131951],"genre_scores_gemma":[0.95335543,9.0730356e-7,0.043398753,0.0015170999,0.00023393084,0.0000082189745,8.2025133e-7,0.000007579169,0.0014772787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998786,0.00014170003,0.00022936764,0.00034848205,0.0001769146,0.00031753944],"domain_scores_gemma":[0.99928725,0.00012394067,0.000057468336,0.00038162302,0.00007455649,0.000075162505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042840024,0.000124422,0.0001477542,0.000073108655,0.00015285735,0.00020779324,0.00032221217,0.00005894458,0.0001511416],"category_scores_gemma":[0.000022479073,0.00009736259,0.00007350149,0.00029023737,0.0000102032,0.00018202633,0.000055188353,0.00011685731,0.00020937923],"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.0000011625945,0.00003622626,0.0000867401,0.0000019087756,0.000015822765,0.000012027499,0.0002677249,0.00062236475,0.000032076186,0.9780355,0.009283716,0.011604725],"study_design_scores_gemma":[0.00039330116,0.0001931235,0.000186442,0.000032787048,0.000001618402,0.00008795629,0.000041050218,0.973151,0.0011618792,0.0012314928,0.023275862,0.00024347995],"about_ca_topic_score_codex":0.000024951978,"about_ca_topic_score_gemma":0.0000070208716,"teacher_disagreement_score":0.976804,"about_ca_system_score_codex":0.00003468559,"about_ca_system_score_gemma":0.000021238382,"threshold_uncertainty_score":0.39703313},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006754204,0.000028830455,0.7561263,0.00018301627,0.0014881671,0.000118612734,3.198804e-7,0.0004802154,0.23482037],"genre_scores_gemma":[0.9879423,0.0000011124131,0.006622024,0.00033818182,0.000251473,0.000016858166,1.3866159e-7,0.000008633122,0.0048193256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880785,0.00002704457,0.0002882995,0.00032174445,0.00023515677,0.00031992738],"domain_scores_gemma":[0.99897015,0.00030093547,0.00007333918,0.00046411247,0.0000943541,0.000097135286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009794562,0.00011484319,0.00015714021,0.0001105834,0.00015197077,0.00013759229,0.0005143046,0.00007425196,0.000029486271],"category_scores_gemma":[0.0000511759,0.000085810694,0.00006700296,0.0002925767,0.00001118135,0.00020533316,0.000056685814,0.00008857668,0.0006015876],"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.000033863696,0.00010805112,0.00073042564,0.0001318839,0.00004005448,0.00007079386,0.00043534575,0.0013273201,0.00045416915,0.9499243,0.025046704,0.021697076],"study_design_scores_gemma":[0.00077819644,0.00033766348,0.0016145092,0.0008345415,0.000014746253,0.00031745376,0.0015475804,0.81747425,0.06848618,0.0005321934,0.1070034,0.0010593242],"about_ca_topic_score_codex":0.00010261074,"about_ca_topic_score_gemma":0.00003201049,"teacher_disagreement_score":0.98118806,"about_ca_system_score_codex":0.00007133545,"about_ca_system_score_gemma":0.000016601602,"threshold_uncertainty_score":0.7732392},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7502747,0.000112365124,0.16973063,0.0004930748,0.0020047978,0.00017606755,2.7650594e-7,0.00015314027,0.077054925],"genre_scores_gemma":[0.99589074,0.000019381776,0.0018025136,0.000103909835,0.0001226587,0.000010337206,1.5943384e-7,0.0000038381513,0.0020464594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917877,0.00004854034,0.00029965583,0.00017330027,0.000100463854,0.00019929913],"domain_scores_gemma":[0.99949527,0.00007027687,0.00006140603,0.0002990793,0.0000418041,0.00003215611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023449573,0.0000724616,0.00014582195,0.000095029805,0.00004666062,0.000031727915,0.00033119097,0.000045081706,0.00024469415],"category_scores_gemma":[0.000008537323,0.000062472514,0.000049686878,0.000541897,0.000017183313,0.0003267107,0.00007076242,0.00009265862,0.00007425701],"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.000021752887,0.00054747664,0.31771004,0.00010959293,0.00008629497,0.000019173873,0.007136128,0.15597855,0.00067053764,0.3527467,0.087337896,0.07763586],"study_design_scores_gemma":[0.00018282943,0.0001052047,0.0030827872,0.000055116714,7.689665e-7,0.000016822314,0.000037581474,0.99291116,0.00017451528,0.00010987411,0.0032346568,0.00008868509],"about_ca_topic_score_codex":0.00006868844,"about_ca_topic_score_gemma":0.0002196747,"teacher_disagreement_score":0.8369326,"about_ca_system_score_codex":0.00002583473,"about_ca_system_score_gemma":0.0000049169666,"threshold_uncertainty_score":0.26792294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1318703,0.00009881634,0.8614995,0.00007679549,0.00071708736,0.00015541141,3.0216356e-8,0.00020380206,0.005378244],"genre_scores_gemma":[0.9963881,0.0000031450984,0.001521221,0.0002061769,0.00023235174,0.000016047426,4.2214598e-8,0.0000053565655,0.0016275953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999134,0.00007245085,0.00021346913,0.00026366673,0.000115448,0.00020096828],"domain_scores_gemma":[0.9994224,0.00002798127,0.000022011925,0.00040835323,0.000055316526,0.000063989755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024158519,0.00008732537,0.00011028772,0.00004240294,0.00016011465,0.00020364692,0.0002732687,0.0000325175,0.00009565177],"category_scores_gemma":[0.0000043019613,0.00006905674,0.000046971152,0.00023471177,0.0000040987247,0.00027689163,0.00010391141,0.00008881169,0.00008093542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.632939e-7,0.00023792582,0.00039627284,0.0000019402498,0.000031935706,0.0027631342,0.0037119496,0.9643285,7.4781906e-7,0.008427937,0.0045099854,0.015588766],"study_design_scores_gemma":[0.00017114374,0.00008851848,0.0000012038514,0.0000040587747,0.0000020850937,0.0021200634,0.0011043372,0.99618983,2.6380619e-7,0.000033905366,0.00018881579,0.00009577014],"about_ca_topic_score_codex":0.0006537061,"about_ca_topic_score_gemma":0.00037028355,"teacher_disagreement_score":0.86451775,"about_ca_system_score_codex":0.000019086721,"about_ca_system_score_gemma":0.0000024113388,"threshold_uncertainty_score":0.2816052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25760105,0.00016020499,0.7361507,0.00007745655,0.0007896365,0.00027155987,2.0110551e-7,0.000057020796,0.0048921644],"genre_scores_gemma":[0.99699646,0.000029372542,0.0021303485,0.000043290012,0.00018261957,0.00007554523,7.571203e-7,0.000004971617,0.0005366078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990977,0.00003959025,0.00024362707,0.00018868351,0.0002529013,0.00017746739],"domain_scores_gemma":[0.99932927,0.000058940477,0.000090848975,0.00026568756,0.0002238133,0.000031433483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044380274,0.000087165405,0.0001438357,0.000042942705,0.000071525865,0.000045003908,0.00026315814,0.000045566034,0.00008677486],"category_scores_gemma":[0.000015581942,0.000067125475,0.00006426245,0.00011099673,0.000010758414,0.00022256155,0.000047722122,0.000045985234,0.000004697661],"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.000017825652,0.0001673841,0.010301107,0.00010798375,0.00008878761,2.4931884e-7,0.00060555973,0.08781162,0.00073287956,0.061700504,0.0077596176,0.8307065],"study_design_scores_gemma":[0.00036405903,0.000084785825,0.0016277662,0.000040975017,0.0000058728474,0.0000023928735,0.000010616555,0.995604,0.0011457741,0.000083551706,0.00094502117,0.000085194675],"about_ca_topic_score_codex":0.0000026584507,"about_ca_topic_score_gemma":0.000006147234,"teacher_disagreement_score":0.9077924,"about_ca_system_score_codex":0.00004631333,"about_ca_system_score_gemma":0.000005013212,"threshold_uncertainty_score":0.27372974},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11221179,0.000048734535,0.8631022,0.00025439478,0.0004763763,0.00086041226,0.000025875086,0.000061020473,0.022959186],"genre_scores_gemma":[0.9520806,0.0000022934096,0.047326975,0.00026356822,0.00004594932,0.00016229159,0.000005338873,0.00001502314,0.000097982316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989584,0.000037192523,0.00040099464,0.00015844908,0.00024120072,0.00020374995],"domain_scores_gemma":[0.9979333,0.0010099388,0.00029854936,0.00063268293,0.00007911279,0.000046365625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005103958,0.00014133057,0.00024656559,0.000074134034,0.000088063294,0.00001690316,0.0004665117,0.00005980642,0.000013574939],"category_scores_gemma":[0.000073664494,0.000094070674,0.00011137345,0.00011159778,0.00009092507,0.00007908268,0.000040245483,0.00008438983,0.000011706344],"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.000010996328,0.00014036601,0.0000047560925,0.00012019921,0.000014110502,8.1428766e-8,0.0036475805,0.00013578688,0.0026635358,0.9921351,0.0007430323,0.0003844391],"study_design_scores_gemma":[0.002652967,0.0019269976,0.00082807796,0.0019154578,0.00020555378,0.000017153248,0.009171614,0.4894892,0.12982327,0.34357348,0.018670112,0.0017261057],"about_ca_topic_score_codex":0.000008056944,"about_ca_topic_score_gemma":0.00000383768,"teacher_disagreement_score":0.8398688,"about_ca_system_score_codex":0.00007297441,"about_ca_system_score_gemma":0.000042616062,"threshold_uncertainty_score":0.38360906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067598216,0.00006898851,0.93073845,0.000696588,0.00034612036,0.00028344782,0.000001457537,0.000047747933,0.00021899187],"genre_scores_gemma":[0.956544,0.000007993429,0.042359296,0.0003179452,0.00036410446,0.000012150474,0.0000038871863,0.0000058888695,0.00038472505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917406,0.000028736582,0.0003085508,0.0002150364,0.00010049713,0.00017311024],"domain_scores_gemma":[0.99948424,0.000048203798,0.000100406985,0.0001993124,0.00012334551,0.000044513858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031526605,0.00008504652,0.00014649781,0.000055478977,0.000059487873,0.00006693972,0.00016296215,0.00004908204,0.00005141784],"category_scores_gemma":[0.00000440632,0.00007153134,0.000044360568,0.00011802704,0.000013001032,0.00028438435,0.00005536181,0.000038540744,0.000002928555],"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.00006554365,0.00013585715,0.0017324168,0.000074207506,0.00016072845,0.0000015441544,0.00093643524,0.123800494,0.0026874433,0.44039539,0.024978109,0.40503183],"study_design_scores_gemma":[0.0007837762,0.00010691959,0.00085476594,0.000010222197,0.0000056147833,0.000005263404,0.000092136695,0.99051845,0.0045261844,0.00066498586,0.0023312455,0.00010041457],"about_ca_topic_score_codex":0.000117711475,"about_ca_topic_score_gemma":0.00013731078,"teacher_disagreement_score":0.8889458,"about_ca_system_score_codex":0.00001853288,"about_ca_system_score_gemma":0.0000143760135,"threshold_uncertainty_score":0.29169637},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23080452,0.000022494196,0.7345996,0.000047355963,0.0008402309,0.00007884303,2.5313548e-7,0.000059560283,0.033547156],"genre_scores_gemma":[0.99649364,0.000020007163,0.0013550144,0.00023481667,0.000059689257,0.0000057665243,7.387383e-7,0.000006236792,0.0018241132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909586,0.00005234498,0.00027303264,0.00019538472,0.00014842491,0.00023493986],"domain_scores_gemma":[0.99929124,0.000041771513,0.0000841612,0.0004136796,0.00011173308,0.000057411045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819512,0.00010286715,0.00015538427,0.000053561645,0.000068656256,0.00005177224,0.00035775584,0.000066528126,0.00015729982],"category_scores_gemma":[0.0000052110317,0.00008042615,0.000055393295,0.00025585748,0.000014909495,0.00026731315,0.0000480849,0.000091578004,0.000020117413],"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.000013945712,0.00015150134,0.077040255,0.00006978063,0.00008295513,0.0000048025727,0.00053957826,0.07869253,0.00018911037,0.8264889,0.0039621503,0.012764466],"study_design_scores_gemma":[0.00027681253,0.00015335657,0.009037449,0.000044613855,0.000002637148,0.000034366974,0.00008274254,0.98692626,0.0011428177,0.0001541252,0.0019680061,0.00017681524],"about_ca_topic_score_codex":0.000049535447,"about_ca_topic_score_gemma":0.000051581188,"teacher_disagreement_score":0.9082337,"about_ca_system_score_codex":0.000024787629,"about_ca_system_score_gemma":0.000024342527,"threshold_uncertainty_score":0.3279683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21619627,0.00009846056,0.7657208,0.00030122657,0.0018782057,0.000229327,0.0000016294734,0.00009610572,0.0154779935],"genre_scores_gemma":[0.9905833,0.000001144322,0.008278432,0.00030757723,0.000345163,0.000013520904,0.0000010989584,0.000015900267,0.00045383727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885184,0.00009147292,0.00029050425,0.0001560344,0.00028068657,0.0003294641],"domain_scores_gemma":[0.9989568,0.00026357255,0.00017381374,0.00048980315,0.000052633543,0.00006335253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329132,0.00014640065,0.00015260118,0.000054070893,0.0003355306,0.0002798089,0.0003372188,0.000060623603,0.000045328085],"category_scores_gemma":[0.000068526584,0.000090495116,0.00010008646,0.00019781112,0.000030200597,0.0003653125,0.00011556149,0.0001396332,0.0001134306],"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.00000685974,0.00012219977,0.0002994113,0.000083732884,0.00007275299,0.0000016889059,0.014506286,0.000348209,0.0010263374,0.9751365,0.003453549,0.004942471],"study_design_scores_gemma":[0.00017860268,0.00007909335,0.00014927749,0.00023408596,0.00002880839,0.00007944292,0.0022745726,0.98349655,0.00048580323,0.00776496,0.0049524764,0.00027635024],"about_ca_topic_score_codex":0.000006029609,"about_ca_topic_score_gemma":8.354692e-7,"teacher_disagreement_score":0.98314834,"about_ca_system_score_codex":0.00004653184,"about_ca_system_score_gemma":0.000012142987,"threshold_uncertainty_score":0.3690284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024237544,0.000014296751,0.99012935,0.0005026128,0.0057059205,0.00061977364,0.0000061737355,0.0003226787,0.00027545096],"genre_scores_gemma":[0.96916133,0.0000012298227,0.029345449,0.00064968783,0.00043147858,0.00012040275,0.0000020950677,0.000018913932,0.0002693885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986783,0.00008097638,0.0002452101,0.0003334566,0.00022074241,0.00044129055],"domain_scores_gemma":[0.9989221,0.00036163646,0.00007704401,0.0004216984,0.00007145671,0.0001460843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026365067,0.00019339689,0.00017812986,0.00019222508,0.00031399104,0.00016600623,0.0003283022,0.000093438925,0.000007979108],"category_scores_gemma":[0.0000023110497,0.0001730426,0.00019731875,0.00028713845,0.000023930386,0.000338059,0.0000021092637,0.0002048273,0.00006429738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036551563,0.00016670556,0.000003287031,0.000011970585,0.000032182834,5.516436e-7,0.00056164106,0.8351038,0.000031384774,0.0014321819,0.0007995877,0.16182014],"study_design_scores_gemma":[0.0005346225,0.0004725366,0.000018569937,0.00006463742,0.0000105752915,0.000016059914,0.000012739436,0.95760185,0.001263428,0.00019795983,0.039581254,0.00022574108],"about_ca_topic_score_codex":0.000012253866,"about_ca_topic_score_gemma":0.00001186488,"teacher_disagreement_score":0.9667376,"about_ca_system_score_codex":0.00008162081,"about_ca_system_score_gemma":0.000020668955,"threshold_uncertainty_score":0.70564723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019833886,0.000025849175,0.986416,0.004247342,0.0052319947,0.00091462885,0.0000452271,0.00043618542,0.0006994312],"genre_scores_gemma":[0.8708068,0.00004571116,0.10382393,0.01584985,0.006450472,0.0011069153,0.000036536105,0.00009648965,0.0017832556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782807,0.000057296154,0.0004509882,0.0007850539,0.00033401657,0.00054459245],"domain_scores_gemma":[0.998412,0.00011042136,0.00017164047,0.0007700164,0.00035762828,0.00017825836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003715165,0.0003116227,0.00032733343,0.00004699609,0.000497202,0.00038557622,0.0010551426,0.00024605347,0.0000070964097],"category_scores_gemma":[0.0000019821514,0.0002945318,0.0005695457,0.00034973654,0.00007101054,0.0005347338,0.00014154796,0.00022203459,0.00015300297],"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.000060240825,0.0014673611,0.000019764155,0.00020186136,0.00047783693,0.000010053263,0.021810932,0.15307105,0.0060811765,0.43681857,0.3705847,0.009396468],"study_design_scores_gemma":[0.0053314376,0.0022222495,0.00013879452,0.0003071817,0.000040465824,0.0001170479,0.0003198282,0.09637198,0.016370576,0.009681086,0.86717635,0.0019230079],"about_ca_topic_score_codex":0.000016712249,"about_ca_topic_score_gemma":0.0000033058986,"teacher_disagreement_score":0.882592,"about_ca_system_score_codex":0.00019916287,"about_ca_system_score_gemma":0.00010735079,"threshold_uncertainty_score":0.9999507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003587178,0.000012731003,0.9652682,0.0006283401,0.00042236218,0.00013821897,6.5246377e-7,0.00023013819,0.029712174],"genre_scores_gemma":[0.9481651,0.0000010725635,0.04575094,0.0006865654,0.00010429861,0.000015114085,2.0751838e-7,0.000009153161,0.0052675093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903643,0.000021735368,0.0001741641,0.00031480493,0.00020220024,0.00025066754],"domain_scores_gemma":[0.9993318,0.000046122306,0.00005312911,0.000385262,0.00009695519,0.00008678577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012221716,0.00012153885,0.00013776137,0.000059240218,0.00009845513,0.00021295346,0.00036265416,0.000053489217,0.0002114346],"category_scores_gemma":[0.0000057330194,0.00008451894,0.000040565432,0.0002516293,0.000015286929,0.00027067342,0.00007375311,0.00009012893,0.0001712217],"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.000009182251,0.00045427476,0.00005727449,0.000013042244,0.00004943073,0.00004464418,0.0020157895,0.00036835222,0.010807143,0.97415835,0.005299065,0.0067234384],"study_design_scores_gemma":[0.00061672024,0.000321667,0.000011010168,0.00003801128,0.0000031624606,0.00029512116,0.00009099171,0.98769426,0.0028408521,0.000323641,0.0075491467,0.00021543843],"about_ca_topic_score_codex":0.00007231142,"about_ca_topic_score_gemma":0.00009038836,"teacher_disagreement_score":0.9873259,"about_ca_system_score_codex":0.00003538631,"about_ca_system_score_gemma":0.0000069191065,"threshold_uncertainty_score":0.34465823},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.722537,0.0009443757,0.15990151,0.004685077,0.051243003,0.00088412565,0.000001575841,0.0014435949,0.05835977],"genre_scores_gemma":[0.9954993,0.0000119863635,0.00040291707,0.0011358018,0.00010678088,0.000019387151,0.0000012014544,0.000013527093,0.0028091136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986446,0.000113673144,0.0002828072,0.00036116218,0.0002450578,0.00035269436],"domain_scores_gemma":[0.99891394,0.0001568826,0.00009431167,0.00062836055,0.000085595166,0.00012091408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038833317,0.00015960525,0.00019214855,0.000084248124,0.0001710594,0.00018607866,0.0006464768,0.00010243084,0.0000430382],"category_scores_gemma":[0.000037805785,0.0001454006,0.00009955474,0.00035660787,0.000020019745,0.00030550183,0.00010630998,0.00021280705,0.00041472734],"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.000008607961,0.00007259303,0.00009308176,0.000001537834,0.000013233734,0.000009961114,0.00008890343,0.003043569,0.0000074660634,0.9314424,0.057624783,0.0075938655],"study_design_scores_gemma":[0.0018319446,0.00041458657,0.00053264986,0.00007006318,0.0000074113236,0.000059634218,0.000016830767,0.79252994,0.00034294854,0.13604079,0.06764719,0.0005060207],"about_ca_topic_score_codex":0.000014200928,"about_ca_topic_score_gemma":0.000010192366,"teacher_disagreement_score":0.79540163,"about_ca_system_score_codex":0.00009325166,"about_ca_system_score_gemma":0.000025660895,"threshold_uncertainty_score":0.59292644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003802409,0.00015931057,0.99374425,0.000021616997,0.0012646456,0.00078083,0.000051333172,0.00015150731,0.000024077452],"genre_scores_gemma":[0.9806087,0.0002116569,0.018693913,0.000046205154,0.00010291853,0.0001659486,0.000037329322,0.000026885624,0.00010642882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822956,0.000100584955,0.00072198524,0.00046412958,0.00022118846,0.0002625332],"domain_scores_gemma":[0.9982107,0.00037558412,0.00037366315,0.00036560558,0.0005446549,0.00012974472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069278834,0.00030669867,0.00043567677,0.0004086309,0.00051831815,0.0004392057,0.00026093193,0.00029878618,0.0000042757997],"category_scores_gemma":[0.0000061071837,0.00026611512,0.00006919456,0.00037218898,0.000081681705,0.0009827333,0.0000064640694,0.00031354564,5.691922e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093512506,0.0002528073,0.00003073198,0.0004098366,0.00026137152,0.0000034701404,0.0020198815,0.3235478,0.010549578,0.020266976,0.0010579417,0.6415061],"study_design_scores_gemma":[0.00093606184,0.0006099405,0.00001225445,0.00026419273,0.000030950643,0.00028747707,0.00020420752,0.9939836,0.0026324575,0.00040236584,0.00036201335,0.00027446813],"about_ca_topic_score_codex":0.0004053163,"about_ca_topic_score_gemma":0.00013669433,"teacher_disagreement_score":0.9768063,"about_ca_system_score_codex":0.000058992453,"about_ca_system_score_gemma":0.000057141235,"threshold_uncertainty_score":0.9999791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10573673,0.000055045617,0.8912323,0.0007560218,0.00031074323,0.00035394172,0.0000021459616,0.000084005915,0.0014690527],"genre_scores_gemma":[0.99612296,0.000038402348,0.0024326683,0.00055107387,0.00007511165,0.000053020794,2.7722757e-7,0.000007173063,0.00071932754],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989061,0.00007722635,0.00031410015,0.00023732842,0.00023986942,0.00022537452],"domain_scores_gemma":[0.99902934,0.00015334778,0.00008906224,0.0006123486,0.00006955141,0.00004636352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001643188,0.00013873636,0.00013880209,0.00012485459,0.0002510355,0.00005180615,0.00052943174,0.000059418977,0.000024193294],"category_scores_gemma":[0.0000017101828,0.000102267244,0.00009338563,0.00039358393,0.0000446464,0.000042726344,0.0000013689771,0.00027652716,0.000028642338],"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.00010910552,0.0006019804,0.000004418067,0.00005401831,0.000041617368,0.0000019542574,0.0018838864,0.30141222,0.07626511,0.0069587203,0.00029489913,0.6123721],"study_design_scores_gemma":[0.00084028055,0.009919319,0.0012788768,0.00016262537,0.000053037955,0.000106229214,0.00008367072,0.3978853,0.5837433,0.0013190921,0.0040581534,0.0005501605],"about_ca_topic_score_codex":0.000006374565,"about_ca_topic_score_gemma":0.000027954917,"teacher_disagreement_score":0.8903862,"about_ca_system_score_codex":0.000026233194,"about_ca_system_score_gemma":0.000030471547,"threshold_uncertainty_score":0.41703373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008621906,0.000076677636,0.9968734,0.00030455308,0.00015615317,0.000978527,0.0000039056836,0.00020045642,0.00054417626],"genre_scores_gemma":[0.86268747,0.000014807118,0.13620694,0.00025103657,0.00012506948,0.00060810224,0.000012773805,0.000014630293,0.00007919555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989172,0.00013223689,0.0003355474,0.00032495908,0.000098942335,0.00019109105],"domain_scores_gemma":[0.9983143,0.0010654677,0.0001528153,0.00019567095,0.00022087793,0.000050848284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011731512,0.00012708438,0.00018449005,0.00012469919,0.00025672428,0.00016562818,0.0001512862,0.00006755736,7.0813985e-7],"category_scores_gemma":[0.00018591576,0.00011346243,0.000015841046,0.00050733984,0.00002723498,0.00040679652,0.000014266734,0.00006489927,0.0000055437376],"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.000033268985,0.00010874158,0.00038237308,0.0003096829,0.000012560038,0.0000038039875,0.0015962225,0.29256722,0.00023813242,0.69254524,0.0005262344,0.011676552],"study_design_scores_gemma":[0.0009703404,0.00032786102,0.0013974976,0.00018539706,0.0000069629823,0.00003097324,0.00009054386,0.98665184,0.0004263603,0.007138629,0.002589226,0.00018434804],"about_ca_topic_score_codex":0.000021275699,"about_ca_topic_score_gemma":0.000024329775,"teacher_disagreement_score":0.8618252,"about_ca_system_score_codex":0.000045637265,"about_ca_system_score_gemma":0.00008721578,"threshold_uncertainty_score":0.4626864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051455344,0.0001249366,0.9783823,0.0002685879,0.003408407,0.00052831793,0.0000012622237,0.00021305805,0.011927607],"genre_scores_gemma":[0.9738426,4.3893206e-7,0.022103036,0.00026823403,0.00021032094,0.00006834898,6.3599214e-7,0.000014600379,0.0034917558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985621,0.00006550264,0.00033912857,0.00042947737,0.00021684407,0.00038695105],"domain_scores_gemma":[0.99904233,0.00017406502,0.00010728897,0.00044648282,0.00012668275,0.000103144455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161453,0.00016889568,0.00022275865,0.00010625129,0.00021043117,0.00040678636,0.00043143923,0.00008337849,0.000004111154],"category_scores_gemma":[0.000068769215,0.00012754006,0.00013340331,0.0002316275,0.000008841301,0.00008508452,0.000051242067,0.00013018855,0.000024983303],"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.000005519133,0.00007212003,0.000024296163,0.000057851743,0.000029950603,0.0000016393923,0.0011025389,0.21567176,0.0010500877,0.77621716,0.0037028021,0.0020642742],"study_design_scores_gemma":[0.0005906886,0.0000860702,0.000017124024,0.00008277628,0.000004252595,0.00014891548,0.0002649978,0.8969695,0.0003696172,0.0003823693,0.10082513,0.00025855593],"about_ca_topic_score_codex":0.000078921425,"about_ca_topic_score_gemma":0.000021532212,"teacher_disagreement_score":0.9686971,"about_ca_system_score_codex":0.000059514623,"about_ca_system_score_gemma":0.00004779513,"threshold_uncertainty_score":0.52009326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006803125,0.00025514327,0.9907677,0.00008654456,0.0015158583,0.0002814892,0.0000086227365,0.0001505796,0.00013089654],"genre_scores_gemma":[0.9420762,0.000002034784,0.05720671,0.000085175845,0.00020246724,0.000018173187,0.0000038527537,0.000008325933,0.00039703952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.000020285372,0.00029834357,0.00024139106,0.000150124,0.00019774912],"domain_scores_gemma":[0.99931026,0.000042025684,0.00011697058,0.00031034253,0.00013942187,0.00008097573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009050809,0.000104926454,0.00019087835,0.00007115255,0.00009315492,0.00012914147,0.0003257842,0.00006941123,0.000015825226],"category_scores_gemma":[0.000017738646,0.000086179076,0.00011670209,0.00018582873,0.000010242436,0.00019311091,0.000040770727,0.000047021666,0.0000036340575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017865366,0.000028936242,0.00036197618,0.00017235153,0.00011003585,0.000008526237,0.0010055704,0.5692089,0.0008221029,0.41668403,0.0065755513,0.0050041466],"study_design_scores_gemma":[0.014362358,0.0047313776,0.00087584765,0.0031377613,0.00015935737,0.0029952514,0.0010622869,0.40712005,0.13249756,0.32358682,0.10549815,0.003973179],"about_ca_topic_score_codex":0.00037061409,"about_ca_topic_score_gemma":0.00012450192,"teacher_disagreement_score":0.9352731,"about_ca_system_score_codex":0.000033340282,"about_ca_system_score_gemma":0.00006340278,"threshold_uncertainty_score":0.3514281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008626218,0.000009243004,0.9783859,0.0057190144,0.0028169064,0.00039756487,4.3143496e-7,0.000157398,0.0038873162],"genre_scores_gemma":[0.89192903,9.435058e-7,0.07203477,0.002625118,0.0018598608,0.000041094372,0.0000016915207,0.000010727376,0.03149677],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992363,0.000021830525,0.00019939963,0.00023117312,0.00009469389,0.00021663551],"domain_scores_gemma":[0.99949014,0.000052428077,0.00003265871,0.00025373153,0.00007909679,0.000091972506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010291277,0.000090374015,0.00012792494,0.00003618832,0.000061666186,0.00029331897,0.000368822,0.00012382929,0.000623416],"category_scores_gemma":[0.0000037339926,0.00006720038,0.0000801069,0.000092485425,0.0000055427417,0.00039503977,0.000027632525,0.00008466411,0.00033954467],"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.000014157433,0.00002489487,0.000041462412,0.000014402689,0.00003612044,0.0000011528747,0.00084852625,0.00018986515,0.0024665007,0.2961785,0.62589246,0.07429194],"study_design_scores_gemma":[0.004383552,0.00079896726,0.0013600204,0.0000586278,0.000013864786,0.00004716865,0.0000944135,0.6351789,0.010105259,0.05091093,0.2961842,0.000864068],"about_ca_topic_score_codex":0.0008452558,"about_ca_topic_score_gemma":0.000056375968,"teacher_disagreement_score":0.90635115,"about_ca_system_score_codex":0.0000127260555,"about_ca_system_score_gemma":0.00002716661,"threshold_uncertainty_score":0.68259674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23794837,0.00005414278,0.7394691,0.00025578367,0.0016404236,0.00028166376,0.0000012704303,0.00033644648,0.020012803],"genre_scores_gemma":[0.9746181,6.845204e-7,0.021635257,0.0006638693,0.00042652144,0.000022878425,0.0000025832437,0.000021529413,0.0026086103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979725,0.000096827025,0.00061059627,0.0005680041,0.0002804975,0.00047159297],"domain_scores_gemma":[0.9989951,0.000067758345,0.00009631376,0.0005516456,0.00015428342,0.00013486105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051291985,0.00024465015,0.00034427646,0.0002224279,0.00019955776,0.00028079774,0.00073780114,0.000100555095,0.000053192747],"category_scores_gemma":[0.000013781191,0.00020066142,0.00013654372,0.0006212342,0.000016701732,0.0004064356,0.00011131963,0.0001282928,0.00020151745],"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.00012112277,0.00054697995,0.01845698,0.00046244674,0.00032781504,0.0005315137,0.006099345,0.051501002,0.042863175,0.8315092,0.0265026,0.021077825],"study_design_scores_gemma":[0.00186988,0.0003860374,0.009296958,0.0011477044,0.000046270176,0.0014695214,0.00064745184,0.8935752,0.010639475,0.0026462108,0.0757249,0.0025503973],"about_ca_topic_score_codex":0.001975411,"about_ca_topic_score_gemma":0.0011012682,"teacher_disagreement_score":0.8420742,"about_ca_system_score_codex":0.00011921344,"about_ca_system_score_gemma":0.00008760066,"threshold_uncertainty_score":0.81827354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07562346,0.00015377266,0.86781865,0.00022459295,0.00037588374,0.00005744574,8.524072e-8,0.00015680655,0.05558931],"genre_scores_gemma":[0.98058784,0.00000321667,0.016925968,0.00013252371,0.00015088407,0.0000043310883,2.0328164e-7,0.0000036711642,0.0021913503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942154,0.000029849847,0.00014608157,0.0001894246,0.000069947964,0.00014316378],"domain_scores_gemma":[0.9997335,0.00004636502,0.000024312785,0.0001399607,0.000027898857,0.000027954042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017916056,0.00006493723,0.00008721147,0.00004295429,0.00010646181,0.00019964887,0.00013754582,0.000030681218,0.000017496837],"category_scores_gemma":[0.0000031008574,0.00005206262,0.000022408005,0.00007604467,0.000010148672,0.00023432006,0.000037052465,0.00004700658,0.0000219244],"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.000009811306,0.00009023575,0.0070226267,0.000059548318,0.00004358002,0.000085460386,0.0018155897,0.009157529,0.044615865,0.7901518,0.022277402,0.12467056],"study_design_scores_gemma":[0.00048348051,0.000092922,0.0034669016,0.00009930241,0.000004287611,0.00040033265,0.0002537891,0.9383311,0.023025826,0.005759602,0.027617987,0.0004644272],"about_ca_topic_score_codex":0.00029903578,"about_ca_topic_score_gemma":0.00005349408,"teacher_disagreement_score":0.9291736,"about_ca_system_score_codex":0.00001013413,"about_ca_system_score_gemma":0.000006191949,"threshold_uncertainty_score":0.2123052},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5847156,0.0005890004,0.37096286,0.005913512,0.0030407691,0.00093405147,0.0000015272129,0.00034248934,0.033500195],"genre_scores_gemma":[0.99719113,0.0000066448206,0.00096043124,0.0013907428,0.00016499728,0.000005502361,1.18794844e-7,0.000003895094,0.00027651692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989423,0.00021586749,0.00021195368,0.00022289174,0.0001791631,0.00022778707],"domain_scores_gemma":[0.99739015,0.0020112575,0.00007814044,0.00043204552,0.000034392076,0.00005402491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007270939,0.00012374729,0.00019275091,0.000012792336,0.00018358055,0.00013256515,0.0003613794,0.000053068085,0.0000054540765],"category_scores_gemma":[0.00007492254,0.00006667632,0.000084082094,0.00017024658,0.000027705355,0.00006992548,0.000050275106,0.00008420993,0.000007706008],"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.0015166132,0.0003234184,0.03224333,0.00017128316,0.00032933638,0.000063878186,0.0004192931,0.23390512,0.0037311108,0.14773212,0.1552876,0.4242769],"study_design_scores_gemma":[0.00218464,0.0066169584,0.028404474,0.00020022804,0.000017176322,0.000038692848,0.0000070928886,0.9148199,0.031411957,0.0014834229,0.01432561,0.0004898267],"about_ca_topic_score_codex":0.00001614819,"about_ca_topic_score_gemma":0.000047641086,"teacher_disagreement_score":0.6809148,"about_ca_system_score_codex":0.000012666273,"about_ca_system_score_gemma":0.000009073328,"threshold_uncertainty_score":0.27189815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31672317,0.000018859828,0.37875742,0.009066506,0.014528858,0.0015742198,0.0000810036,0.0005550311,0.27869496],"genre_scores_gemma":[0.99526894,0.0000024853232,0.000120152035,0.0013264953,0.00027261217,0.00005953106,0.00007168116,0.000008453197,0.0028696326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975126,0.00016236905,0.0008973287,0.00023814592,0.0009828967,0.00020670514],"domain_scores_gemma":[0.99772906,0.0000705393,0.0007500097,0.00041505662,0.0009886282,0.000046707843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125358,0.00022218534,0.00019434118,0.00033409204,0.00022365463,0.00049826445,0.0007794828,0.00010365697,0.0004240611],"category_scores_gemma":[0.00011567944,0.00016256484,0.00013541602,0.00031350573,0.00008525974,0.0021224353,0.000112335416,0.00022138911,0.00057203334],"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.000118519325,0.000089216825,0.00008643443,0.000017450726,0.00003247669,2.47069e-7,0.00097079884,0.006955925,0.0020561314,0.9659196,0.018206932,0.0055462765],"study_design_scores_gemma":[0.0012837421,0.00041712334,0.0017359955,0.00038608268,0.000010532328,0.000019795127,0.00031153788,0.957162,0.008882398,0.0069532,0.022489376,0.00034820577],"about_ca_topic_score_codex":0.00018918882,"about_ca_topic_score_gemma":0.000019023804,"teacher_disagreement_score":0.9589664,"about_ca_system_score_codex":0.00018887629,"about_ca_system_score_gemma":0.00013155035,"threshold_uncertainty_score":0.73525226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011656022,0.000008368645,0.9897934,0.0012448024,0.0038366972,0.0005244347,0.000009710613,0.0002157944,0.003201185],"genre_scores_gemma":[0.59942144,0.0000089842215,0.39547825,0.0019700066,0.0016227071,0.0002000567,0.00003946214,0.00002100735,0.0012380976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797356,0.0002468111,0.00042486965,0.0006422132,0.0004203313,0.00029222382],"domain_scores_gemma":[0.9980577,0.00035292053,0.00019338643,0.0003558758,0.00091520225,0.00012487484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005410169,0.00024248369,0.00023926268,0.00022554187,0.00022082042,0.00092711457,0.00105637,0.00009537392,0.00011363469],"category_scores_gemma":[0.000020471818,0.00022640747,0.0001118155,0.00017452493,0.00003706468,0.0010546232,0.00009193142,0.00015511035,0.0000727664],"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.00010562915,0.00022026172,0.000021014166,0.0000051258808,0.00013685037,0.00008760541,0.0023536987,0.018737534,0.00041816282,0.4014844,0.004933395,0.5714963],"study_design_scores_gemma":[0.0007429141,0.0007889744,0.00007406245,0.00007367451,0.0000039733964,0.0001205719,0.00008222277,0.98497933,0.00049433706,0.009594251,0.0027739115,0.00027177436],"about_ca_topic_score_codex":0.000015663927,"about_ca_topic_score_gemma":0.0000067103115,"teacher_disagreement_score":0.9662418,"about_ca_system_score_codex":0.00013279586,"about_ca_system_score_gemma":0.00011415156,"threshold_uncertainty_score":0.9232629},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10270357,0.00062794535,0.88450336,0.00021727335,0.009831315,0.0005042694,7.948661e-7,0.00039299304,0.0012184526],"genre_scores_gemma":[0.99104375,0.00013661476,0.006029501,0.00028883043,0.0019571076,0.00017288145,9.2999585e-7,0.000035708283,0.00033468168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972188,0.00018145,0.00059319957,0.000496547,0.00036342544,0.001146599],"domain_scores_gemma":[0.99859446,0.00028259977,0.00017867406,0.00072529743,0.00006788154,0.00015109585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010953476,0.00031952534,0.00034457725,0.00024318628,0.00054317544,0.0001987731,0.0009118148,0.00017978557,0.000015924154],"category_scores_gemma":[0.000008909349,0.0003049714,0.00014049084,0.001297226,0.000037334805,0.0012794113,0.000018112705,0.0006073996,0.00006124357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006668073,0.00027624425,0.013900139,0.0000868435,0.000059799877,0.000008518771,0.0035409858,0.78242433,0.0000853973,0.00064643746,0.0005721884,0.19833241],"study_design_scores_gemma":[0.0008811275,0.00018465507,0.0024255097,0.0011104838,0.000019327174,0.000101252524,0.00016437566,0.9725377,0.0011006905,0.0002628171,0.020419933,0.0007921231],"about_ca_topic_score_codex":0.00004479636,"about_ca_topic_score_gemma":0.000123632,"teacher_disagreement_score":0.8883402,"about_ca_system_score_codex":0.00018536155,"about_ca_system_score_gemma":0.00004513809,"threshold_uncertainty_score":0.9999402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024754077,0.00003518896,0.99041957,0.00021672639,0.0019347139,0.0004086584,8.689863e-7,0.00024382613,0.00649292],"genre_scores_gemma":[0.47956842,3.744461e-7,0.5175351,0.0009572712,0.0009671654,0.00003042713,0.0000015723186,0.000009867444,0.0009297944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861705,0.00007421998,0.00030258548,0.00033843244,0.00017585063,0.0004918549],"domain_scores_gemma":[0.99879175,0.0004788659,0.00008446311,0.00038248347,0.00014418818,0.00011823143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018091967,0.00013866738,0.00017685578,0.000056989753,0.0002015407,0.0001397947,0.0004519899,0.00006990992,0.000023773784],"category_scores_gemma":[0.000020654861,0.000113966336,0.00011649441,0.00030246255,0.000021852678,0.00017707222,0.000034269204,0.00008314447,0.000025373574],"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.00012361894,0.00017026547,0.0012265117,0.000037271555,0.00008190623,0.00002839746,0.00042951634,0.27669513,0.00021654609,0.4317141,0.12345015,0.16582659],"study_design_scores_gemma":[0.0006328906,0.00016913883,0.00017828755,0.00002099615,0.000003579248,0.000008645127,0.000020226871,0.97675174,0.0018841526,0.0025795696,0.017552393,0.00019835636],"about_ca_topic_score_codex":0.000100458186,"about_ca_topic_score_gemma":0.0003433871,"teacher_disagreement_score":0.7000566,"about_ca_system_score_codex":0.00006153953,"about_ca_system_score_gemma":0.0000381587,"threshold_uncertainty_score":0.46474123},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7454007,0.00017899476,0.13250397,0.01036538,0.0022006521,0.00039104276,0.00003928177,0.0003322312,0.108587705],"genre_scores_gemma":[0.9945723,0.00034058793,0.0036163419,0.0002229908,0.00010285162,0.000045150653,0.000026201727,0.0000138001315,0.0010598126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998118,0.00013501992,0.0006365672,0.0003688274,0.00050118915,0.00024042667],"domain_scores_gemma":[0.99726886,0.00036656504,0.00040963443,0.0014846114,0.00039229513,0.000078044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004505239,0.00019170975,0.00031140415,0.0005844677,0.00029372692,0.00016251524,0.002250159,0.00007647464,0.00019531457],"category_scores_gemma":[0.000035748104,0.00018304399,0.0002777555,0.0012913429,0.00006182158,0.00048540274,0.00024468236,0.00026889663,0.00012336943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040531715,0.0026386112,0.09891987,0.000048569415,0.0052856994,0.0000062201493,0.007994433,0.58174276,0.029086305,0.21341288,0.010724003,0.05010014],"study_design_scores_gemma":[0.00030244733,0.000100442914,0.0048125926,0.00007933007,0.0000704441,0.000007472736,0.00003766396,0.98407346,0.003847939,0.00010870693,0.006340907,0.00021858452],"about_ca_topic_score_codex":0.00015080799,"about_ca_topic_score_gemma":0.00012976551,"teacher_disagreement_score":0.40233073,"about_ca_system_score_codex":0.0001549152,"about_ca_system_score_gemma":0.000015809097,"threshold_uncertainty_score":0.7464317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007574643,0.00018737104,0.8898511,0.0013481892,0.0017658487,0.00007206125,7.7493105e-8,0.000102124046,0.09909857],"genre_scores_gemma":[0.9948933,0.0000012894442,0.0014925131,0.0007634319,0.00035333255,0.0000039358392,7.958565e-8,0.0000018456868,0.002490278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956536,0.000045581175,0.00008195711,0.00006625496,0.00008249478,0.00015835467],"domain_scores_gemma":[0.99969363,0.000056748715,0.000017970655,0.00018223088,0.000017403936,0.00003201641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029314868,0.00004122555,0.00004102888,0.000010481963,0.00012259236,0.00008421293,0.00025259948,0.000018875968,0.000068447225],"category_scores_gemma":[0.000004077215,0.000020673071,0.000037546706,0.00009344791,0.000008617449,0.0003386582,0.000018315226,0.000059096685,0.00008868092],"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.0000013562727,0.000021945089,0.0019609698,0.0000036343429,0.000016850043,5.908775e-7,0.00644132,0.00009876084,0.0005901014,0.92563087,0.028609473,0.036624134],"study_design_scores_gemma":[0.000550364,0.000091438684,0.022450037,0.000042200387,0.000010965784,0.0002487235,0.0011566902,0.32708275,0.004674921,0.0017770694,0.64134496,0.00056989474],"about_ca_topic_score_codex":0.000026015743,"about_ca_topic_score_gemma":0.000009753269,"teacher_disagreement_score":0.98731863,"about_ca_system_score_codex":0.00000713694,"about_ca_system_score_gemma":0.0000041602807,"threshold_uncertainty_score":0.11398435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29963782,0.00031960933,0.69348806,0.00068449095,0.00012700685,0.00017219437,4.176323e-7,0.000045039906,0.005525337],"genre_scores_gemma":[0.99778193,0.000009718664,0.001525928,0.0001892847,0.00004957075,0.000006513382,1.6735937e-7,0.000003248688,0.00043366232],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994062,0.000025649173,0.00019355532,0.00016531697,0.00010131457,0.00010793713],"domain_scores_gemma":[0.9996643,0.000049156504,0.00005476752,0.00015499866,0.000047488436,0.000029257413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015597974,0.00007174468,0.00015419451,0.000052674703,0.000023885399,0.000051307612,0.00010764543,0.000040383606,0.000013538441],"category_scores_gemma":[0.000005770897,0.00005160537,0.000015338255,0.00013266296,0.000015147437,0.00023130135,0.000021246602,0.00006819574,0.0000025877493],"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.00047876692,0.0014462684,0.30507874,0.0009337477,0.00054359675,0.00014080972,0.030176377,0.14573945,0.034002498,0.2727537,0.006080669,0.20262536],"study_design_scores_gemma":[0.0010115792,0.00026076534,0.004921718,0.000100163445,0.000003177997,0.000024526953,0.000058286496,0.99157727,0.0011337339,0.00011397126,0.00068451493,0.00011031375],"about_ca_topic_score_codex":0.00018461625,"about_ca_topic_score_gemma":0.0006602709,"teacher_disagreement_score":0.8458378,"about_ca_system_score_codex":0.000009774095,"about_ca_system_score_gemma":0.0000050400863,"threshold_uncertainty_score":0.21044059},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05161881,0.00014937206,0.94245845,0.00038598984,0.0031968527,0.000645114,0.000087508626,0.00034002666,0.0011178631],"genre_scores_gemma":[0.99580336,0.0000085426045,0.002417868,0.00018613329,0.0001879542,0.00015730204,0.000011476792,0.000034007804,0.001193347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966454,0.00031950008,0.0010960903,0.0006782667,0.0006594172,0.00060132],"domain_scores_gemma":[0.99784404,0.00018049915,0.0003740451,0.0009448845,0.00048699407,0.00016953897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085366366,0.0003987523,0.0005863659,0.0004012665,0.0004667249,0.0003210524,0.00072216324,0.00027622003,0.0001617956],"category_scores_gemma":[0.00001028498,0.00035559706,0.00042454037,0.0006798524,0.00013796227,0.0008812445,0.000004450159,0.0005104129,0.00018461265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065244414,0.004885681,0.0002930916,0.0003710682,0.000545192,0.000012192238,0.00861496,0.83981067,0.07960968,0.04247082,0.007246961,0.015487219],"study_design_scores_gemma":[0.0012912155,0.00045219148,0.00009413987,0.00028829306,0.000019028943,0.000037082566,0.00055614294,0.8789084,0.11066239,0.00005661671,0.007196612,0.00043786466],"about_ca_topic_score_codex":0.00025077874,"about_ca_topic_score_gemma":0.0012009649,"teacher_disagreement_score":0.94418454,"about_ca_system_score_codex":0.00040239198,"about_ca_system_score_gemma":0.00018302469,"threshold_uncertainty_score":0.9998896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015713245,0.00011463111,0.95446444,0.00006966028,0.0008549171,0.000089254005,1.1984501e-7,0.000058308437,0.02863541],"genre_scores_gemma":[0.9949277,0.0000038662947,0.0035609724,0.00014752052,0.000053251202,0.000005955335,6.148901e-7,0.0000043846144,0.001295706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991668,0.00010714033,0.00025414504,0.00017989795,0.00013829261,0.00015374781],"domain_scores_gemma":[0.99946135,0.00004599784,0.00008204245,0.00026668696,0.00010271148,0.00004119163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003099996,0.00007415874,0.00012835735,0.000047056867,0.00005220425,0.000052441686,0.00020504804,0.00005842051,0.000056665558],"category_scores_gemma":[0.000011499937,0.000060182465,0.000066714136,0.00022957679,0.000014350775,0.00016829747,0.000020772246,0.0000671035,0.000017986684],"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.0000033199603,0.000053780772,0.0003191996,0.000012964364,0.000021833737,0.000007914209,0.0005775433,0.09894784,0.0012430274,0.8924058,0.0033198171,0.0030869483],"study_design_scores_gemma":[0.00017284564,0.000049215276,0.000060341434,0.000014393527,0.0000020635007,0.000015508356,0.00009208453,0.98717934,0.0025575687,0.0006953015,0.009072013,0.000089328656],"about_ca_topic_score_codex":0.000022059448,"about_ca_topic_score_gemma":0.000012204526,"teacher_disagreement_score":0.9792145,"about_ca_system_score_codex":0.000016865315,"about_ca_system_score_gemma":0.000020047082,"threshold_uncertainty_score":0.24541697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004860437,0.00010221172,0.9936659,0.002588199,0.0018467671,0.0005030452,0.000006046428,0.00021523086,0.00058657647],"genre_scores_gemma":[0.9193829,0.00021498838,0.078189306,0.00026938104,0.00023133217,0.00035721515,6.1599474e-7,0.000034025812,0.0013202246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746567,0.0006242327,0.00042673456,0.0005479702,0.000309993,0.00062540866],"domain_scores_gemma":[0.9963285,0.0022284822,0.0001119909,0.0011205596,0.00009854777,0.000111960515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017669938,0.00023967942,0.00025396055,0.00014314865,0.00065664767,0.00019743832,0.0012201599,0.00011263319,0.000022971946],"category_scores_gemma":[0.00003518616,0.00014169194,0.00013947212,0.00084990624,0.00009034578,0.00046373374,0.000016172566,0.000294972,0.00009685601],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011161629,0.00026426816,0.00024193009,0.000009398846,0.00014035485,0.00003506561,0.00043634,0.037093945,0.00021594798,0.04899409,0.0026260326,0.909831],"study_design_scores_gemma":[0.010146974,0.0023685792,0.0044083446,0.0011757734,0.00006692043,0.00047853045,0.00044162126,0.42537364,0.005667954,0.48383987,0.063113555,0.0029182236],"about_ca_topic_score_codex":0.00027198996,"about_ca_topic_score_gemma":0.0007533091,"teacher_disagreement_score":0.91889685,"about_ca_system_score_codex":0.00013436157,"about_ca_system_score_gemma":0.0000738342,"threshold_uncertainty_score":0.57780296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09595822,0.00006244769,0.8783425,0.000039842147,0.00020445941,0.0003280528,2.8006127e-7,0.00003840158,0.02502578],"genre_scores_gemma":[0.90045184,0.0000010124262,0.09900733,0.000059552498,0.00006348623,0.000058851652,0.0000012053176,0.000003658136,0.00035308202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917287,0.00005098355,0.00019883078,0.00018125967,0.0002693861,0.00012666761],"domain_scores_gemma":[0.99932146,0.000043244887,0.000087647204,0.00024148237,0.00028141445,0.000024752062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009177754,0.00006282272,0.00009846676,0.000053581796,0.000067500994,0.00003527109,0.00022806348,0.00003943929,0.000041953997],"category_scores_gemma":[0.000013689436,0.000051925203,0.000059784346,0.00016504474,0.000009396073,0.00018688169,0.000017019594,0.000036163994,0.000008354056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007707982,0.00018076599,0.00078579463,0.00011056088,0.000011502537,5.6584952e-8,0.0004988404,0.95695156,0.0011689245,0.004035082,0.0009658195,0.035283398],"study_design_scores_gemma":[0.0005975405,0.00008706587,0.00006610663,0.000012380207,0.0000060617,9.909592e-7,0.000026705413,0.9932642,0.005712527,0.000017650014,0.00014190993,0.000066887966],"about_ca_topic_score_codex":0.0000050847043,"about_ca_topic_score_gemma":8.641945e-7,"teacher_disagreement_score":0.8044936,"about_ca_system_score_codex":0.00002879662,"about_ca_system_score_gemma":0.000021713167,"threshold_uncertainty_score":0.21174483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040879752,0.00017616949,0.7909182,0.0040992205,0.0018696854,0.000119271834,2.8101817e-7,0.00023459071,0.19849466],"genre_scores_gemma":[0.9762192,0.00003484099,0.000531599,0.0004897108,0.00016803514,0.000010546689,1.3788915e-7,0.0000033776296,0.022542596],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993229,0.000045196055,0.00014527001,0.00015759721,0.0001373923,0.00019163458],"domain_scores_gemma":[0.9993741,0.000086703316,0.00003309277,0.00041272514,0.000049038576,0.00004435964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020217396,0.00006371756,0.00006335594,0.000017271394,0.00025840828,0.0003067126,0.00052080234,0.000029468676,0.000118790136],"category_scores_gemma":[0.000010247963,0.00003505478,0.000046046185,0.00015623898,0.000015218606,0.00016510613,0.00008254297,0.00006494325,0.000350692],"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.0000019209624,0.000033967663,0.00029710997,0.0000023306457,0.000022302182,0.0000074375243,0.0011877702,0.00007547399,0.000085613974,0.35657752,0.41164836,0.23006019],"study_design_scores_gemma":[0.00019251677,0.000052382216,0.00015817111,0.000008119642,0.0000010966212,0.000059401726,0.00020313072,0.721746,0.00029261957,0.0017146635,0.27543598,0.00013587181],"about_ca_topic_score_codex":0.000032104173,"about_ca_topic_score_gemma":0.00012420188,"teacher_disagreement_score":0.9721312,"about_ca_system_score_codex":0.000013116889,"about_ca_system_score_gemma":0.0000036258966,"threshold_uncertainty_score":0.4507553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121695325,0.00027768326,0.945598,0.00039328812,0.002236561,0.00008726117,3.3081565e-7,0.000104479026,0.039132863],"genre_scores_gemma":[0.9976941,0.0000099901035,0.0007615356,0.00010184874,0.00031280244,0.000008049788,3.8754982e-7,0.0000026543498,0.0011086522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991266,0.000067672634,0.0003049483,0.00017736672,0.00013367606,0.0001896998],"domain_scores_gemma":[0.99932426,0.00008706805,0.00010909422,0.00034439287,0.000113006216,0.00002218266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029496851,0.0000807525,0.00010597368,0.000014392807,0.00015908429,0.00013511447,0.0004841092,0.00005084213,0.000006952361],"category_scores_gemma":[0.000008003143,0.00005092926,0.00007945707,0.0003104839,0.000038080223,0.00019807261,0.000077574136,0.00006541992,0.00001174452],"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.000008717399,0.000024897708,0.0019012727,0.0000031036077,0.000010778383,0.0000012541791,0.000023070388,0.063694976,0.000027827553,0.9085378,0.012787678,0.012978612],"study_design_scores_gemma":[0.00015181027,0.00004995841,0.0024092642,0.000019353962,0.0000015719675,0.00003064069,0.00003862847,0.96694136,0.00022884051,0.0069021937,0.023135327,0.00009105242],"about_ca_topic_score_codex":0.00046599272,"about_ca_topic_score_gemma":0.0009492633,"teacher_disagreement_score":0.98552454,"about_ca_system_score_codex":0.000045194414,"about_ca_system_score_gemma":0.000011760891,"threshold_uncertainty_score":0.20768349},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10251174,0.0002807215,0.88900566,0.0011164314,0.00029456042,0.00028307803,0.0000012364453,0.00010287784,0.006403707],"genre_scores_gemma":[0.9887443,0.0000098177825,0.01053015,0.00041521108,0.000057304904,0.000040479303,2.4801452e-7,0.000003277775,0.00019916672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927723,0.000027792832,0.00020614752,0.00019416597,0.000121012396,0.00017366502],"domain_scores_gemma":[0.99958473,0.00004067909,0.000029553823,0.0002166768,0.000057571666,0.00007075602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021518649,0.00007191127,0.00013581188,0.000095020725,0.00011322438,0.00006151387,0.00020215067,0.000030488618,0.000013377875],"category_scores_gemma":[0.0000070013807,0.000056717035,0.00004487987,0.00019218323,0.000017986553,0.00018317193,0.000097720644,0.000041858006,0.00001682251],"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.000005032297,0.000099781646,0.001061916,0.00003321578,0.000057034897,0.0000038272556,0.0035236445,0.00914003,0.014328497,0.8266379,0.0072551714,0.13785389],"study_design_scores_gemma":[0.00032338104,0.00012222545,0.0018469305,0.00009783283,0.00000912762,0.00016789376,0.00066746626,0.94514006,0.0024644588,0.0019707512,0.046849955,0.00033992436],"about_ca_topic_score_codex":0.00013968175,"about_ca_topic_score_gemma":0.00013366394,"teacher_disagreement_score":0.93600005,"about_ca_system_score_codex":0.000012193116,"about_ca_system_score_gemma":0.000011000392,"threshold_uncertainty_score":0.23128536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024655615,0.00003761193,0.95733625,0.00040543248,0.000851584,0.00042753824,5.408136e-7,0.00026829497,0.038207173],"genre_scores_gemma":[0.84937155,0.0000031267118,0.14550754,0.00055819383,0.00017472531,0.00019886906,0.0000020968641,0.000010331754,0.0041735386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990618,0.000040241506,0.00025275844,0.00029611375,0.00012331121,0.00022578075],"domain_scores_gemma":[0.99935645,0.00005305897,0.0000801512,0.00024363783,0.00020865133,0.000058063877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035286872,0.000106635714,0.00013287643,0.000050069844,0.0001485318,0.00021505612,0.00024194761,0.00006537947,0.00004096253],"category_scores_gemma":[0.00003587747,0.000085207415,0.000070256305,0.00018139159,0.0000059592526,0.00040905798,0.000010170265,0.000056190147,0.00005904644],"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.0000075459134,0.00011992782,0.00005772562,0.000100328485,0.000047627393,0.0000015976237,0.00157354,0.0006332593,0.001609839,0.98003733,0.01182862,0.0039826585],"study_design_scores_gemma":[0.00046112892,0.000104928906,0.0000065925897,0.00001831572,0.0000030076199,0.00003419621,0.00011106943,0.78309906,0.009132699,0.001987045,0.20485207,0.00018985603],"about_ca_topic_score_codex":0.000005892541,"about_ca_topic_score_gemma":0.000022536378,"teacher_disagreement_score":0.9780503,"about_ca_system_score_codex":0.000031740812,"about_ca_system_score_gemma":0.00006071871,"threshold_uncertainty_score":0.34746575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1296029,0.000020692236,0.8632105,0.00028344197,0.0012019204,0.00016649583,9.942324e-7,0.00019027042,0.0053227954],"genre_scores_gemma":[0.96209824,7.199646e-7,0.034613542,0.0005796499,0.0003651736,0.0000115536495,0.0000013430223,0.0000090211515,0.0023207418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989356,0.000012319911,0.0002809646,0.00028182584,0.0001384243,0.00035088032],"domain_scores_gemma":[0.99934274,0.00013591356,0.00006170484,0.00029404674,0.0000876921,0.00007788026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008134532,0.000108606866,0.00014160962,0.00006666224,0.00018483153,0.00027948082,0.00042702386,0.000042579486,0.000025015637],"category_scores_gemma":[0.000016273201,0.00008896831,0.00009717019,0.00008561836,0.000013983705,0.00031332206,0.0000956673,0.000075126714,0.000045948327],"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.00012556977,0.00016503686,0.0012947493,0.000105280116,0.000103264974,0.000052989544,0.0030801967,0.0009618254,0.020007843,0.8248482,0.025660798,0.12359427],"study_design_scores_gemma":[0.003411322,0.00084413274,0.006350938,0.00017988941,0.000019261024,0.00082170387,0.000718291,0.4788835,0.21595201,0.12073868,0.1701978,0.0018824778],"about_ca_topic_score_codex":0.00009888905,"about_ca_topic_score_gemma":0.000075564814,"teacher_disagreement_score":0.83249533,"about_ca_system_score_codex":0.000037497797,"about_ca_system_score_gemma":0.00001986584,"threshold_uncertainty_score":0.36280224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017536169,0.00007430215,0.97806466,0.0002061157,0.0012182024,0.0011680379,0.000003090827,0.0006979344,0.0010315065],"genre_scores_gemma":[0.88825333,6.4273235e-7,0.110240124,0.0004662127,0.00022741205,0.00025433954,0.0000019860754,0.000018594781,0.0005373749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980161,0.00015603784,0.00054548815,0.0006246306,0.00026874567,0.0003889632],"domain_scores_gemma":[0.9987489,0.00006245957,0.00009329547,0.0007124248,0.00020600409,0.00017691798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037823143,0.00021232184,0.00033539205,0.00014597185,0.00033760222,0.00019608435,0.0007367918,0.00010908322,0.000018959681],"category_scores_gemma":[0.000017307848,0.00017989991,0.0001340647,0.0003435838,0.000010638889,0.00030883294,0.00014355271,0.00013192071,0.00042271882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008926901,0.00031885653,0.00075019867,0.00080715696,0.00020728714,0.00028870313,0.008328131,0.9406333,0.020587116,0.015424686,0.009433775,0.0031315207],"study_design_scores_gemma":[0.0004105992,0.000040436124,0.000016885506,0.00050264894,0.0000032560163,0.00005774833,0.00020353195,0.99647075,0.0011602794,0.0000046813734,0.0008786989,0.0002504965],"about_ca_topic_score_codex":0.001644128,"about_ca_topic_score_gemma":0.00011586345,"teacher_disagreement_score":0.87071717,"about_ca_system_score_codex":0.00018177691,"about_ca_system_score_gemma":0.00009573651,"threshold_uncertainty_score":0.7336106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007956303,0.00007631805,0.9891473,0.0005716867,0.00042648852,0.00027772645,4.312024e-7,0.000085514745,0.0014582241],"genre_scores_gemma":[0.9952134,0.000020130748,0.002948051,0.00031631917,0.00010481094,0.000049575156,0.0000012508464,0.000005048795,0.0013414458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992239,0.000049149214,0.00020903746,0.00024242222,0.00007003221,0.00020547329],"domain_scores_gemma":[0.9996055,0.000060302707,0.00004944277,0.00016020462,0.00008320627,0.000041363495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029439648,0.000076522454,0.00011421686,0.000063399595,0.00008167372,0.00010709705,0.00013031777,0.00007943314,0.000017692224],"category_scores_gemma":[0.000021240496,0.000068177476,0.000035864297,0.0001792002,0.000009038547,0.0002707079,0.000042237356,0.00006233437,0.0000047522744],"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.0000098248165,0.000053113738,0.00027974576,0.000013610404,0.000010847788,0.0000028531567,0.00039304796,0.0018858247,0.00029219833,0.96767735,0.012425584,0.01695598],"study_design_scores_gemma":[0.0004471968,0.00010169663,0.00020922582,0.000015465235,0.0000012777936,0.000009783759,0.00008083068,0.98762506,0.000055769073,0.009808042,0.0015570535,0.000088620494],"about_ca_topic_score_codex":0.00013082841,"about_ca_topic_score_gemma":0.0007856715,"teacher_disagreement_score":0.98725706,"about_ca_system_score_codex":0.00003434054,"about_ca_system_score_gemma":0.0000027852939,"threshold_uncertainty_score":0.2780197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008625709,0.000013591234,0.9822617,0.0006881199,0.005216491,0.00015146438,0.0000015098518,0.0002412913,0.0028001317],"genre_scores_gemma":[0.8207524,6.727008e-7,0.17549786,0.0005329907,0.0015104319,0.00007072627,0.000008922389,0.000009646126,0.0016163433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988138,0.000030647006,0.00030205125,0.00037620097,0.00015065639,0.00032665627],"domain_scores_gemma":[0.9991799,0.00018322148,0.00007604131,0.0003287238,0.00012284883,0.000109241366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037941523,0.00013877758,0.00015510523,0.000068538095,0.00019056653,0.00016530407,0.0004124318,0.00012669458,0.00010392322],"category_scores_gemma":[0.000053749474,0.0001080869,0.00012209122,0.00013524144,0.000038528506,0.00011899966,0.00009086564,0.0002026403,0.000019221028],"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.00003216068,0.000083621955,0.00035838486,0.000009021665,0.000039338545,0.0000039540114,0.000088749446,0.0029621802,0.004654745,0.94112706,0.0172325,0.033408273],"study_design_scores_gemma":[0.0005822877,0.0002094222,0.0010989027,0.000016285963,0.00000587211,0.00026961396,0.000017067101,0.90972733,0.0026750555,0.01280856,0.0722806,0.00030897968],"about_ca_topic_score_codex":0.000062845575,"about_ca_topic_score_gemma":0.0010787543,"teacher_disagreement_score":0.9283185,"about_ca_system_score_codex":0.000014936228,"about_ca_system_score_gemma":0.00003137059,"threshold_uncertainty_score":0.44076556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5253783,0.00035806396,0.46176222,0.00022597084,0.0004037544,0.00014618076,2.69678e-7,0.00015683983,0.011568382],"genre_scores_gemma":[0.99575144,0.00003465309,0.0034900557,0.00008783691,0.00008328008,0.000008837176,3.1528253e-7,0.0000054102206,0.00053816126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898106,0.000048850692,0.0003403069,0.00025988207,0.00015067753,0.00021920635],"domain_scores_gemma":[0.9993663,0.00012301249,0.0001001504,0.00024739196,0.00008390098,0.00007925617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016799314,0.00010683671,0.00024369007,0.000070411865,0.00010448445,0.00006535411,0.0003098507,0.00007598104,0.000059935726],"category_scores_gemma":[0.00001964016,0.00008734661,0.000037076214,0.00027321104,0.000051599283,0.0002484789,0.000115356066,0.00016137632,0.000009812132],"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.000106854925,0.0010022179,0.17318168,0.00042805157,0.00021807337,0.000013987793,0.012969985,0.052404433,0.00094426144,0.15907684,0.016189886,0.5834637],"study_design_scores_gemma":[0.00033274465,0.00014160972,0.0024652006,0.000039507857,0.0000024389212,0.00001893428,0.00003467253,0.99589014,0.00030642012,0.000026312422,0.00062862335,0.00011341725],"about_ca_topic_score_codex":0.000014509205,"about_ca_topic_score_gemma":0.0000174766,"teacher_disagreement_score":0.9434857,"about_ca_system_score_codex":0.000009756552,"about_ca_system_score_gemma":0.000004220303,"threshold_uncertainty_score":0.35618916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050353106,0.00025548384,0.94800156,0.00028958567,0.00017451525,0.00023726572,3.1755295e-7,0.000030086301,0.0006580645],"genre_scores_gemma":[0.9940947,0.00003027174,0.0037938845,0.00008822332,0.000035604644,0.000038111004,1.3271887e-7,0.000003279469,0.0019157676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993061,0.000054059747,0.00021825197,0.0001751427,0.0001134483,0.00013299797],"domain_scores_gemma":[0.99912184,0.00035162966,0.0000767662,0.00032844875,0.000093860916,0.000027473683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057323946,0.00007240704,0.00018643744,0.00008761397,0.0001083443,0.00007694683,0.00030324125,0.000035451838,0.000041604904],"category_scores_gemma":[0.0000069904368,0.000041371244,0.000082929706,0.00053599244,0.00001693727,0.0001417265,0.000033615644,0.000035241053,0.0000038839785],"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.00019855582,0.0005277795,0.070664674,0.00070466276,0.010547718,0.0000068652953,0.043100372,0.24947917,0.0032374223,0.17686427,0.06946868,0.37519982],"study_design_scores_gemma":[0.0001122332,0.00008958542,0.001650252,0.000008745047,0.000069336784,0.000003980725,0.00007472956,0.99675846,0.00036557045,0.000013384599,0.0007940035,0.00005968882],"about_ca_topic_score_codex":0.000044599263,"about_ca_topic_score_gemma":0.00002728355,"teacher_disagreement_score":0.94420767,"about_ca_system_score_codex":0.000011191059,"about_ca_system_score_gemma":0.000004234469,"threshold_uncertainty_score":0.16870703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010994199,0.0000105409945,0.99123806,0.00020871087,0.006680748,0.00035737795,0.0000026985363,0.00018700531,0.00021544904],"genre_scores_gemma":[0.8924613,0.0000037132265,0.10641962,0.0007454084,0.00019568233,0.000050378807,7.292583e-7,0.00001360916,0.000109526416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830484,0.0002032419,0.0003953758,0.00034460286,0.00024137672,0.00051054877],"domain_scores_gemma":[0.999,0.0002898533,0.00007444749,0.0003652492,0.00006155644,0.00020887771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065546535,0.00018984948,0.00021711703,0.00035773925,0.0001700546,0.00017280046,0.00040317304,0.000089483096,0.000022506527],"category_scores_gemma":[0.000004114948,0.0001983759,0.00008504326,0.00070550287,0.000018925748,0.0005737756,0.000005037048,0.00024001405,0.00026783548],"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.000016284932,0.00021599767,0.000042518117,0.0000052636237,0.000027537088,0.0000123725495,0.0025281156,0.34400687,0.000090115806,0.00055761676,0.001392202,0.6511051],"study_design_scores_gemma":[0.0005191675,0.00026946486,0.00023011085,0.00015822808,0.000008735456,0.00008922928,0.00009904791,0.9944957,0.002892197,0.00004006719,0.00083216524,0.00036587624],"about_ca_topic_score_codex":0.00006445733,"about_ca_topic_score_gemma":0.000015958622,"teacher_disagreement_score":0.8913619,"about_ca_system_score_codex":0.00019587607,"about_ca_system_score_gemma":0.000046338682,"threshold_uncertainty_score":0.8089534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54917586,0.000059347018,0.3820412,0.00005828727,0.0000592919,0.00009022132,3.6400766e-7,0.00007797325,0.06843744],"genre_scores_gemma":[0.9848332,0.0000050021063,0.002588733,0.00015274456,0.000062227155,0.000004178419,0.0000014173588,0.000003849493,0.01234864],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989984,0.00003393211,0.00023434518,0.00030555963,0.0001919512,0.00023583783],"domain_scores_gemma":[0.9993128,0.000095281976,0.00008879796,0.0002966383,0.000115717856,0.00009071968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048027004,0.00013288452,0.00025215102,0.0001824279,0.00011523011,0.00014763701,0.00023463575,0.00004939043,0.00025287084],"category_scores_gemma":[0.000002236283,0.00008965728,0.00004426579,0.00086118485,0.000053630825,0.00032051594,0.000064738735,0.00009737944,0.00007300828],"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.00096007227,0.00048136173,0.65296847,0.0001521998,0.0050059976,0.00010581294,0.032294422,0.08556658,0.00041378278,0.109012015,0.021665614,0.0913737],"study_design_scores_gemma":[0.0007009017,0.0007153094,0.096699506,0.000032142645,0.000070376875,0.000059636644,0.00039348524,0.86671734,0.0013519913,0.000037039998,0.03278593,0.00043636266],"about_ca_topic_score_codex":0.00010823588,"about_ca_topic_score_gemma":0.0009845482,"teacher_disagreement_score":0.78115076,"about_ca_system_score_codex":0.000020328827,"about_ca_system_score_gemma":0.000014162787,"threshold_uncertainty_score":0.3656118},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008589071,0.00009839007,0.62015444,0.0005836571,0.0010703413,0.00005818447,1.2066427e-7,0.00027892398,0.36916688],"genre_scores_gemma":[0.9673693,0.000011313459,0.0064347377,0.00034592926,0.000118414195,0.0000057818347,2.3748281e-7,0.0000032731,0.025710974],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993254,0.000020690059,0.00016454517,0.00018830557,0.00011824542,0.00018281187],"domain_scores_gemma":[0.99946326,0.000021266012,0.000034109104,0.0003783029,0.000038837294,0.00006422265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112869166,0.000051254323,0.00007067783,0.000034552722,0.000055401062,0.00010385832,0.00019407121,0.00002656743,0.00041340932],"category_scores_gemma":[0.000014121077,0.000039755694,0.000039434177,0.00014030444,0.000007925826,0.0002167755,0.000049751772,0.000045322995,0.0004530234],"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.0000015841853,0.00016559515,0.0058746403,0.000012474112,0.000043906417,0.0010036752,0.0027061324,0.00035043107,0.00033414565,0.3977131,0.4407363,0.15105803],"study_design_scores_gemma":[0.00015797422,0.00004973633,0.0008487794,0.000010103023,0.0000012476833,0.0012305423,0.00008312901,0.4730754,0.000116425545,0.00077433046,0.5234766,0.00017576349],"about_ca_topic_score_codex":0.000073165276,"about_ca_topic_score_gemma":0.0000151438,"teacher_disagreement_score":0.9587803,"about_ca_system_score_codex":0.000018982904,"about_ca_system_score_gemma":0.0000045902916,"threshold_uncertainty_score":0.582285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003761582,0.00012703316,0.9969528,0.00055097154,0.00024013664,0.0003399416,0.0000040378654,0.00019669217,0.0012122672],"genre_scores_gemma":[0.6942731,0.000009771371,0.30442578,0.00033704613,0.0001379629,0.000093451454,0.000023959823,0.000010798737,0.00068809267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904305,0.00006803169,0.0002443936,0.00025754303,0.000119632554,0.00026737942],"domain_scores_gemma":[0.99885166,0.00018585252,0.00010684025,0.0005980549,0.00019188882,0.000065716275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026731344,0.00012004391,0.00014821389,0.000031295865,0.0002789705,0.00023084844,0.0006046535,0.000072618466,0.000030005565],"category_scores_gemma":[0.000007876996,0.00009285519,0.000053280535,0.0003010168,0.000012368559,0.00033481492,0.000102722384,0.00010771726,0.000014317261],"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.000015024857,0.00026497504,0.0004158306,0.00002289198,0.00013957403,0.0000074629306,0.0020117008,0.095186375,0.000016589629,0.026293073,0.023881238,0.85174525],"study_design_scores_gemma":[0.0005361135,0.00006560484,0.000066957204,0.000041259173,0.000004715368,0.000025308944,0.00008773583,0.9913059,0.0000177012,0.00003560652,0.007668694,0.00014442243],"about_ca_topic_score_codex":0.0001333203,"about_ca_topic_score_gemma":0.000312722,"teacher_disagreement_score":0.8961195,"about_ca_system_score_codex":0.00004028487,"about_ca_system_score_gemma":0.0000053481067,"threshold_uncertainty_score":0.37865248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22553124,0.000012591019,0.76376957,0.000337163,0.0014032985,0.00019638898,2.0644e-7,0.00012762811,0.008621919],"genre_scores_gemma":[0.9689549,0.000001904284,0.029139869,0.0007909243,0.00019729244,0.000011843569,3.2827705e-7,0.000008003745,0.0008949418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998958,0.00007640734,0.00015523532,0.00030121315,0.00019118904,0.00031795708],"domain_scores_gemma":[0.9991513,0.00021636888,0.000029667817,0.0004130845,0.00007783054,0.00011178759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072416256,0.00011615682,0.00011658463,0.000059474773,0.00019712505,0.00020186442,0.00034896864,0.000079638136,0.00014419602],"category_scores_gemma":[0.000013011137,0.00008645442,0.00003264632,0.00018898204,0.00003932914,0.00020748033,0.00007407781,0.00027433797,0.00008997588],"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.00043699754,0.00054546574,0.100651056,0.00012618076,0.00013365789,0.00008891886,0.0033405724,0.22915342,0.0067819487,0.40394342,0.100368395,0.15442996],"study_design_scores_gemma":[0.00026677016,0.00022797864,0.006580886,0.000018788542,8.052095e-7,0.000017389388,0.000008548094,0.98968196,0.00085586775,0.000053415635,0.0021547736,0.0001328132],"about_ca_topic_score_codex":0.000013808696,"about_ca_topic_score_gemma":0.000011824501,"teacher_disagreement_score":0.76052856,"about_ca_system_score_codex":0.000008619374,"about_ca_system_score_gemma":0.000035241654,"threshold_uncertainty_score":0.3525509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013828475,0.00023928525,0.9738992,0.0007020184,0.00043529127,0.00042501878,0.0000011725165,0.0000998878,0.02281532],"genre_scores_gemma":[0.9879053,0.000017428561,0.008493582,0.00064437353,0.00014128633,0.000086056374,0.0000021118876,0.0000056002677,0.0027042234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990873,0.000063982414,0.00023935003,0.00027709245,0.00010283126,0.00022944045],"domain_scores_gemma":[0.99948657,0.000100728095,0.000051118186,0.00024352006,0.00007063949,0.00004742502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039210572,0.000092033835,0.00015877967,0.00007436434,0.00004983859,0.00012296431,0.00024244373,0.00007423832,0.000026734851],"category_scores_gemma":[0.000017246224,0.000074918455,0.00005628987,0.0001867157,0.000011368228,0.00025455173,0.00001865581,0.00007133644,0.000033473843],"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.00007722586,0.0006332095,0.011071007,0.00012409496,0.00008445976,0.000015334796,0.003503346,0.010324726,0.000719777,0.57259476,0.06295256,0.3378995],"study_design_scores_gemma":[0.00080347917,0.00007399496,0.0006160847,0.000009255154,0.0000015590298,0.0000134517095,0.000045047378,0.9795691,0.000037664064,0.0004649776,0.018252324,0.00011309923],"about_ca_topic_score_codex":0.000032251726,"about_ca_topic_score_gemma":0.000033720284,"teacher_disagreement_score":0.9865225,"about_ca_system_score_codex":0.000033072625,"about_ca_system_score_gemma":0.000004833253,"threshold_uncertainty_score":0.3055086},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14443502,0.000033123903,0.8345836,0.000088448425,0.0005049429,0.000057966605,4.3437396e-8,0.000109009816,0.020187862],"genre_scores_gemma":[0.9916933,9.620665e-7,0.0077958754,0.00023027636,0.00007320542,0.0000037035713,3.9259774e-7,0.000003108632,0.000199167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923253,0.000029095221,0.00026840175,0.00017353472,0.000097994736,0.00019844717],"domain_scores_gemma":[0.99966145,0.000044311717,0.00005565077,0.00016240131,0.00003405585,0.00004214231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006486215,0.00005902768,0.00007729403,0.000116810974,0.00006896959,0.00008206747,0.00018737004,0.000038020673,0.000018771538],"category_scores_gemma":[0.00000922968,0.000052157247,0.000033340228,0.00036870886,0.000009310235,0.00022797952,0.000049567145,0.00007327691,0.000035709712],"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.00000903403,0.000103537466,0.09156648,0.00001650266,0.000016772565,0.00035608755,0.0015392911,0.021199614,0.0013529939,0.8462849,0.000691251,0.036863506],"study_design_scores_gemma":[0.0010894489,0.00034265744,0.023279745,0.00022769881,0.0000029940481,0.00047153689,0.00042838216,0.8731687,0.012454894,0.08491062,0.002692854,0.0009304867],"about_ca_topic_score_codex":0.00015671419,"about_ca_topic_score_gemma":0.0009413647,"teacher_disagreement_score":0.85196906,"about_ca_system_score_codex":0.000024244395,"about_ca_system_score_gemma":0.000009106643,"threshold_uncertainty_score":0.21269108},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075483195,0.00047834983,0.80553395,0.002609679,0.00085198984,0.0001980329,2.9430433e-7,0.00012790207,0.11471661],"genre_scores_gemma":[0.9840783,0.00003196497,0.002994744,0.00040132354,0.000058197045,0.000014099704,5.9544067e-8,0.0000024937642,0.012418817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938667,0.000027304066,0.00014176265,0.00018935355,0.00010742931,0.00014748448],"domain_scores_gemma":[0.99968994,0.000013892421,0.000017796285,0.00024114319,0.0000052721757,0.000031982087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009116546,0.000055334145,0.00007646592,0.00003449805,0.000028454671,0.00004738664,0.00022921848,0.000029608838,0.000496862],"category_scores_gemma":[0.000001023073,0.0000451487,0.000027027512,0.00009356326,0.000008752357,0.00016687646,0.00005068536,0.00005661833,0.00065459486],"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.0000144128535,0.0012460176,0.023031149,0.000059243783,0.0000357725,0.000164917,0.016306996,0.18512686,0.0027478887,0.19278777,0.2508522,0.32762676],"study_design_scores_gemma":[0.00017204866,0.000022860151,0.0007980085,0.000012795859,2.123954e-7,0.000011529194,0.000020034393,0.91808224,0.00018860429,0.0001283893,0.08047582,0.00008744308],"about_ca_topic_score_codex":0.000049136226,"about_ca_topic_score_gemma":0.00006854539,"teacher_disagreement_score":0.9085951,"about_ca_system_score_codex":0.000032901844,"about_ca_system_score_gemma":0.0000011658208,"threshold_uncertainty_score":0.8413711},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070119333,0.000023824297,0.84587175,0.00051750574,0.0013756488,0.000094039606,1.4219195e-7,0.0001919511,0.14491321],"genre_scores_gemma":[0.97267747,7.9359967e-7,0.021376453,0.0013474418,0.0003294629,0.000004519838,8.569972e-7,0.0000064207075,0.0042565996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894214,0.0000145049735,0.0002752782,0.00029708067,0.00015104437,0.00031997391],"domain_scores_gemma":[0.9992453,0.00010692914,0.00004806218,0.00042313532,0.00009164604,0.00008494274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011650113,0.000094373165,0.00012583107,0.000108558015,0.0001336339,0.00018752439,0.00041039713,0.00005708411,0.00025393555],"category_scores_gemma":[0.000025025138,0.0000750042,0.000058018988,0.0002849786,0.000010795704,0.00036978943,0.000024696823,0.000111091074,0.0002043256],"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.00007000225,0.00016453011,0.0008960091,0.000051007868,0.00006178414,0.00008459992,0.0020457665,0.019406669,0.0092289075,0.60035634,0.06901568,0.2986187],"study_design_scores_gemma":[0.00077171554,0.00018371023,0.0003018598,0.000062013925,0.0000026362,0.000077258235,0.00020921926,0.8335621,0.04057779,0.00079863064,0.12306268,0.00039039948],"about_ca_topic_score_codex":0.00021165988,"about_ca_topic_score_gemma":0.0002244469,"teacher_disagreement_score":0.9656655,"about_ca_system_score_codex":0.00005697262,"about_ca_system_score_gemma":0.000038927377,"threshold_uncertainty_score":0.30585825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059413664,0.000025946554,0.9305309,0.00027229753,0.0028742792,0.00068425,0.000004388236,0.000265416,0.0059288274],"genre_scores_gemma":[0.90590316,5.431047e-7,0.0907995,0.0011632357,0.0017920524,0.00003292178,0.0000028127636,0.000019473171,0.00028627302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975341,0.000049275706,0.00060484896,0.0006473678,0.00021177289,0.0009526678],"domain_scores_gemma":[0.99828935,0.00079535774,0.00016752555,0.0004094961,0.00015808817,0.00018021453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00204399,0.00025009096,0.0003327372,0.0000797636,0.0004205852,0.0003653922,0.00066713383,0.00009603103,0.0000071437535],"category_scores_gemma":[0.00015202854,0.00022021157,0.00031095208,0.00025425243,0.000034292065,0.0003066451,0.00020142022,0.00017643157,0.0000074060213],"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.00014500579,0.000047206475,0.00055807905,0.000030822895,0.000057250276,0.00000968135,0.00015799914,0.005268766,0.00008219289,0.95925236,0.0028749297,0.03151571],"study_design_scores_gemma":[0.000884551,0.00039523587,0.00013773619,0.00015491541,0.000009646034,0.00014865128,0.00004035478,0.9688572,0.00058452925,0.020109251,0.008334807,0.00034308294],"about_ca_topic_score_codex":0.00006784579,"about_ca_topic_score_gemma":0.00009402092,"teacher_disagreement_score":0.9635885,"about_ca_system_score_codex":0.0002187801,"about_ca_system_score_gemma":0.000054867858,"threshold_uncertainty_score":0.8979967},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006696345,0.0002556626,0.98656094,0.000025047384,0.00476573,0.0011213677,0.000033784025,0.00030095523,0.0002401428],"genre_scores_gemma":[0.9929859,0.000082248334,0.0064230547,0.00004902663,0.00011339266,0.000076111595,0.000002048166,0.00004761118,0.00022057866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513656,0.0010948075,0.0016912083,0.0008253512,0.0006852233,0.0005668451],"domain_scores_gemma":[0.9963878,0.00085013825,0.00073355064,0.00092185393,0.0008625304,0.00024413962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017671462,0.00055621186,0.0011338507,0.0007207503,0.0003173527,0.00034313486,0.00088917575,0.00035731803,0.000010854602],"category_scores_gemma":[0.00001248476,0.00046661426,0.00024833455,0.0011927448,0.000084648316,0.0005603228,0.00000829254,0.00048741524,0.000017573262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014738964,0.0006684073,0.00002900361,0.00061229186,0.0006505922,0.0001244262,0.002573846,0.8884587,0.028229987,0.010186392,0.0011503084,0.067168646],"study_design_scores_gemma":[0.0010000796,0.0012666197,0.000021165612,0.0020866683,0.000046357596,0.00076843397,0.0006949041,0.9847641,0.008660747,0.00005751556,0.0001303792,0.00050306],"about_ca_topic_score_codex":0.00043305254,"about_ca_topic_score_gemma":0.0000072231564,"teacher_disagreement_score":0.98628956,"about_ca_system_score_codex":0.00021364495,"about_ca_system_score_gemma":0.00021530806,"threshold_uncertainty_score":0.99977857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55088216,0.000014169963,0.44387498,0.000069869064,0.00019776355,0.0008586037,9.9067414e-8,0.00019952298,0.0039028008],"genre_scores_gemma":[0.9847331,1.3339961e-7,0.014516958,0.0003950838,0.00020584326,0.000023380968,2.0492044e-7,0.0000067896467,0.00011852869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986693,0.0001291773,0.00028046023,0.0004480219,0.0002034552,0.00026958148],"domain_scores_gemma":[0.9992591,0.000017417502,0.00008987948,0.00042238,0.00012051907,0.00009066679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017928,0.00014761217,0.00015973498,0.000117383046,0.0003763595,0.0006385273,0.0003112083,0.000040556737,0.000014636585],"category_scores_gemma":[0.00000968114,0.0001177297,0.00004009044,0.00035203053,0.000009976782,0.0010532929,0.00004295295,0.00013478062,0.000008304348],"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.00010060378,0.005772443,0.0011289391,0.0001052901,0.000065996304,0.01510101,0.051019344,0.010599837,0.0050630965,0.012367566,0.0007281554,0.8979477],"study_design_scores_gemma":[0.00035553635,0.0012101011,0.0001268222,0.00009292689,0.0000047429594,0.0025671816,0.00328803,0.9914669,0.00028518122,0.00022683872,0.00012801729,0.00024772424],"about_ca_topic_score_codex":0.0002491038,"about_ca_topic_score_gemma":0.0000898557,"teacher_disagreement_score":0.9808671,"about_ca_system_score_codex":0.000059823265,"about_ca_system_score_gemma":0.000045729077,"threshold_uncertainty_score":0.6157333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014595563,0.00011434535,0.98311037,0.00030078462,0.00007691542,0.00042953235,0.0000037645304,0.00004324967,0.0013254894],"genre_scores_gemma":[0.9673419,0.000014867973,0.03140636,0.000100431025,0.000017171345,0.000021343974,0.0000014331698,0.000006418872,0.001090089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989871,0.00007028884,0.00027154924,0.00029614262,0.00017634344,0.0001985939],"domain_scores_gemma":[0.9990678,0.0003182009,0.00008217395,0.0003590825,0.00008718405,0.00008558836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133261,0.00011906089,0.00029589792,0.00008996869,0.00008816995,0.00008391711,0.00030078838,0.00004467193,0.00007960697],"category_scores_gemma":[0.00001152116,0.000061566854,0.00013649746,0.0006118877,0.00009998973,0.000109177985,0.000029516485,0.00007434634,0.0000010498404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030400313,0.0003204911,0.0030264885,0.00007132329,0.005068479,0.0000053443036,0.026701072,0.5104141,0.00022186128,0.3919156,0.006044444,0.055906776],"study_design_scores_gemma":[0.0008077825,0.0001241875,0.0010604595,0.000008902922,0.00019978537,0.0000060698785,0.0002453151,0.9971164,0.000048044873,0.00005781178,0.0002259741,0.00009925386],"about_ca_topic_score_codex":0.00014352548,"about_ca_topic_score_gemma":0.00006150695,"teacher_disagreement_score":0.95274633,"about_ca_system_score_codex":0.0000106119205,"about_ca_system_score_gemma":0.00000769386,"threshold_uncertainty_score":0.25106236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5485335,0.0001145774,0.44113317,0.0006513916,0.00022714364,0.00009426582,0.0000016877743,0.00011324617,0.009131014],"genre_scores_gemma":[0.99607736,0.0000069494317,0.002022319,0.00068066036,0.000027341224,0.0000021066598,0.0000012079271,0.0000034284485,0.0011786369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879813,0.000043080174,0.0003983783,0.00034687918,0.00019326864,0.00022026293],"domain_scores_gemma":[0.9990878,0.000060000835,0.00012753616,0.0004858089,0.000153628,0.00008520957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004046997,0.00013158574,0.00036726988,0.00027730307,0.00009818723,0.00024312412,0.00034870327,0.000082719074,0.00010665802],"category_scores_gemma":[0.000025144938,0.00010374431,0.00016220607,0.0010569615,0.00004901218,0.00034151718,0.0000735054,0.00007907179,0.000007950558],"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.00017711056,0.00080767437,0.06295233,0.000060877304,0.0032277007,0.000062177016,0.017163001,0.010999908,0.06868924,0.78268987,0.014108017,0.039062064],"study_design_scores_gemma":[0.001252738,0.00081343006,0.28303862,0.000059594757,0.00020170321,0.00004612168,0.00027807688,0.6870775,0.015752815,0.0058112275,0.0048250663,0.0008430814],"about_ca_topic_score_codex":0.000114500726,"about_ca_topic_score_gemma":0.00006859134,"teacher_disagreement_score":0.77687865,"about_ca_system_score_codex":0.000019017838,"about_ca_system_score_gemma":0.00002236382,"threshold_uncertainty_score":0.42305702},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40336055,0.000039130373,0.5954423,0.00014945217,0.00044179976,0.00010482297,2.9892436e-7,0.00009514463,0.0003665063],"genre_scores_gemma":[0.99677944,0.000007407229,0.0026981893,0.0002899716,0.00009211328,0.000017094932,0.000005320076,0.000005530734,0.000104932944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984328,0.00015852464,0.0005467565,0.00036765749,0.00016557485,0.00032868917],"domain_scores_gemma":[0.99905616,0.00006586953,0.00016357984,0.00056591735,0.000080150356,0.000068336376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041240366,0.00015531796,0.0004621343,0.0002564998,0.00005822563,0.00010716115,0.0006175582,0.00012740259,0.0000275725],"category_scores_gemma":[0.000008048356,0.00011377933,0.00013149947,0.0017142803,0.00004331573,0.000255072,0.0001072182,0.00014254932,0.0000020685934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012168756,0.00008276206,0.019508459,0.000001956072,0.0001332737,0.0000062603535,0.000539972,0.89490056,0.00001147314,0.084397234,0.000069222035,0.00033667695],"study_design_scores_gemma":[0.0002922314,0.00019186948,0.052334484,0.000026338494,0.000037323876,0.0000028822017,0.00020553442,0.9452295,0.000086770124,0.0014363833,0.000010090923,0.0001466203],"about_ca_topic_score_codex":0.0012594761,"about_ca_topic_score_gemma":0.00999994,"teacher_disagreement_score":0.5934189,"about_ca_system_score_codex":0.000094930576,"about_ca_system_score_gemma":0.000024194509,"threshold_uncertainty_score":0.5580202},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44417858,0.0000836795,0.5529207,0.0012509739,0.0005878907,0.00006389557,2.3231097e-7,0.000012095237,0.00090196275],"genre_scores_gemma":[0.99763185,0.000033307886,0.0015596977,0.00057126966,0.00016314487,2.1138514e-7,1.8936632e-7,0.000005612051,0.00003474303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861234,0.00038402015,0.0005071384,0.00007145405,0.00028443808,0.00014061658],"domain_scores_gemma":[0.9986424,0.00071903656,0.00022880618,0.00024715927,0.0001340109,0.000028589435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015694449,0.00008670181,0.00016901088,0.00006272221,0.00019009355,0.000065389024,0.00087652885,0.00003070635,0.000041590396],"category_scores_gemma":[0.000026599382,0.00004405622,0.00010187496,0.00024258083,0.000046182344,0.0001952187,0.000049844613,0.0002123986,0.000010753162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007293575,0.00009950188,0.00012617205,0.000018270748,0.00011728996,0.000013778774,0.011424422,0.8392566,0.00044029002,0.067925446,0.0044272933,0.07607799],"study_design_scores_gemma":[0.00026778592,0.00022894233,0.00057369645,0.0002398945,0.000009753807,0.00033808022,0.00028108165,0.99467134,0.00008182042,0.002720341,0.0005111796,0.00007608586],"about_ca_topic_score_codex":0.000021147984,"about_ca_topic_score_gemma":0.0000028834509,"teacher_disagreement_score":0.55345327,"about_ca_system_score_codex":0.000028565144,"about_ca_system_score_gemma":0.000027348118,"threshold_uncertainty_score":0.17965606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111624695,0.000029732757,0.7919024,0.0005038374,0.00072137825,0.00017588447,7.3824106e-7,0.000109292545,0.09493203],"genre_scores_gemma":[0.994902,0.000007895629,0.0030512505,0.00015300383,0.000056575,0.000011058286,0.0000010218065,0.0000032110038,0.0018139875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926406,0.000043129756,0.00026264112,0.00015998953,0.00012463886,0.0001455228],"domain_scores_gemma":[0.9995355,0.000030935145,0.000091215516,0.00023848371,0.00006877248,0.000035078257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020208216,0.000059934526,0.000117715994,0.00005986413,0.00008385384,0.000026435428,0.00023475244,0.00002726342,0.00044549612],"category_scores_gemma":[0.000003421327,0.00004951666,0.000050356946,0.00019928592,0.000012333571,0.00032013058,0.000013016142,0.000039126506,0.00004751109],"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.000029745923,0.00024117019,0.022430858,0.00010879133,0.00020721096,0.000039518764,0.0219633,0.0012238628,0.04187451,0.74068695,0.13408144,0.037112623],"study_design_scores_gemma":[0.0050827228,0.0015613926,0.052765504,0.00014830122,0.000028366665,0.000646138,0.0042148684,0.051991675,0.761806,0.022100335,0.098114744,0.0015399302],"about_ca_topic_score_codex":0.00077373965,"about_ca_topic_score_gemma":0.00017040399,"teacher_disagreement_score":0.8832773,"about_ca_system_score_codex":0.000018875555,"about_ca_system_score_gemma":0.00004248915,"threshold_uncertainty_score":0.487787},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043683,0.000048541522,0.9544337,0.0008677269,0.00036198934,0.0001696135,0.0000033253978,0.000075705066,0.0003564359],"genre_scores_gemma":[0.97795105,0.0000070366737,0.020381302,0.0004412651,0.00022519687,0.00003030561,0.000012288515,0.0000037051523,0.00094782736],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945307,0.000022291557,0.00012000696,0.0001985846,0.00006742774,0.00013864244],"domain_scores_gemma":[0.9996815,0.000036778434,0.000028956694,0.00015367953,0.000050734045,0.000048404523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090237976,0.00006608038,0.000086590306,0.000031076117,0.00018944385,0.00013048087,0.00012190401,0.000038115868,0.0000057516772],"category_scores_gemma":[0.000010427712,0.000051006384,0.00003341087,0.00009940377,0.00001622257,0.00022589714,0.00003530959,0.00003635021,0.0000038024984],"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.000056481724,0.00016236429,0.0022949858,0.0000856057,0.00013930145,0.000030473557,0.0052790507,0.030105311,0.028099177,0.3066148,0.54258335,0.08454909],"study_design_scores_gemma":[0.00030348403,0.00008772057,0.00023260631,0.000006387491,0.0000016589537,0.00014220092,0.000016737898,0.9639032,0.0010818284,0.0004824539,0.033628203,0.00011353666],"about_ca_topic_score_codex":0.00004268271,"about_ca_topic_score_gemma":0.000045437777,"teacher_disagreement_score":0.93426806,"about_ca_system_score_codex":0.000014707702,"about_ca_system_score_gemma":0.000013654909,"threshold_uncertainty_score":0.207998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011924721,0.000042745763,0.96556497,0.0015941509,0.0012385715,0.00008639767,3.2369923e-7,0.00028903983,0.019259103],"genre_scores_gemma":[0.9749749,0.000001265769,0.023323786,0.00094107067,0.0001789214,0.0000054025963,5.8823525e-7,0.0000053427475,0.00056876394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924976,0.000028011695,0.00015516045,0.0002510654,0.00012224875,0.00019375367],"domain_scores_gemma":[0.9994588,0.000022052705,0.00003428513,0.00038135168,0.000038877744,0.000064665444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101783764,0.00010025547,0.00010899908,0.000074282885,0.00007174358,0.00014511416,0.0005283257,0.000052373918,0.00007547673],"category_scores_gemma":[0.000012890816,0.00007232635,0.00007262998,0.00019977838,0.000015261954,0.00018312012,0.00009979096,0.00012330193,0.00009021372],"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.0000035597882,0.000015369693,0.000025568463,0.000005440697,0.000019427524,0.000016800637,0.0011413872,0.008936677,0.0010521584,0.9503492,0.0010676065,0.037366815],"study_design_scores_gemma":[0.0037055155,0.000835493,0.001616756,0.00020147767,0.000011744175,0.0019225928,0.0004689693,0.033568658,0.040646505,0.749866,0.1655604,0.0015959154],"about_ca_topic_score_codex":0.000077079436,"about_ca_topic_score_gemma":0.00017916237,"teacher_disagreement_score":0.9630501,"about_ca_system_score_codex":0.00004130429,"about_ca_system_score_gemma":0.000026884893,"threshold_uncertainty_score":0.2949383},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038609237,0.000045918783,0.99045295,0.00015743017,0.0014462747,0.0001897754,8.96742e-7,0.00021571467,0.0036301054],"genre_scores_gemma":[0.9067265,0.000003299724,0.08994668,0.00019887075,0.0003662028,0.000042540756,0.0000010545742,0.000008550846,0.0027063247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.00004687052,0.00015631836,0.00029155874,0.00016202265,0.00025269605],"domain_scores_gemma":[0.9993997,0.000050614075,0.000025082243,0.00029959055,0.00014055976,0.00008440303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003435451,0.00007572596,0.00008834073,0.00012027549,0.00027292647,0.00025137622,0.0003234973,0.000042281692,0.00009440526],"category_scores_gemma":[0.000004059328,0.000063217856,0.00007079636,0.00033467877,0.000013760315,0.0001812076,0.000032564454,0.00006646803,0.000045781868],"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.0000031658778,0.0003794524,0.00014772131,0.000017849623,0.000044309243,0.000007230918,0.002984201,0.10317765,0.00046534496,0.13907778,0.020690368,0.7330049],"study_design_scores_gemma":[0.00017265962,0.00015187828,0.00003535897,0.0000061110736,9.719578e-7,0.000021631568,0.00008408044,0.99499565,0.0004159126,0.000107130334,0.003914182,0.00009445206],"about_ca_topic_score_codex":0.00006278777,"about_ca_topic_score_gemma":0.000011214849,"teacher_disagreement_score":0.9028655,"about_ca_system_score_codex":0.000025288988,"about_ca_system_score_gemma":0.000005635082,"threshold_uncertainty_score":0.25779495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80674595,0.00002374517,0.16550004,0.00022676725,0.0005631427,0.00008969641,1.9678508e-7,0.00020328672,0.026647171],"genre_scores_gemma":[0.9969297,0.000013709553,0.0011851606,0.0002120059,0.000099492885,0.0000038298303,2.110111e-7,0.000006206991,0.0015496523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990748,0.00002465706,0.00028901894,0.00020292569,0.00018286012,0.00022570627],"domain_scores_gemma":[0.9994327,0.000041811723,0.00009675975,0.00031209682,0.00007282887,0.00004382092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002114282,0.00009897456,0.00014320725,0.000052825417,0.00008959331,0.000057154113,0.0003861171,0.00005208198,0.00016599378],"category_scores_gemma":[0.0000019989266,0.00007812858,0.00006293262,0.00022976061,0.000010653018,0.00032472052,0.000070407055,0.00008832738,0.00013498196],"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.000011949572,0.0010206422,0.042772997,0.0003839766,0.0003382308,0.000024057534,0.023646684,0.08141423,0.00071925233,0.05339406,0.01610494,0.78016895],"study_design_scores_gemma":[0.000167589,0.00010012983,0.0012378064,0.000031456544,0.0000021916587,0.000028893266,0.00009533775,0.99737006,0.00024361428,0.000005194545,0.000608317,0.00010941731],"about_ca_topic_score_codex":0.000024697461,"about_ca_topic_score_gemma":0.0000221917,"teacher_disagreement_score":0.91595584,"about_ca_system_score_codex":0.00003389325,"about_ca_system_score_gemma":0.000007647166,"threshold_uncertainty_score":0.3185991},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03318556,0.00014992472,0.96002805,0.0029238025,0.00089616055,0.0002668578,0.00006659327,0.00024225037,0.0022408154],"genre_scores_gemma":[0.9889393,0.0000028809968,0.008219608,0.0004305089,0.00021988733,0.00007195968,0.00014568285,0.000016081865,0.0019540763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979826,0.00007071461,0.00049006497,0.0006518387,0.000448216,0.0003565625],"domain_scores_gemma":[0.99898463,0.00008255062,0.00025153928,0.00022570309,0.0003467124,0.000108836386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002583281,0.00028632043,0.00024454264,0.00019360284,0.0005677105,0.0005073683,0.0005371748,0.00012677489,0.0000106853995],"category_scores_gemma":[0.000029089944,0.0002532466,0.000106812506,0.0003212507,0.00009726654,0.00019438368,0.00014307816,0.00019019352,0.000015067176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001286384,0.00087731704,0.0023104926,0.000038085636,0.000044698085,0.000031158514,0.0003846121,0.98720586,0.0004654544,0.0039544394,0.0038009458,0.0007583088],"study_design_scores_gemma":[0.0019941078,0.000119095166,0.003763068,0.00014929254,0.000008372876,0.000033922617,0.000058759382,0.9885185,0.00016382495,0.00010766978,0.0047663334,0.00031707197],"about_ca_topic_score_codex":0.0001491937,"about_ca_topic_score_gemma":0.000038332764,"teacher_disagreement_score":0.95575374,"about_ca_system_score_codex":0.00017818059,"about_ca_system_score_gemma":0.0001228991,"threshold_uncertainty_score":0.99999195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45453438,0.000005119288,0.5419689,0.00029042285,0.00021096265,0.00016173202,4.4345438e-8,0.000040660165,0.0027877793],"genre_scores_gemma":[0.9975997,2.4431807e-7,0.0006312585,0.00023516976,0.000037071506,0.000023938863,4.6163724e-8,0.000001945205,0.0014705841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994082,0.000053185126,0.00015400199,0.00018522645,0.00008972417,0.00010967845],"domain_scores_gemma":[0.9996751,0.000024444136,0.000014446684,0.00021153505,0.000029004515,0.000045451932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015896701,0.000051860225,0.00007177973,0.00007437909,0.000037852966,0.00008516675,0.00013053855,0.000020004469,0.00006950624],"category_scores_gemma":[0.0000053168314,0.000041549974,0.000017190858,0.00031111084,0.0000030776362,0.00015488692,0.000045057048,0.000042506643,0.0001323811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00002379937,0.003833632,0.0859004,0.00002100662,0.00007047247,0.03488404,0.15993422,0.08105994,0.0001239695,0.045560334,0.18408178,0.4045064],"study_design_scores_gemma":[0.0001876212,0.00022916378,0.00028644342,0.000005376377,5.517937e-7,0.0010096707,0.0030797932,0.9936223,0.000014127712,0.000018963332,0.0014693119,0.00007664637],"about_ca_topic_score_codex":0.0020432745,"about_ca_topic_score_gemma":0.025137857,"teacher_disagreement_score":0.9125624,"about_ca_system_score_codex":0.00003679192,"about_ca_system_score_gemma":0.0000028247637,"threshold_uncertainty_score":0.99265087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10193385,0.000009276696,0.8735285,0.00052809244,0.00082480116,0.00059787044,0.0000027906942,0.000062193205,0.022512613],"genre_scores_gemma":[0.9928273,0.0000036135198,0.0047896253,0.0008946324,0.00008446765,0.000059578597,0.0000052012183,0.000005343165,0.0013302219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990712,0.000051189236,0.00034574847,0.00019448303,0.00011804385,0.00021935425],"domain_scores_gemma":[0.99949855,0.000098347075,0.00009523463,0.00020594573,0.00007112957,0.000030773223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040399897,0.00007803045,0.0001601065,0.000071342096,0.000048593047,0.000025642013,0.0001936559,0.000035035147,0.00012441401],"category_scores_gemma":[0.0000043714354,0.00006608432,0.000063737694,0.00017423207,0.0000110501505,0.00021325506,0.000023668645,0.000044680226,0.000012039171],"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.00007498411,0.0001475035,0.01462276,0.00004120536,0.000055561468,0.000019363812,0.006745352,0.022822596,0.0005239016,0.74441046,0.2020338,0.008502508],"study_design_scores_gemma":[0.012562878,0.0045660613,0.046093006,0.00021504222,0.00001735611,0.00034119395,0.0024729762,0.8049286,0.034851443,0.015713125,0.07678888,0.0014494405],"about_ca_topic_score_codex":0.00023294051,"about_ca_topic_score_gemma":0.00045457858,"teacher_disagreement_score":0.89089346,"about_ca_system_score_codex":0.000022369724,"about_ca_system_score_gemma":0.000058438796,"threshold_uncertainty_score":0.26948404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05141918,0.00012317166,0.93700707,0.000107349915,0.008030517,0.0005485161,0.000018678249,0.00020717918,0.0025383537],"genre_scores_gemma":[0.9977275,0.000015864242,0.0010644406,0.00007273784,0.00024546878,0.00007051749,0.0000034147342,0.000016198874,0.0007838591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967904,0.00039243436,0.0012300144,0.0005559278,0.00045879703,0.00057242915],"domain_scores_gemma":[0.9981278,0.00042819357,0.00028758709,0.00077087176,0.00027874715,0.00010679139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026658273,0.00027664506,0.00051810313,0.00035531394,0.00022099538,0.00013994536,0.0005473194,0.0002915253,0.000037921993],"category_scores_gemma":[0.000019932322,0.00024191839,0.00024560606,0.0010262233,0.000077955665,0.00066376204,0.000005618463,0.00045861758,0.000041870055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005423033,0.002092789,0.0046999427,0.00032103487,0.00021582106,0.000052791365,0.0106373215,0.84981614,0.003414098,0.09193305,0.0027554582,0.03351922],"study_design_scores_gemma":[0.0023374285,0.0010206397,0.0038926823,0.00126093,0.00003871283,0.00015741025,0.009546399,0.9400577,0.03174641,0.0013817133,0.007397101,0.0011628487],"about_ca_topic_score_codex":0.0007719161,"about_ca_topic_score_gemma":0.006177667,"teacher_disagreement_score":0.9463083,"about_ca_system_score_codex":0.0002951553,"about_ca_system_score_gemma":0.00006929515,"threshold_uncertainty_score":0.9865145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25030616,0.00013971848,0.74334913,0.0004679605,0.00033201577,0.00016047798,0.0000014302699,0.00006925565,0.005173821],"genre_scores_gemma":[0.99671346,0.000008853742,0.0029534695,0.0002678416,0.00002773525,0.0000033029266,0.0000042677543,0.0000010700842,0.000019987383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955046,0.000036202677,0.00018561853,0.000047774523,0.00008076816,0.000099177065],"domain_scores_gemma":[0.99975723,0.00003870626,0.00006823255,0.000047197092,0.000042391006,0.000046234498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032725988,0.000050686922,0.00007000796,0.00009084817,0.00005233555,0.000099381155,0.00003811276,0.000035055757,0.0000041041794],"category_scores_gemma":[0.00001006571,0.000046650086,0.000008806982,0.000119746896,0.000013624242,0.0017896842,0.00003307397,0.00005010038,0.00004822103],"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.000058124264,0.00011530269,0.034176745,0.00015134817,0.000024716666,0.0000031663142,0.05296373,0.0076459087,0.00010606065,0.56139815,0.0042137005,0.33914304],"study_design_scores_gemma":[0.00042293122,0.00002977468,0.0140613355,0.00001955467,9.656824e-7,0.000045356446,0.00016661342,0.97976977,0.000016820806,0.0004565587,0.0049221157,0.00008818291],"about_ca_topic_score_codex":0.000032077805,"about_ca_topic_score_gemma":0.0000037285276,"teacher_disagreement_score":0.97212386,"about_ca_system_score_codex":0.000016577444,"about_ca_system_score_gemma":0.000008674728,"threshold_uncertainty_score":0.19023353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23192115,0.000051218398,0.75470376,0.00007100577,0.0002446706,0.00007092169,3.2976e-8,0.00010717034,0.012830055],"genre_scores_gemma":[0.98901385,0.0000026468276,0.01005049,0.00016024198,0.00009342499,0.000007975068,2.5658832e-7,0.000005242717,0.000665844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999127,0.000046776353,0.00018961997,0.00024473984,0.00014340306,0.00024849776],"domain_scores_gemma":[0.9995686,0.00006377143,0.000045111774,0.00022505046,0.00005082635,0.000046642526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017616992,0.00009014189,0.00012286469,0.00008213241,0.000112959686,0.000048156737,0.00024756845,0.00003977474,0.000017485088],"category_scores_gemma":[0.000003090062,0.00006201695,0.000024845844,0.00049217534,0.000023945227,0.000071587056,0.000060467242,0.00011119558,0.00001830731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017125147,0.000101969956,0.019171746,0.000005728851,0.000012744495,0.00020583745,0.0012715644,0.9481736,0.00003378913,0.022196112,0.0012240929,0.007585693],"study_design_scores_gemma":[0.00024449834,0.000040256433,0.002187745,0.000036838293,4.1268734e-7,0.00019790289,0.000028636845,0.99677646,0.00003780309,0.000010615915,0.00033560555,0.00010320156],"about_ca_topic_score_codex":0.00013942625,"about_ca_topic_score_gemma":0.00007016465,"teacher_disagreement_score":0.7570927,"about_ca_system_score_codex":0.000031438107,"about_ca_system_score_gemma":0.000021173879,"threshold_uncertainty_score":0.2528978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35110942,0.000002299259,0.6241878,0.000017618897,0.00043743465,0.000084419975,4.0565723e-7,0.000054841148,0.024105757],"genre_scores_gemma":[0.95651793,1.7082475e-7,0.043158066,0.000049466642,0.0000978184,0.0000036358745,0.0000013019176,0.0000044689923,0.000167125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.00003258539,0.00042506628,0.00023883158,0.00024790873,0.00023810191],"domain_scores_gemma":[0.99927694,0.00007809688,0.00006802708,0.00038491946,0.000084082654,0.00010794623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847522,0.00008445942,0.00017982355,0.00012028763,0.000035827226,0.000077034165,0.00043107822,0.000079707796,0.000012061431],"category_scores_gemma":[0.0000047739513,0.000067607274,0.000036311478,0.00021773351,0.000015252606,0.0006028231,0.000068042515,0.00010319707,0.0000058308824],"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.0000066990087,0.00014152197,0.0024934511,0.000025068593,0.0000065083777,0.000032374435,0.0004640751,0.00095129514,0.0006305318,0.9826702,0.000050468847,0.012527802],"study_design_scores_gemma":[0.0003400712,0.00035329032,0.031434324,0.00007053794,0.0000013164263,0.000059504826,0.001212239,0.96487564,0.0012898806,0.00012695072,0.000100101795,0.00013614932],"about_ca_topic_score_codex":0.00016958146,"about_ca_topic_score_gemma":0.0013346875,"teacher_disagreement_score":0.98254323,"about_ca_system_score_codex":0.00012082634,"about_ca_system_score_gemma":0.000042668376,"threshold_uncertainty_score":0.27569446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010225004,0.0005211663,0.9795067,0.000014222726,0.0008499199,0.00012474475,6.9503113e-7,0.00005533984,0.008702242],"genre_scores_gemma":[0.84003276,0.000007892377,0.15877424,0.00006126038,0.00006840814,0.000003166273,7.8623785e-8,0.0000069338553,0.0010452449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989667,0.000110106965,0.00029868347,0.0002849384,0.00009997317,0.00023958865],"domain_scores_gemma":[0.9992427,0.00007479994,0.00012486502,0.00037331416,0.00011104374,0.00007325027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004713187,0.00011554291,0.0001865026,0.000038755214,0.00014935425,0.000055319604,0.00022408286,0.00006091108,0.000042065087],"category_scores_gemma":[0.000010670536,0.00009560336,0.000040835625,0.00027669218,0.00004952014,0.00030740228,0.00009453372,0.00007192547,0.000002156888],"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.00022950633,0.00019295831,0.003273887,0.0001612234,0.00014921417,0.0017774908,0.010312518,0.025306758,0.0002719053,0.9138177,0.041365586,0.0031412668],"study_design_scores_gemma":[0.0009759407,0.00035788325,0.00084082095,0.00045198578,0.000033441294,0.0033001618,0.0010366954,0.96757835,0.001382524,0.01762257,0.005458175,0.00096142787],"about_ca_topic_score_codex":0.00013193923,"about_ca_topic_score_gemma":0.00022772963,"teacher_disagreement_score":0.9422716,"about_ca_system_score_codex":0.000022255304,"about_ca_system_score_gemma":0.00002483,"threshold_uncertainty_score":0.38985917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000072673836,0.00034845658,0.9752363,0.0022120175,0.00065151404,0.00050967006,1.6010294e-7,0.00019919254,0.020770004],"genre_scores_gemma":[0.6995284,0.0000867038,0.15171215,0.0025244404,0.0013659897,0.00018873492,0.000009819799,0.000029377325,0.1445544],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986913,0.000035218214,0.00032269594,0.00039235747,0.00021185928,0.00034655907],"domain_scores_gemma":[0.9992252,0.00004497142,0.00009271546,0.0004771801,0.000056511337,0.00010344429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032324117,0.0001392726,0.00013460142,0.000075888136,0.0001647816,0.00026392427,0.00050863257,0.000059128142,0.00020599175],"category_scores_gemma":[0.0000037552823,0.00012377788,0.00008987196,0.00022714575,0.0000075637577,0.00024346565,0.00013591976,0.00006798429,0.00006779966],"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.000005287537,0.00004027898,0.00007891044,0.000021230584,0.000062806954,0.0000034456955,0.00015739471,0.013506268,0.0000031274149,0.21499823,0.5092587,0.26186436],"study_design_scores_gemma":[0.00029108723,0.00005073742,0.000048636266,0.000023700162,0.000005223396,0.000004506651,0.00003963948,0.6211151,0.00004605983,0.0001989008,0.37806112,0.00011527453],"about_ca_topic_score_codex":0.000021770347,"about_ca_topic_score_gemma":0.00004214322,"teacher_disagreement_score":0.8235242,"about_ca_system_score_codex":0.00006631616,"about_ca_system_score_gemma":0.0000050883787,"threshold_uncertainty_score":0.50475156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046019875,0.00019389368,0.9155636,0.00072898774,0.002085217,0.00011496079,1.0438704e-7,0.00036641525,0.07634486],"genre_scores_gemma":[0.98033345,0.0000049742644,0.010986877,0.0009532081,0.00063703,0.000011416838,2.0586864e-7,0.000006065573,0.00706679],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989329,0.000050398558,0.0002798524,0.00025741995,0.00015085221,0.0003285494],"domain_scores_gemma":[0.99938023,0.000086332584,0.00007283654,0.00033868974,0.000052027743,0.00006986599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023679403,0.000095480995,0.00013117905,0.000028644932,0.00016965353,0.0001733147,0.00038160948,0.00004841438,0.00023099467],"category_scores_gemma":[0.000023469353,0.00007556457,0.00007563777,0.00025071105,0.000009614518,0.00024803364,0.00009669996,0.000097451295,0.0003586984],"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.000005990185,0.00014262098,0.008887779,0.00002106637,0.00007087814,0.00007968886,0.0030417552,0.0869049,0.0001849757,0.29204276,0.42661965,0.18199793],"study_design_scores_gemma":[0.00015905057,0.000025700734,0.0001202342,0.00001898972,8.7316613e-7,0.00003541201,0.000021199388,0.9596717,0.000029621346,0.00031792262,0.03948555,0.000113780894],"about_ca_topic_score_codex":0.0000515844,"about_ca_topic_score_gemma":0.00006377007,"teacher_disagreement_score":0.97573143,"about_ca_system_score_codex":0.000018214692,"about_ca_system_score_gemma":0.0000034317345,"threshold_uncertainty_score":0.46104616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07357405,0.00008761428,0.9231242,0.00037644446,0.0012342145,0.00018105865,0.0000028445877,0.00003135517,0.001388191],"genre_scores_gemma":[0.94323206,0.000001297381,0.05602306,0.00012798312,0.00018743635,0.000004428506,0.0000021404467,0.000003209064,0.0004183667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937725,0.000020506759,0.00025294363,0.00013883371,0.00011253791,0.00009793069],"domain_scores_gemma":[0.99933124,0.00005589922,0.00011325318,0.00028794186,0.00019077066,0.00002086941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001492909,0.000064619984,0.00012351961,0.00006470941,0.000028836108,0.00002224444,0.00037030876,0.000040245,0.000019613239],"category_scores_gemma":[0.00005227242,0.000048263682,0.0000813243,0.000082600025,0.000019292725,0.00021355899,0.0000462421,0.00004055328,7.2939537e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061903156,0.000071810784,0.00022106802,0.00006991635,0.00012098684,4.104726e-7,0.0029504546,0.047416765,0.13274859,0.61265856,0.09496002,0.108719535],"study_design_scores_gemma":[0.00041552,0.00008615583,0.00013732072,0.000008891755,0.0000024084843,0.0000036952172,0.00009940258,0.88053775,0.1157001,0.0005012838,0.002429307,0.00007817428],"about_ca_topic_score_codex":0.000044082604,"about_ca_topic_score_gemma":0.00013061726,"teacher_disagreement_score":0.869658,"about_ca_system_score_codex":0.000021329206,"about_ca_system_score_gemma":0.000016384334,"threshold_uncertainty_score":0.19681358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11961198,0.00038128253,0.87681735,0.00026996373,0.0016010607,0.00072671723,0.00005026538,0.0002920436,0.00024932178],"genre_scores_gemma":[0.99891424,0.000014616489,0.000260388,0.0000468326,0.00017602569,0.00013740272,0.000018636325,0.000027683891,0.00040415308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716675,0.0002789727,0.0008202426,0.00072112767,0.00043596426,0.0005769205],"domain_scores_gemma":[0.99875337,0.00016813228,0.0002634655,0.00049424026,0.00019412437,0.00012666424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053245074,0.00039784395,0.0005938814,0.00028125368,0.0004307424,0.0008653706,0.00041223125,0.0001990797,0.0000016525528],"category_scores_gemma":[0.0000022634156,0.00032284553,0.00007726932,0.0008720362,0.000026716145,0.0007095226,0.000005891255,0.00037881688,0.000023978828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000082836676,0.00013093634,0.00033770595,0.00021323044,0.000049640654,0.00004578199,0.0003602405,0.9939538,0.00032028154,0.0040751486,0.00019802996,0.00023234347],"study_design_scores_gemma":[0.0019426676,0.00018090282,0.0005873696,0.001016338,0.000023880999,0.00033607913,0.0012435104,0.99329555,0.00006331739,0.000059883245,0.0007093501,0.0005411527],"about_ca_topic_score_codex":0.015621083,"about_ca_topic_score_gemma":0.0016652233,"teacher_disagreement_score":0.87930226,"about_ca_system_score_codex":0.0001957577,"about_ca_system_score_gemma":0.000065597356,"threshold_uncertainty_score":0.99992234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015831796,0.000061594044,0.97802144,0.00034025224,0.0006047328,0.00021643918,1.121861e-7,0.000104447725,0.0048191566],"genre_scores_gemma":[0.97673815,5.724525e-7,0.022176845,0.00069910457,0.00017008359,0.000011932227,3.9905473e-7,0.0000031545571,0.00019976124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991521,0.000029943822,0.00024293245,0.00023562869,0.000076254706,0.0002631],"domain_scores_gemma":[0.99950695,0.00017932976,0.000039196908,0.00019066603,0.000037395304,0.000046488876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033543588,0.00007883045,0.000118778735,0.000066907305,0.00006225065,0.000086664826,0.00024310588,0.000044183682,0.00000430607],"category_scores_gemma":[0.000038106475,0.000066316396,0.00005101131,0.00021325245,0.0000062548693,0.000048438327,0.000025482097,0.00008624989,0.000006156939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011095551,0.00011029382,0.0001414309,0.0000071174195,0.0000036337678,0.000014006804,0.00040740822,0.7994332,0.00003062165,0.17578058,0.0012989234,0.022761691],"study_design_scores_gemma":[0.0002483633,0.000075311116,0.0008759321,0.00003089584,6.949826e-7,0.000010955792,0.000024300036,0.9976447,0.000013463593,0.0007280438,0.00025784958,0.00008947967],"about_ca_topic_score_codex":0.000008095171,"about_ca_topic_score_gemma":0.000008875234,"teacher_disagreement_score":0.9609063,"about_ca_system_score_codex":0.000026298663,"about_ca_system_score_gemma":0.000011124543,"threshold_uncertainty_score":0.27043042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073465584,0.0000044961225,0.96628904,0.0001903902,0.00025410988,0.027149467,3.285888e-7,0.000100994504,0.005937715],"genre_scores_gemma":[0.8403338,2.398001e-7,0.022113064,0.0002730879,0.00014305906,0.13227654,3.0903342e-7,0.000009298726,0.0048505766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921954,0.00007479705,0.00020542856,0.00020111662,0.00010495595,0.00019414387],"domain_scores_gemma":[0.99929047,0.00019495407,0.000066829445,0.00028179534,0.0001199329,0.000045998473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049132906,0.00008258864,0.00007368024,0.000023814917,0.00024661596,0.00024796266,0.00030441768,0.00003238967,0.00004037952],"category_scores_gemma":[0.00008610412,0.0000498098,0.000057726076,0.0001392272,0.0000136214285,0.00022252327,0.000023957946,0.00005959059,0.000026305723],"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.000008582232,0.00009486448,0.00022980158,0.00002894998,0.00002196257,0.000002029433,0.00029920565,0.026191676,0.00010302592,0.94805145,0.003887212,0.021081252],"study_design_scores_gemma":[0.00061597576,0.00006282015,0.00010804368,0.000011017049,0.000001875925,0.000010572449,0.00006624685,0.91638047,0.0010746439,0.00055924,0.081019185,0.000089928915],"about_ca_topic_score_codex":0.00005175106,"about_ca_topic_score_gemma":0.000057243185,"teacher_disagreement_score":0.9474922,"about_ca_system_score_codex":0.000020392165,"about_ca_system_score_gemma":0.000049554325,"threshold_uncertainty_score":0.23911096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006488616,0.00006065901,0.9966283,0.00008841422,0.0011863104,0.0008409342,0.0000032311275,0.00021167251,0.0003316042],"genre_scores_gemma":[0.4821622,0.0000062554755,0.5172856,0.00019235801,0.00019462104,0.00006172361,0.0000014902504,0.000013946823,0.00008181685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977883,0.00035056393,0.00062102615,0.0005038705,0.00034345497,0.00039277642],"domain_scores_gemma":[0.9968251,0.0018380706,0.00031626946,0.00062052516,0.00028054128,0.00011950423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095566525,0.00023441728,0.00047267711,0.00015942722,0.00020945138,0.00007506731,0.0010956603,0.00011350889,0.0000013023945],"category_scores_gemma":[0.000060286744,0.00022072901,0.00021408556,0.00037247015,0.00009524449,0.00032112573,0.000059634724,0.000120363475,0.000009673316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011840496,0.0007185335,0.00047411464,0.0001678152,0.00017302558,0.00003071575,0.0035268324,0.8467993,0.009112637,0.015844194,0.114445955,0.008588478],"study_design_scores_gemma":[0.0007466996,0.0006161033,0.00019406191,0.00004097752,0.0000060699704,0.00012360625,0.000015129639,0.99257636,0.0041326885,0.00045804723,0.0007964163,0.00029383838],"about_ca_topic_score_codex":0.000021089541,"about_ca_topic_score_gemma":3.537511e-7,"teacher_disagreement_score":0.48151335,"about_ca_system_score_codex":0.00005548765,"about_ca_system_score_gemma":0.00013844858,"threshold_uncertainty_score":0.9001067},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46338418,0.00008468364,0.5332508,0.00008424098,0.000098830955,0.00009316021,0.0000011372647,0.000112189875,0.00289081],"genre_scores_gemma":[0.9967665,0.000017873801,0.002042542,0.000053680906,0.000012103962,0.0000064926735,0.0000013791387,0.000005149075,0.0010942579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991238,0.000037431957,0.00024682202,0.0002705245,0.00014562615,0.00017577432],"domain_scores_gemma":[0.9993865,0.000081527054,0.00010828822,0.00029537125,0.00007188172,0.00005643512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015035612,0.00011011594,0.00030357073,0.0002067614,0.000054038384,0.00008376205,0.00018485214,0.000048804464,0.00004621387],"category_scores_gemma":[0.000006944709,0.000077352175,0.00006299896,0.0010520858,0.000025036854,0.00016292409,0.00004440787,0.00007422629,0.0000047717826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011722462,0.0004887102,0.03265164,0.00018583077,0.004771526,0.00008707005,0.020887434,0.8272251,0.0007312604,0.024605958,0.0027870415,0.08546124],"study_design_scores_gemma":[0.00030224214,0.00009541142,0.0016693181,0.00002444574,0.00006343865,0.000011550797,0.00008448253,0.9974781,0.000046730172,0.000007678017,0.00010492211,0.00011166928],"about_ca_topic_score_codex":0.000033403758,"about_ca_topic_score_gemma":0.00007044012,"teacher_disagreement_score":0.53338236,"about_ca_system_score_codex":0.000012704134,"about_ca_system_score_gemma":0.0000037566774,"threshold_uncertainty_score":0.31543303},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12710848,0.000034316512,0.82528794,0.0012171466,0.0006774454,0.00087780406,0.0000036216209,0.00018696084,0.044606294],"genre_scores_gemma":[0.99849457,0.000001338656,0.0009275218,0.00016894286,0.000036725214,0.00008514731,0.000002955757,0.000007811766,0.00027496446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966858,0.0014024173,0.00043077816,0.00035657137,0.00086315616,0.00026124498],"domain_scores_gemma":[0.99682516,0.0005284422,0.000117531,0.001652008,0.0007391541,0.00013768341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043520504,0.000116303185,0.0002361738,0.00015192128,0.00012031541,0.00011243192,0.0010260397,0.000102665676,0.000021879197],"category_scores_gemma":[0.000029898156,0.00008902028,0.00006635238,0.00031092588,0.000070239315,0.0001677593,0.00018473076,0.0002826459,0.00012381047],"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.0006193871,0.0010651511,0.002894525,0.00030212183,0.00006101715,0.000018115628,0.0034096676,0.014104941,0.00023987878,0.9521224,0.015313499,0.009849334],"study_design_scores_gemma":[0.00073023577,0.0005051791,0.00018354466,0.00018286957,0.0000015683767,0.0000053805934,0.0012306818,0.9951949,0.0012047101,0.00015436727,0.0004963118,0.000110220164],"about_ca_topic_score_codex":0.00091991667,"about_ca_topic_score_gemma":0.00023576822,"teacher_disagreement_score":0.98109,"about_ca_system_score_codex":0.00032649192,"about_ca_system_score_gemma":0.00012160469,"threshold_uncertainty_score":0.36301416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016243339,0.000034049302,0.9804555,0.0016067219,0.00041114943,0.00010379497,0.0000049958835,0.0000717021,0.0010687091],"genre_scores_gemma":[0.9962761,0.0000013133056,0.0025877848,0.0007587325,0.00019866067,0.0000022671418,0.0000139396625,0.0000016641582,0.00015953965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933714,0.000052525582,0.00020476745,0.00015660911,0.00012200458,0.00012694566],"domain_scores_gemma":[0.99957794,0.000028305092,0.00007000073,0.00022952119,0.000053646752,0.000040589952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012444331,0.000072825846,0.00013017208,0.000041902906,0.00004211845,0.0000848291,0.00023270817,0.00004521492,0.000017194927],"category_scores_gemma":[0.000008465046,0.00005477672,0.000050219875,0.00012735985,0.000008255199,0.00015579736,0.000010919843,0.000059914364,0.0000069461794],"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.000081131024,0.00025590666,0.00050861173,0.00002209022,0.00012447298,0.00003056017,0.0017300602,0.13149709,0.108153515,0.46119577,0.07487773,0.22152306],"study_design_scores_gemma":[0.00067634357,0.00031479896,0.001467982,0.000016654722,0.0000048494317,0.000044214183,0.000020960686,0.987528,0.003991089,0.0008490685,0.0049296403,0.00015639699],"about_ca_topic_score_codex":0.00003133535,"about_ca_topic_score_gemma":0.000022424369,"teacher_disagreement_score":0.98003274,"about_ca_system_score_codex":0.000015147227,"about_ca_system_score_gemma":0.000012020425,"threshold_uncertainty_score":0.22337298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10727241,0.0000854009,0.8867025,0.0004562047,0.0044365847,0.0006096995,0.000056745015,0.00020163161,0.00017882991],"genre_scores_gemma":[0.9947218,0.000060367656,0.002840964,0.0003371885,0.00039510164,0.00019399238,0.00005296882,0.000014299376,0.0013833591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767053,0.00021826244,0.000714001,0.000676202,0.00032001978,0.00040099365],"domain_scores_gemma":[0.9986106,0.00010927597,0.00022914467,0.0005471754,0.0003948161,0.00010895071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006152204,0.00029380308,0.00048758727,0.00046967488,0.0006993838,0.00032080087,0.00027055052,0.00025905148,0.000020817],"category_scores_gemma":[0.000006828789,0.00025857714,0.00022378596,0.0009191916,0.000040692677,0.00092318543,0.0000023833597,0.0002436544,0.000020180285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005755635,0.002235478,0.0010402588,0.0002693125,0.0023668448,0.000015496307,0.01362798,0.6255014,0.025090728,0.19818282,0.009149095,0.12194502],"study_design_scores_gemma":[0.00069596217,0.0006235566,0.0004292002,0.00005056776,0.00011985544,0.00003218637,0.00036298306,0.9863317,0.009449356,0.00007242313,0.0015308805,0.00030134505],"about_ca_topic_score_codex":0.00012263129,"about_ca_topic_score_gemma":0.00045606593,"teacher_disagreement_score":0.8874493,"about_ca_system_score_codex":0.00017203744,"about_ca_system_score_gemma":0.000046019017,"threshold_uncertainty_score":0.99998665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061158776,0.000009011576,0.93349314,0.0006919774,0.0010978928,0.00051479077,0.0000056352214,0.00015299868,0.0028757844],"genre_scores_gemma":[0.9909376,0.0000010147637,0.0078475615,0.00037088024,0.0001688336,0.0001954057,0.0000053022472,0.000008598494,0.0004647864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892753,0.000041144016,0.0003491202,0.00029500914,0.00013802342,0.00024915504],"domain_scores_gemma":[0.9995037,0.0000896077,0.00006128192,0.00023880559,0.00006122505,0.000045396366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030338822,0.000113627895,0.0001397922,0.00016289695,0.00012905791,0.00020226213,0.00017332257,0.000050637485,0.000017751649],"category_scores_gemma":[0.0000048944685,0.0000971469,0.00008071529,0.00024861717,0.000008937417,0.00039826377,0.000013667618,0.000074289106,0.000044878783],"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.000021691523,0.000097577176,0.0001338406,0.00005685701,0.00002194165,0.0000064971214,0.001352224,0.014546448,0.00046256496,0.9811111,0.0007648099,0.0014244651],"study_design_scores_gemma":[0.03438867,0.0059395386,0.0153996525,0.0029621574,0.000109176755,0.0014860841,0.020691488,0.7659607,0.03681918,0.048619498,0.06317673,0.004447116],"about_ca_topic_score_codex":0.0006848623,"about_ca_topic_score_gemma":0.0013379187,"teacher_disagreement_score":0.9324916,"about_ca_system_score_codex":0.00023363245,"about_ca_system_score_gemma":0.000045645083,"threshold_uncertainty_score":0.39615354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014552557,0.00012844572,0.97235554,0.00020554395,0.0017933267,0.0000791591,5.7409576e-8,0.00018397393,0.010701367],"genre_scores_gemma":[0.87738484,0.0000044249878,0.11852353,0.0008175339,0.0010206712,0.0000015587158,2.145989e-7,0.0000081516,0.0022390857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00009289158,0.00020204185,0.0002796645,0.00019995452,0.0003580425],"domain_scores_gemma":[0.9994054,0.00006957504,0.000034470686,0.00033935727,0.00007147415,0.00007972904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030337492,0.00009635538,0.00013135525,0.000049326383,0.00025475043,0.0002401447,0.00033771415,0.00004961945,0.00025231586],"category_scores_gemma":[0.0000019412853,0.00007919357,0.000058451395,0.00035256374,0.000015903588,0.0002927909,0.0002281862,0.00012153311,0.00028198835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025732418,0.00006638692,0.0023315458,0.000012261182,0.000050855957,0.00006098939,0.0012401419,0.6209646,0.00024779298,0.19279183,0.13805096,0.0441801],"study_design_scores_gemma":[0.00009543686,0.000032328153,0.000072439034,0.00002985452,0.0000010466291,0.000072601404,0.000006712394,0.99234086,0.00003808076,0.000112632006,0.007086264,0.00011171402],"about_ca_topic_score_codex":0.000049697584,"about_ca_topic_score_gemma":0.000005842787,"teacher_disagreement_score":0.86283225,"about_ca_system_score_codex":0.000033473312,"about_ca_system_score_gemma":0.000006004489,"threshold_uncertainty_score":0.36244836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.657471,0.000009762701,0.34106076,0.00012741402,0.00036355958,0.00031434404,9.292813e-7,0.00011255247,0.0005396544],"genre_scores_gemma":[0.9891355,8.588516e-7,0.010235138,0.00024532402,0.000224798,0.000016335698,0.000002490503,0.000021031161,0.000118497235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979887,0.00021777705,0.0004931188,0.00046114568,0.00045333922,0.0003859137],"domain_scores_gemma":[0.99830866,0.000049123442,0.00024282225,0.00089763425,0.0003474735,0.00015430014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089967373,0.00023252201,0.00031028368,0.00011905143,0.00033163297,0.00034453973,0.00094716187,0.00011583555,0.000017125716],"category_scores_gemma":[0.0000134270385,0.00014596876,0.00008056697,0.0005678137,0.000080645565,0.0011209374,0.000109965586,0.00029017645,0.0000048793577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00041919647,0.004847435,0.034223404,0.00017779034,0.00037742837,0.00047456735,0.05019392,0.38840047,0.058617182,0.32377428,0.00020310807,0.13829122],"study_design_scores_gemma":[0.0049110516,0.0033602822,0.042756367,0.00055916683,0.0001792189,0.0015213194,0.008900937,0.8693496,0.062471747,0.0033787112,0.0006469726,0.0019646],"about_ca_topic_score_codex":0.011084078,"about_ca_topic_score_gemma":0.0063472306,"teacher_disagreement_score":0.48094916,"about_ca_system_score_codex":0.00011918823,"about_ca_system_score_gemma":0.0002265298,"threshold_uncertainty_score":0.9955012},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00974072,0.000025601206,0.41681427,0.0004039169,0.0012118653,0.00006467203,1.533438e-7,0.00017996131,0.57155883],"genre_scores_gemma":[0.987999,0.0000018040676,0.0036620416,0.0012493492,0.000079502024,0.000004029939,9.95896e-8,0.000003986019,0.0070001357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993177,0.00006288244,0.00013492408,0.00019395315,0.00012307988,0.00016743068],"domain_scores_gemma":[0.9993026,0.00007649623,0.00002560017,0.00051338447,0.000037706053,0.000044199947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027833623,0.000069492366,0.00008390744,0.000035945333,0.00009490124,0.00012779683,0.00041317826,0.000035562698,0.00008441668],"category_scores_gemma":[0.000071734925,0.000053053842,0.000041761345,0.00012241151,0.000008060341,0.00012924419,0.000047329686,0.00006794396,0.00021875867],"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":[4.5723445e-7,0.000010706701,0.00014505273,8.6531423e-7,0.0000039021625,0.0000026893806,0.0001724551,0.00014476145,0.000077432516,0.98672193,0.011584675,0.0011350653],"study_design_scores_gemma":[0.0010433077,0.00037254713,0.0006196649,0.00007378528,0.0000037900134,0.00020689535,0.0004574775,0.22276057,0.01065665,0.009462284,0.7537293,0.0006137519],"about_ca_topic_score_codex":0.000029190667,"about_ca_topic_score_gemma":0.000010574555,"teacher_disagreement_score":0.9782583,"about_ca_system_score_codex":0.000017589415,"about_ca_system_score_gemma":0.0000123012,"threshold_uncertainty_score":0.2811773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011679323,0.00003512315,0.7123473,0.00017374053,0.00085812743,0.000043058943,4.8866696e-8,0.00009980551,0.2852748],"genre_scores_gemma":[0.9629856,0.0000015156452,0.020044478,0.00068786344,0.000066110806,0.0000064128526,9.0911804e-8,0.000004528258,0.016203452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992933,0.000056684494,0.00015436189,0.00020421129,0.00012056815,0.00017081779],"domain_scores_gemma":[0.99952614,0.000019915764,0.000030188807,0.00031637386,0.000053412336,0.000053938064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000235911,0.0000691692,0.000088350695,0.00003195676,0.00005371684,0.0001255008,0.00025383153,0.00003423047,0.00018721716],"category_scores_gemma":[0.000014073728,0.000052362164,0.000050421695,0.0001390932,0.000007189461,0.0001899722,0.000021177986,0.000053877084,0.0004028262],"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":[6.5817625e-7,0.000021326648,0.0000773265,0.0000027323665,0.0000066317475,0.000009370325,0.0002841385,0.0005682933,0.00034242668,0.97870386,0.017711366,0.0022718997],"study_design_scores_gemma":[0.00055262755,0.0001351293,0.00015726923,0.000036094665,0.000002809581,0.0002968251,0.0002419472,0.30608833,0.0042357454,0.013555695,0.6742242,0.00047335186],"about_ca_topic_score_codex":0.00001704727,"about_ca_topic_score_gemma":0.000019964758,"teacher_disagreement_score":0.96514815,"about_ca_system_score_codex":0.000013522085,"about_ca_system_score_gemma":0.000015874655,"threshold_uncertainty_score":0.51776505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014136487,0.0003431347,0.96408814,0.0034929598,0.0010718069,0.00028292672,7.786867e-7,0.00017711658,0.016406635],"genre_scores_gemma":[0.97996473,0.000036957175,0.016695846,0.0019068758,0.00028613713,0.000014157941,8.069646e-7,0.000008402013,0.0010860806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988182,0.00023863476,0.00025605704,0.00020650508,0.00021234457,0.00026824384],"domain_scores_gemma":[0.99869287,0.00018856871,0.00009065972,0.0009144608,0.000069537855,0.00004391467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005649089,0.00011020717,0.0001210972,0.000024136569,0.00047695017,0.00024971113,0.0006982546,0.00004692803,0.00017678851],"category_scores_gemma":[0.000009661182,0.00006573705,0.000071231836,0.00024863234,0.000027393547,0.00018928238,0.00017412935,0.00017189003,0.000107994754],"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.000007093557,0.00021262364,0.00011347184,0.000008399302,0.00007140734,0.000010461475,0.0052862205,0.15876372,0.00009201391,0.6358821,0.118313864,0.081238665],"study_design_scores_gemma":[0.00007825522,0.000042693213,0.000044557884,0.000050119605,0.000001752864,0.000013611735,0.00012122423,0.9838229,0.000026559972,0.00066346204,0.015033797,0.00010108344],"about_ca_topic_score_codex":0.00018179584,"about_ca_topic_score_gemma":0.0000434225,"teacher_disagreement_score":0.96582824,"about_ca_system_score_codex":0.00005133765,"about_ca_system_score_gemma":0.0000053422877,"threshold_uncertainty_score":0.3668363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031254716,0.000036770292,0.9611647,0.00026557338,0.00014258017,0.000045954104,1.7206354e-7,0.00007901467,0.0070104925],"genre_scores_gemma":[0.9934575,0.000003998648,0.0038802964,0.00015488341,0.000054143024,0.0000019960296,3.0248873e-7,0.000001970769,0.0024449388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994405,0.000030480085,0.00013635564,0.00019184206,0.00009649314,0.00010432827],"domain_scores_gemma":[0.9995751,0.00008391985,0.00003262314,0.00021479979,0.00004640096,0.000047202728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106095475,0.000056149547,0.000100867066,0.000101826416,0.000071911316,0.00013902746,0.000110682704,0.000031175638,0.00019731103],"category_scores_gemma":[0.000010899585,0.000043931333,0.000049196038,0.00048089382,0.000008499979,0.00021628899,0.00004284418,0.00003409201,0.000063757456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006907378,0.00021222017,0.048881747,0.000023599783,0.00084092503,0.000028713852,0.005605319,0.66362524,0.00032943307,0.0817303,0.0042240843,0.19449152],"study_design_scores_gemma":[0.000084588515,0.000015155327,0.0034164244,0.0000018353068,0.000015327076,0.0000027280576,0.000017840279,0.9946724,0.000023314866,0.000055329438,0.0016322935,0.00006275506],"about_ca_topic_score_codex":0.00006094692,"about_ca_topic_score_gemma":0.0000684041,"teacher_disagreement_score":0.9622027,"about_ca_system_score_codex":0.000009524398,"about_ca_system_score_gemma":9.007302e-7,"threshold_uncertainty_score":0.21604174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016252857,0.000058661593,0.97156644,0.002761484,0.00044506753,0.00005953886,1.8730246e-7,0.00008999344,0.008765794],"genre_scores_gemma":[0.98319775,0.0000036583524,0.010431584,0.005517677,0.00039802474,0.0000029094156,0.000003848872,0.0000017027688,0.0004428305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.0000868699,0.00016324983,0.00027301887,0.00009186043,0.00016901194],"domain_scores_gemma":[0.99953794,0.000048460253,0.00004569351,0.0002855482,0.00003838336,0.000043943768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022683114,0.000081121114,0.00015151256,0.00009659488,0.00012879385,0.00012647879,0.00014973285,0.000057636324,0.000041814677],"category_scores_gemma":[0.0000053529516,0.000063369676,0.00006652642,0.00050371926,0.000013353685,0.00011178291,0.000015545591,0.000054220534,0.000012431438],"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.0000066101315,0.000042106974,0.001934493,0.0000011662596,0.00009177501,0.0000067011656,0.00012357665,0.1514086,0.00014454388,0.79990304,0.01938575,0.026951617],"study_design_scores_gemma":[0.00012339366,0.00018133532,0.0030950261,0.0000019211845,0.00001564704,0.0000036025808,0.0000036705665,0.9931478,0.00015462769,0.0014070952,0.0017771049,0.00008876186],"about_ca_topic_score_codex":0.000029807486,"about_ca_topic_score_gemma":0.000116516014,"teacher_disagreement_score":0.96694493,"about_ca_system_score_codex":0.000014598775,"about_ca_system_score_gemma":0.000010685811,"threshold_uncertainty_score":0.25841406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006453205,0.0000044538137,0.5753021,0.000037582216,0.00045159692,0.000012357876,1.1202621e-8,0.000076326214,0.4234702],"genre_scores_gemma":[0.98090017,4.22977e-7,0.013071083,0.00031891523,0.000050547198,0.0000020469815,2.9536992e-8,0.0000010578851,0.005655708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997519,0.000010201003,0.000055003085,0.00007922971,0.00003810556,0.00006552175],"domain_scores_gemma":[0.9997745,0.0000046509012,0.0000098227065,0.00017201781,0.000017154984,0.000021844367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007521365,0.000023037466,0.000028692084,0.000015614653,0.000023753311,0.000022354292,0.00020949553,0.000012355259,0.00027823925],"category_scores_gemma":[0.0000015065343,0.000016778964,0.000017235874,0.000058276484,0.000003832342,0.00013776062,0.000036585112,0.000018618708,0.00036361293],"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":[3.3900392e-7,0.000008257463,0.0003129413,4.940266e-7,0.0000023183748,0.0000026632042,0.00048319186,7.968212e-7,0.000021570424,0.975826,0.016663808,0.0066776145],"study_design_scores_gemma":[0.0005617782,0.00040745208,0.0123743145,0.000029816805,0.0000034698355,0.00025944118,0.00031220284,0.30545542,0.013403938,0.058457162,0.60804325,0.0006917744],"about_ca_topic_score_codex":0.000047669113,"about_ca_topic_score_gemma":0.000010410764,"teacher_disagreement_score":0.9802549,"about_ca_system_score_codex":0.0000030869348,"about_ca_system_score_gemma":0.000003995508,"threshold_uncertainty_score":0.46736297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37039354,0.0011990286,0.6039338,0.0010718323,0.0008612517,0.00032222422,2.8829788e-7,0.00037158013,0.021846464],"genre_scores_gemma":[0.9952735,0.00007790375,0.0038203143,0.00014787416,0.00010735381,0.0000040856808,9.02851e-8,0.0000044381177,0.00056447904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992294,0.00006204168,0.00018101538,0.00025610428,0.00006458526,0.00020689813],"domain_scores_gemma":[0.9996219,0.000110822846,0.00003302817,0.00015019895,0.000020335838,0.000063673855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022872248,0.00008900651,0.00012733229,0.00005001389,0.00008153293,0.00018301535,0.00011961842,0.000054669243,0.000022315118],"category_scores_gemma":[0.0000115876055,0.00007285686,0.000014767795,0.00019434017,0.000018878301,0.0002374309,0.000094629955,0.0000948769,0.000005812948],"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.000015175908,0.0006082241,0.21637532,0.000064221844,0.00013732503,0.00020965163,0.025611434,0.0089613125,0.00017538876,0.27803206,0.014304281,0.45550558],"study_design_scores_gemma":[0.0002923905,0.000035851892,0.0074265446,0.000023376657,0.0000012281581,0.000055683606,0.000086190084,0.99072856,0.0000054386405,0.000029492216,0.0012177259,0.000097514894],"about_ca_topic_score_codex":0.000087956076,"about_ca_topic_score_gemma":0.00028069734,"teacher_disagreement_score":0.98176724,"about_ca_system_score_codex":0.000015801077,"about_ca_system_score_gemma":0.000001946231,"threshold_uncertainty_score":0.29710165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97042555,0.00015035034,0.0039984225,0.0008513102,0.00048676223,0.017546535,0.000004283352,0.0005024701,0.006034336],"genre_scores_gemma":[0.980962,0.00008948788,0.0015813981,0.00015103884,0.0005884679,0.016342118,0.0000063382295,0.000040411698,0.00023873642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679595,0.000018956938,0.0010032749,0.0010471548,0.00061770855,0.00051695155],"domain_scores_gemma":[0.9980357,0.00009012262,0.00077713537,0.00025935427,0.00067161286,0.00016607389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009617018,0.00043565533,0.00046544845,0.00039879142,0.00080135895,0.0009771558,0.0010258153,0.00020243369,0.0000027595468],"category_scores_gemma":[0.000029151088,0.00041356502,0.00005841611,0.0006244374,0.0001619318,0.0015621791,0.0005749832,0.00048772563,0.000010477626],"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.00034097355,0.0008102828,0.38405064,0.00267879,0.00018177497,0.000009505985,0.007005926,0.0013037968,0.0072536482,0.5659569,0.0023732714,0.028034514],"study_design_scores_gemma":[0.0030978005,0.0004890853,0.038031247,0.0018029447,0.000012368633,0.00089853373,0.00060570386,0.936978,0.0013649801,0.00032638843,0.015359985,0.0010329583],"about_ca_topic_score_codex":0.00018936802,"about_ca_topic_score_gemma":0.0000029548016,"teacher_disagreement_score":0.9356742,"about_ca_system_score_codex":0.00031037343,"about_ca_system_score_gemma":0.00003912184,"threshold_uncertainty_score":0.9998316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96636045,0.000046917983,0.007146153,0.00083595345,0.0013695783,0.00020330843,6.6832143e-7,0.00010645295,0.023930497],"genre_scores_gemma":[0.9983458,0.0000011778711,0.0006947755,0.00004736478,0.00019464,0.000008463801,4.3735177e-8,0.0000039761094,0.0007037683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944025,0.0000054321154,0.00017117053,0.00014830254,0.00014477786,0.000090073896],"domain_scores_gemma":[0.99956405,0.000022468392,0.0001350859,0.00014230495,0.00012043763,0.000015622867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002354746,0.00006734086,0.00009262491,0.00004193012,0.00008773576,0.00010830505,0.0005120552,0.000029313544,3.7035434e-7],"category_scores_gemma":[0.000024035839,0.000041484913,0.00003309596,0.00015255394,0.00002220279,0.00019880378,0.000076207245,0.000069914684,0.0000036728752],"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.000019442807,0.00004666458,0.0013419909,0.00012638752,0.000011909795,3.313195e-7,0.00075927726,0.000101296064,0.044580523,0.90564305,0.04610419,0.0012649377],"study_design_scores_gemma":[0.0016191952,0.0011615577,0.01655743,0.0029719083,0.00004352705,0.00038791157,0.0010266822,0.40895453,0.51642746,0.041678455,0.008319987,0.00085135136],"about_ca_topic_score_codex":0.00009389056,"about_ca_topic_score_gemma":0.0000062689255,"teacher_disagreement_score":0.8639646,"about_ca_system_score_codex":0.000026736214,"about_ca_system_score_gemma":0.0000051864226,"threshold_uncertainty_score":0.16917056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37984306,0.000031441592,0.61744845,0.00027037397,0.00078008143,0.00025011797,0.00006051444,0.00067597174,0.00063997786],"genre_scores_gemma":[0.9952802,0.0000032698997,0.0032143807,0.0003609047,0.00038775062,0.0000056799554,0.0006819268,0.000034596815,0.00003126308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961502,0.00028299165,0.0007768013,0.0010345965,0.0007046712,0.0010507256],"domain_scores_gemma":[0.9975418,0.0003744716,0.0004000884,0.0009540586,0.00043682224,0.00029278826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005343424,0.00052112446,0.0006023637,0.00017485884,0.00092767045,0.0005175002,0.001161674,0.00016910631,0.000015036033],"category_scores_gemma":[0.0000670031,0.0004434028,0.00016896127,0.0016401386,0.00008906763,0.00030845738,0.00032462933,0.00053970935,0.00009080883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006799433,0.0025717644,0.1263345,0.00016562412,0.0008985682,0.002355616,0.002778194,0.6806927,0.002764136,0.08664942,0.016898485,0.0772111],"study_design_scores_gemma":[0.0015027197,0.00041041776,0.017593307,0.0003814412,0.000017976481,0.000536172,0.00026062946,0.96447796,0.00036226067,0.00007190961,0.013701386,0.000683809],"about_ca_topic_score_codex":0.00013766078,"about_ca_topic_score_gemma":0.000013099961,"teacher_disagreement_score":0.61543715,"about_ca_system_score_codex":0.000282024,"about_ca_system_score_gemma":0.000056559285,"threshold_uncertainty_score":0.99980175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036443227,0.00013122422,0.9893429,0.00013258272,0.0035385587,0.0022819643,0.00003939295,0.0004327762,0.00045625214],"genre_scores_gemma":[0.96672547,0.000008390126,0.02940504,0.000120447585,0.00065007975,0.0020448777,0.000019595966,0.000044104334,0.000981996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972279,0.0000663394,0.0008343387,0.00079658517,0.00041860424,0.0006562101],"domain_scores_gemma":[0.99864215,0.00021440546,0.00022769964,0.00044077454,0.00028558084,0.00018939958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007152344,0.00038981056,0.00047838406,0.0003220657,0.0006826567,0.0006998303,0.00038262387,0.00026810716,0.0000031579946],"category_scores_gemma":[0.0000039731663,0.00034928898,0.00018984932,0.0005111849,0.000034243385,0.00083781907,0.000006063966,0.00029355803,0.000024103168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026277144,0.0004895213,0.000015048752,0.00019946929,0.00010402756,0.00000400845,0.0056385845,0.88330984,0.0013633176,0.011811232,0.0018891809,0.094913006],"study_design_scores_gemma":[0.0011823111,0.00016961199,0.000007850529,0.00025503946,0.000021803193,0.000027901862,0.0008951481,0.98956764,0.0010710226,0.00031629764,0.0060716555,0.00041369136],"about_ca_topic_score_codex":0.00029963994,"about_ca_topic_score_gemma":0.0013648445,"teacher_disagreement_score":0.9630811,"about_ca_system_score_codex":0.00018315876,"about_ca_system_score_gemma":0.000053328353,"threshold_uncertainty_score":0.99989593},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7096054,0.0018313228,0.22248153,0.0037339027,0.0017213781,0.00048354414,0.0000012863069,0.0006497017,0.05949196],"genre_scores_gemma":[0.9814117,0.0000038740864,0.0002556849,0.00020772713,0.00005955752,0.0000056922727,4.2278806e-8,0.0000041938474,0.01805152],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992274,0.00012317116,0.00020188265,0.00016080227,0.00014184097,0.0001449092],"domain_scores_gemma":[0.9994804,0.000039993174,0.00005091461,0.00032703622,0.00006467833,0.00003695894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032499168,0.00006679939,0.00012409702,0.0000676745,0.000048383907,0.000052058273,0.00034490845,0.000038440718,0.00024835073],"category_scores_gemma":[0.00002746644,0.00004900627,0.00004846783,0.00013460143,0.000025209265,0.00032267382,0.00006149898,0.000042379877,0.0006307701],"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.00012913092,0.00077236217,0.00027147948,0.0001418509,0.0001970566,0.00007332892,0.015351557,0.002040297,0.48605904,0.22900169,0.1423736,0.12358861],"study_design_scores_gemma":[0.0004923557,0.000515135,0.00023834512,0.00012753022,0.0000036238591,0.00013079085,0.00007165216,0.9232832,0.054004036,0.0003840067,0.020406993,0.00034231925],"about_ca_topic_score_codex":0.000012858654,"about_ca_topic_score_gemma":9.755007e-7,"teacher_disagreement_score":0.9212429,"about_ca_system_score_codex":0.000023189057,"about_ca_system_score_gemma":0.000012572321,"threshold_uncertainty_score":0.8107484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01651545,0.000027802707,0.9481803,0.00020697876,0.00091664225,0.00059926533,2.2139018e-7,0.00006865317,0.033484686],"genre_scores_gemma":[0.8404436,0.0000016845407,0.15708064,0.0016324613,0.00008329925,0.00006047475,6.823493e-7,0.000006138103,0.0006910184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984942,0.00013443445,0.00036611315,0.00036458278,0.00022663518,0.0004140548],"domain_scores_gemma":[0.9994979,0.000018530156,0.0000653688,0.00028010516,0.000056150893,0.00008197354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007023187,0.00012719717,0.00013904052,0.00007519432,0.00008668586,0.00018266855,0.00027257457,0.00003966788,0.000046871235],"category_scores_gemma":[0.0000074126033,0.000114877985,0.000038610953,0.00096679304,0.0000040623363,0.00025794876,0.00011680648,0.00005327854,0.000030160869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001865295,0.000060109083,0.0012467414,0.00002957808,0.000035798177,0.00002026214,0.0011742186,0.65569156,0.0000038494186,0.31479546,0.011497144,0.01542662],"study_design_scores_gemma":[0.0012745538,0.0000954803,0.0010537076,0.00017644548,0.000010193502,0.00004337706,0.0017201892,0.97222924,0.000060643146,0.009759623,0.013066268,0.00051029806],"about_ca_topic_score_codex":0.000061908664,"about_ca_topic_score_gemma":0.00050623843,"teacher_disagreement_score":0.8239282,"about_ca_system_score_codex":0.0002515111,"about_ca_system_score_gemma":0.000027449396,"threshold_uncertainty_score":0.46845883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15655112,0.0022344082,0.7376603,0.0029424308,0.00063245004,0.00046373066,0.0000017330301,0.000861489,0.098652355],"genre_scores_gemma":[0.98659766,0.00005631242,0.011918229,0.0002009705,0.00007784492,0.000014985435,6.269617e-7,0.000007641637,0.0011257037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911416,0.00008767704,0.00024840102,0.00022727318,0.00012322914,0.00019925593],"domain_scores_gemma":[0.99879086,0.0002442086,0.00007715071,0.0007496322,0.00006467648,0.000073475945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012320068,0.00010846609,0.00013574715,0.00005517644,0.0003891888,0.00033458145,0.0005602241,0.000052486525,0.000093098184],"category_scores_gemma":[0.00002827515,0.00009330542,0.000048311784,0.00016367786,0.00004716753,0.0005759904,0.00033728743,0.00011263483,0.000024445746],"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.0000041869484,0.00024192828,0.2387301,0.00012778508,0.000121624114,0.000018873272,0.018256214,0.03370607,0.00010749187,0.6224008,0.011617611,0.07466732],"study_design_scores_gemma":[0.00015123878,0.000030272267,0.005947532,0.00006297085,0.000002445029,0.000010002074,0.0004088398,0.9888973,0.000013198085,0.0003640803,0.0039673126,0.00014476429],"about_ca_topic_score_codex":0.00020066056,"about_ca_topic_score_gemma":0.0002598078,"teacher_disagreement_score":0.95519125,"about_ca_system_score_codex":0.000020637774,"about_ca_system_score_gemma":0.0000032447942,"threshold_uncertainty_score":0.38048846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014736289,0.0004966928,0.982846,0.0002276516,0.00020219728,0.00024345702,0.0000010589014,0.000070465176,0.0011761938],"genre_scores_gemma":[0.9372709,0.00008971087,0.062371127,0.00008348592,0.000035238096,0.0000060104803,0.000002548858,0.000009058854,0.00013193289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984546,0.00042215,0.00046635166,0.0002268652,0.00023532851,0.00019475272],"domain_scores_gemma":[0.9988371,0.00015304849,0.00021436073,0.00056655885,0.00018837898,0.000040513056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680454,0.0001199607,0.0002263848,0.00017580192,0.00010345301,0.00013979716,0.0005209913,0.000088176916,0.000076478806],"category_scores_gemma":[0.0000312592,0.000109094326,0.000035815607,0.00060749537,0.0000377764,0.00067134376,0.00010325002,0.00010724817,0.0000095083415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023933108,0.00017190423,0.007123896,0.0000943987,0.00005109062,0.000007321753,0.0066046966,0.92952853,0.0002951248,0.017017791,0.006673761,0.032407545],"study_design_scores_gemma":[0.00031354433,0.000070770526,0.00019855473,0.00014125468,0.0000036614815,0.000014944964,0.00014371864,0.99798965,0.0004066932,0.0001792675,0.00040872046,0.00012923179],"about_ca_topic_score_codex":0.00015333947,"about_ca_topic_score_gemma":0.00016805327,"teacher_disagreement_score":0.9225346,"about_ca_system_score_codex":0.00016579776,"about_ca_system_score_gemma":0.000032505533,"threshold_uncertainty_score":0.44487375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051006097,0.0004819058,0.956201,0.0007332881,0.00024182312,0.00005517903,2.4231907e-8,0.00008705103,0.037099075],"genre_scores_gemma":[0.9841842,0.000056577977,0.014093017,0.00025870133,0.00005024914,0.00000602783,2.2929432e-7,0.000002614358,0.0013483799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994615,0.00006461956,0.00016160749,0.00011656544,0.000061084116,0.0001346653],"domain_scores_gemma":[0.99952483,0.00004981919,0.000030446117,0.00034925222,0.000021124995,0.000024520365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022335621,0.000046496185,0.00006748936,0.000051599513,0.00005787549,0.00010017659,0.00040541418,0.000039502167,0.00009202084],"category_scores_gemma":[0.0000044407325,0.000041508258,0.000023832228,0.0002350737,0.000008145696,0.00025061576,0.00008030256,0.00010166431,0.000050368955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020120165,0.00008698329,0.0018840539,0.0000031770353,0.000008774603,0.0000073954084,0.0014631023,0.5645971,0.000016961569,0.38641533,0.017300893,0.028214239],"study_design_scores_gemma":[0.00009142337,0.000010939677,0.00020724075,0.000013648379,2.1351529e-7,0.000008162619,0.00003681674,0.9965755,0.000010323614,0.000079733654,0.0029115365,0.00005449057],"about_ca_topic_score_codex":0.000067645306,"about_ca_topic_score_gemma":0.000070980714,"teacher_disagreement_score":0.9790836,"about_ca_system_score_codex":0.000023219925,"about_ca_system_score_gemma":0.0000016032643,"threshold_uncertainty_score":0.16926576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008939216,0.00018636034,0.98606026,0.000106437044,0.0030135333,0.0013329935,0.000060589762,0.00022212253,0.000078470155],"genre_scores_gemma":[0.9907265,0.000033177497,0.008722252,0.000102510036,0.0001255901,0.00018745277,0.000012215602,0.000034946028,0.000055377383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965356,0.00046571737,0.0013447056,0.0007987982,0.0002967115,0.000558468],"domain_scores_gemma":[0.99769855,0.0007498055,0.00038648397,0.0005002013,0.00048233636,0.000182621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011721627,0.00044630282,0.000776591,0.00053882593,0.00022228851,0.0003673019,0.00051444344,0.00035409167,0.000019772402],"category_scores_gemma":[0.00001941513,0.00040720898,0.00020803305,0.0007508186,0.00012466799,0.00055878615,0.0000064031096,0.00050383224,0.000006373851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011830919,0.00040854886,0.000040390743,0.00010166248,0.00025502485,0.000014411027,0.0009041097,0.8626362,0.0041814046,0.0084885,0.0005557595,0.12229566],"study_design_scores_gemma":[0.0015098597,0.0008114146,0.00007167123,0.0008552343,0.000016179461,0.00019566892,0.00027532232,0.99505264,0.00047924303,0.00006519794,0.00026132856,0.000406249],"about_ca_topic_score_codex":0.00017383459,"about_ca_topic_score_gemma":0.000086222484,"teacher_disagreement_score":0.98178726,"about_ca_system_score_codex":0.00033524464,"about_ca_system_score_gemma":0.00012634794,"threshold_uncertainty_score":0.999838},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008567895,0.000029549621,0.98549336,0.0004525662,0.0019245765,0.0004446996,0.0000027357623,0.0004096511,0.0026749738],"genre_scores_gemma":[0.7757626,2.1220649e-7,0.22248939,0.00018107868,0.00038554263,0.00005447267,0.0000034391394,0.00001114923,0.0011120945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986138,0.000044589615,0.00034669606,0.00043828783,0.00017821102,0.00037845984],"domain_scores_gemma":[0.9990501,0.00023619526,0.000078013094,0.00038084004,0.00018257883,0.00007229978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026404916,0.00015875317,0.00019200149,0.000105679115,0.00016888072,0.00021075358,0.00045819397,0.00007079339,0.000013174267],"category_scores_gemma":[0.000016899516,0.00012845847,0.00013952801,0.00023407006,0.000024618941,0.00008003873,0.0000933192,0.00006409734,0.00005290278],"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.000018876071,0.00042992784,0.00007234731,0.00003557604,0.00005568319,0.00001600062,0.0003923079,0.11519104,0.0025513861,0.82669026,0.024239874,0.030306725],"study_design_scores_gemma":[0.0007393512,0.00006505045,0.0001484968,0.000013036719,0.000003321173,0.000020598363,0.00003689148,0.9892682,0.0011014742,0.00028003863,0.008131215,0.00019233981],"about_ca_topic_score_codex":0.00027302647,"about_ca_topic_score_gemma":0.000042500003,"teacher_disagreement_score":0.87407714,"about_ca_system_score_codex":0.00008003717,"about_ca_system_score_gemma":0.000019115396,"threshold_uncertainty_score":0.5238384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12754714,0.00005496609,0.86160725,0.0008988255,0.00030334623,0.00011972942,2.2380034e-7,0.00022453893,0.009243961],"genre_scores_gemma":[0.95716864,0.0000010798099,0.041218735,0.0007393824,0.00010433207,0.000017465934,3.4432492e-7,0.0000062528857,0.00074376725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897563,0.00006887451,0.00018297965,0.0003393662,0.00019448476,0.00023864355],"domain_scores_gemma":[0.9991798,0.0000571699,0.000053189484,0.00052834826,0.000097924036,0.00008360806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002536112,0.00011165752,0.00013852897,0.00004796834,0.00011190008,0.0001598908,0.0003357502,0.00004700038,0.0002667849],"category_scores_gemma":[0.00001199241,0.0000764516,0.000051670842,0.00037123228,0.000024955676,0.00020266735,0.00003582016,0.000096182914,0.00011872335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012160913,0.0020724072,0.06734224,0.0003666846,0.00033547505,0.00027705551,0.006750496,0.44019336,0.0038684271,0.23467825,0.058829848,0.18516415],"study_design_scores_gemma":[0.0002875155,0.00010183703,0.00024488615,0.000015466067,0.0000019061494,0.00002096542,0.000030768475,0.9956357,0.00048766987,0.00009881527,0.002931313,0.00014317142],"about_ca_topic_score_codex":0.00008592601,"about_ca_topic_score_gemma":0.000091012145,"teacher_disagreement_score":0.8296215,"about_ca_system_score_codex":0.000041835592,"about_ca_system_score_gemma":0.000020016463,"threshold_uncertainty_score":0.31176057},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5213938,0.000019383517,0.4763827,0.00009445478,0.00065829797,0.00013306252,8.276923e-7,0.000058418627,0.0012590826],"genre_scores_gemma":[0.96929514,6.924426e-7,0.030449875,0.00002943973,0.00017483023,0.0000026712119,0.0000010710324,0.0000037273737,0.000042557236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857205,0.000043798234,0.00055253657,0.0003111617,0.00015847078,0.0003619562],"domain_scores_gemma":[0.99947244,0.000045872344,0.00013338686,0.00018500119,0.00009984943,0.00006347725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009116234,0.000115953095,0.00020815151,0.000050176954,0.00007735193,0.00006867788,0.000287457,0.00010779126,0.0000027164633],"category_scores_gemma":[0.00003375968,0.00010486446,0.00010024951,0.000725193,0.00003349198,0.00032346326,0.00006675297,0.00009177704,0.0000010768207],"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.00022192897,0.0002804783,0.019716885,0.00007265748,0.000058755162,0.000016347116,0.0017826224,0.052666795,0.0015069167,0.80669016,0.00030544208,0.11668102],"study_design_scores_gemma":[0.0007790308,0.0001317646,0.012032578,0.0001314622,0.0000061037467,0.00016527387,0.00039432032,0.98126465,0.00033991874,0.0044030915,0.00013290439,0.00021891577],"about_ca_topic_score_codex":0.0003948689,"about_ca_topic_score_gemma":0.00035133405,"teacher_disagreement_score":0.92859787,"about_ca_system_score_codex":0.00028695675,"about_ca_system_score_gemma":0.00005425886,"threshold_uncertainty_score":0.42762488},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006484615,0.00022897113,0.9917863,0.0004083545,0.0011988061,0.00016512637,1.2258549e-7,0.00016899397,0.0059784628],"genre_scores_gemma":[0.73758084,0.0000064301285,0.25784832,0.00092671026,0.00025325047,0.000048787602,3.357897e-7,0.000006960941,0.003328341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989892,0.0001657402,0.00020808537,0.000274341,0.00006841536,0.00029421595],"domain_scores_gemma":[0.9988919,0.0006636451,0.00005334286,0.00025898765,0.00007013583,0.00006202612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006656783,0.0000932647,0.00017126749,0.000045009765,0.000121130164,0.00008543018,0.00034767334,0.000093606395,0.0000910356],"category_scores_gemma":[0.00003482103,0.000074840566,0.000090992806,0.00016519148,0.000022785505,0.00015607355,0.00006180107,0.000080773636,0.000028097647],"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.000017851722,0.00006888169,0.00013780678,0.000016375912,0.0000870742,0.000017729904,0.00097341253,0.113495015,0.00034661638,0.45360065,0.1680995,0.2631391],"study_design_scores_gemma":[0.00018376863,0.0001056925,0.0000070683445,0.000008451747,0.0000025880784,0.000049470804,0.000047168603,0.9820166,0.00020591039,0.0012799372,0.015990697,0.000102620026],"about_ca_topic_score_codex":0.000017087452,"about_ca_topic_score_gemma":0.000020436464,"teacher_disagreement_score":0.86852163,"about_ca_system_score_codex":0.000025474486,"about_ca_system_score_gemma":0.000004688374,"threshold_uncertainty_score":0.30519098},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015343181,0.00020195181,0.87717843,0.004010153,0.003306625,0.00018910418,7.6460424e-7,0.0006089705,0.09916081],"genre_scores_gemma":[0.9707157,0.000021592501,0.006681634,0.0014700439,0.0004077864,0.000014780692,9.195338e-7,0.0000103430975,0.020677213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986174,0.00007513917,0.0003136103,0.0004089344,0.00024682214,0.00033810528],"domain_scores_gemma":[0.9990276,0.000069516915,0.00006956911,0.00064601435,0.00008770327,0.00009956062],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018857824,0.00015150486,0.00020900366,0.00007060913,0.00014466507,0.00024374195,0.0005647532,0.000093268565,0.0010653471],"category_scores_gemma":[0.000014515065,0.00012184581,0.00008836349,0.00033979863,0.000020597134,0.00044336836,0.00016270751,0.0001320696,0.0014484568],"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.000003214202,0.00014295646,0.0005738369,0.000013282981,0.000051620915,0.00004644236,0.0011520692,0.0003325013,0.00030573382,0.6804207,0.27093714,0.046020504],"study_design_scores_gemma":[0.000880331,0.00026685366,0.0011879967,0.000049573337,0.0000063948396,0.00016124849,0.00008027151,0.7081253,0.0013125296,0.005235326,0.2820721,0.00062210154],"about_ca_topic_score_codex":0.00023324197,"about_ca_topic_score_gemma":0.000084684594,"teacher_disagreement_score":0.9553725,"about_ca_system_score_codex":0.000052152947,"about_ca_system_score_gemma":0.000008697817,"threshold_uncertainty_score":0.9998478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29515037,0.000046367593,0.70320773,0.0002229252,0.00020867084,0.0004639222,9.207998e-7,0.00024917288,0.0004499209],"genre_scores_gemma":[0.9661781,0.000009067929,0.032302897,0.00014931364,0.00011740369,0.00004778765,0.0000037794644,0.000011616672,0.0011800191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998947,0.00012235552,0.00018917954,0.0003998026,0.00013108575,0.00021053078],"domain_scores_gemma":[0.9991326,0.00030599243,0.00007511286,0.00032726125,0.000072326424,0.00008674725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040053888,0.00013718013,0.00016193501,0.00008796887,0.00031056826,0.00017072243,0.00031744453,0.000074552525,0.000021149926],"category_scores_gemma":[0.00001956788,0.00011046104,0.000043275493,0.00013598554,0.000038961054,0.00044195307,0.000014116155,0.00005198054,0.000051734773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080068526,0.002121706,0.0007770518,0.00010519466,0.00037493982,0.000053892345,0.026308391,0.2972286,0.25322485,0.05054722,0.14671186,0.22174561],"study_design_scores_gemma":[0.00031628666,0.0006589908,0.00061576016,0.000018255932,0.0000044124213,0.00005554303,0.000043573975,0.9689977,0.028370293,0.0002676493,0.00044719188,0.00020432594],"about_ca_topic_score_codex":0.000007507184,"about_ca_topic_score_gemma":0.0000010064593,"teacher_disagreement_score":0.6717691,"about_ca_system_score_codex":0.000020607322,"about_ca_system_score_gemma":0.00003222624,"threshold_uncertainty_score":0.45044705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01807251,0.00016698784,0.95323235,0.0008689695,0.0010968886,0.00025380403,9.606409e-7,0.00017513338,0.026132377],"genre_scores_gemma":[0.9197892,0.000007890942,0.04465491,0.00083447515,0.00044573308,0.000075303404,6.853298e-7,0.0000089199175,0.0341829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990996,0.00002244064,0.00019807619,0.00029549553,0.00011798789,0.00026638067],"domain_scores_gemma":[0.99941564,0.000042241132,0.000050638377,0.00033500954,0.00008043409,0.00007604006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016709401,0.00010746388,0.00012642551,0.000042269585,0.000111429574,0.00018339582,0.00041348962,0.00006366823,0.00022586377],"category_scores_gemma":[0.0000066650923,0.00008406109,0.000104029015,0.00014326494,0.000013038459,0.00029415634,0.00006131276,0.000058667643,0.00021277582],"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.000015134783,0.00038454638,0.0009868024,0.000114283845,0.00007641289,0.000025159288,0.0034346916,0.004862643,0.024514114,0.4612236,0.4342244,0.07013821],"study_design_scores_gemma":[0.00034257196,0.00011894204,0.000022785023,0.000008077412,0.000002865949,0.00002715058,0.000021515598,0.90965265,0.009206842,0.0018098538,0.07858986,0.0001968978],"about_ca_topic_score_codex":0.00004470528,"about_ca_topic_score_gemma":0.000026426333,"teacher_disagreement_score":0.90857744,"about_ca_system_score_codex":0.00003298991,"about_ca_system_score_gemma":0.000010666874,"threshold_uncertainty_score":0.34279117},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013753088,0.00007686579,0.9848909,0.000024410998,0.00030957838,0.00020677371,0.000003319397,0.00003522995,0.000699849],"genre_scores_gemma":[0.99795717,0.000004790148,0.0013031671,0.000025074176,0.000034466317,0.000023586404,0.0000027771855,0.0000037159705,0.00064524426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989142,0.000037376794,0.0004575304,0.00022459784,0.00019767064,0.00016863769],"domain_scores_gemma":[0.99917936,0.0002087563,0.00015446224,0.00022217253,0.0002062145,0.000029020286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044789814,0.00008234272,0.0002577403,0.00019897067,0.00004684891,0.000060458122,0.00019078249,0.000047500296,0.000005667686],"category_scores_gemma":[0.000025453157,0.00007042962,0.00008948656,0.0006806521,0.000009583841,0.00021501971,0.00002985317,0.000044669727,0.000001881509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011061396,0.000021364007,0.00031456948,0.000021616084,0.000047847123,1.1276976e-7,0.00061515457,0.9745662,0.000003195514,0.022068854,0.00003558586,0.0023043465],"study_design_scores_gemma":[0.00022057148,0.00003054574,0.00018887727,0.000040386894,0.000032198197,4.634482e-7,0.000058619495,0.999291,0.000002982666,0.000030204867,0.000018167395,0.00008595187],"about_ca_topic_score_codex":0.00022678774,"about_ca_topic_score_gemma":0.00011855292,"teacher_disagreement_score":0.9842041,"about_ca_system_score_codex":0.00012227306,"about_ca_system_score_gemma":0.0000143446805,"threshold_uncertainty_score":0.28720364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015764438,0.000013982879,0.97145903,0.0010680746,0.00035751573,0.0046841796,4.005281e-7,0.00022218017,0.006430193],"genre_scores_gemma":[0.9855831,0.0000017671167,0.011314166,0.0006942488,0.00033766375,0.0011870319,7.5225387e-7,0.000012209392,0.00086901133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846,0.00014506669,0.00040185486,0.0004411086,0.00017623344,0.00037574512],"domain_scores_gemma":[0.9994135,0.00009677319,0.00008203444,0.0002458037,0.000048463837,0.00011341833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326889,0.0001477225,0.00021659411,0.00012736376,0.00016679864,0.00019791166,0.00018974241,0.00009933953,0.00013230617],"category_scores_gemma":[0.000018366689,0.00013234664,0.000046417834,0.0005423762,0.000011230345,0.00027758477,0.00003532687,0.00021485846,0.00003080106],"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.00012743782,0.00022406594,0.006706635,0.00018138836,0.00007173608,0.00007700892,0.016439514,0.4071331,0.0053488184,0.026053261,0.011281616,0.5263554],"study_design_scores_gemma":[0.0011552732,0.0011864034,0.001158925,0.0004939615,0.000007085193,0.00034115175,0.000210054,0.9660848,0.0012965926,0.0017370259,0.025689192,0.0006395269],"about_ca_topic_score_codex":0.00016242101,"about_ca_topic_score_gemma":0.00041059928,"teacher_disagreement_score":0.9698187,"about_ca_system_score_codex":0.000062251806,"about_ca_system_score_gemma":0.000009791764,"threshold_uncertainty_score":0.53969395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9004297,0.0007171402,0.038724046,0.0024557747,0.006320524,0.0001715195,0.00017865334,0.00038651034,0.050616093],"genre_scores_gemma":[0.9882039,0.00035701483,0.0041750926,0.0043213493,0.0020999692,0.0002825329,0.000087362045,0.0003552395,0.00011757116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9850741,0.0011232303,0.0025759952,0.0031255104,0.004660649,0.003440519],"domain_scores_gemma":[0.98886317,0.003362387,0.0021381055,0.0036933231,0.0005444993,0.0013985371],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0061445106,0.0013177712,0.00066904357,0.00055244187,0.003541946,0.0033510185,0.007350757,0.001814364,0.005958973],"category_scores_gemma":[0.0014883475,0.0016407961,0.0022616691,0.0030588822,0.006619031,0.0019129497,0.004071979,0.0026060422,0.0014868667],"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.0008029865,0.0005009214,0.000011040354,0.0003420841,0.00052284903,0.00040014807,0.0028801148,0.011067638,0.0017731689,0.95309716,0.025451947,0.0031499292],"study_design_scores_gemma":[0.0012460604,0.0028803528,0.000110739216,0.0016798968,0.00049419596,0.0013516985,0.0006716944,0.7500006,0.22027476,0.018653477,0.0010711426,0.001565385],"about_ca_topic_score_codex":0.00077221385,"about_ca_topic_score_gemma":0.00025173812,"teacher_disagreement_score":0.9344437,"about_ca_system_score_codex":0.00005117849,"about_ca_system_score_gemma":0.001457325,"threshold_uncertainty_score":0.9999574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34333503,0.00003540175,0.6552735,0.00004122331,0.00058328087,0.00042341457,0.000010000382,0.00009900577,0.0001991779],"genre_scores_gemma":[0.99651676,0.000011693483,0.0025384112,0.00013909246,0.00014712465,0.00000422158,0.000011716489,0.000019671736,0.0006112942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981568,0.00013096162,0.0003176661,0.00091238634,0.0000657629,0.0004164634],"domain_scores_gemma":[0.99865156,0.00019555107,0.00028185136,0.0006029195,0.0001498565,0.0001182366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003613185,0.00029063039,0.00040452092,0.00026675756,0.00015921264,0.00023853489,0.00076909654,0.0002946248,0.000007737429],"category_scores_gemma":[0.000036707028,0.0003380255,0.00016940538,0.0002602954,0.000053245934,0.0001749022,0.00072407746,0.00034921544,0.000027767122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027285547,0.00009071018,0.0054491097,0.00030702326,0.000094799994,0.0002639939,0.0005906872,0.9633446,0.00014620596,0.028195702,0.000508681,0.0009812076],"study_design_scores_gemma":[0.0005258408,0.000053671625,0.00024496185,0.00021714918,0.000014337826,0.0000084153,0.000032783053,0.9940347,0.00003299836,0.003905804,0.0005647287,0.00036462623],"about_ca_topic_score_codex":0.00027302039,"about_ca_topic_score_gemma":0.00004434317,"teacher_disagreement_score":0.65318173,"about_ca_system_score_codex":0.00019509555,"about_ca_system_score_gemma":0.00009258597,"threshold_uncertainty_score":0.9999072},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004603004,0.000025215435,0.85483193,0.010187254,0.0004389737,0.000111204485,8.418635e-8,0.00014389452,0.12965845],"genre_scores_gemma":[0.98481286,0.0000022775282,0.0007159441,0.0009907376,0.00006162859,0.000012011968,5.1252417e-8,0.0000015005986,0.013402984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966246,0.000029132321,0.00006855515,0.00009806634,0.00007541095,0.000066370565],"domain_scores_gemma":[0.9995357,0.00010598397,0.000020046846,0.00030410083,0.000020218935,0.00001395318],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010957762,0.000031767293,0.000027287513,0.000015352149,0.00008071992,0.000078319805,0.0002741913,0.000015742185,0.0002929441],"category_scores_gemma":[0.000011980609,0.000016828071,0.000023126493,0.000100246005,0.0000050505964,0.00007012928,0.000023330127,0.00003839295,0.0012573844],"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":[1.6009294e-7,0.00000946984,0.000009341112,2.9598937e-7,0.000001396693,1.9104206e-7,0.0001174829,0.00014814053,0.000037295827,0.9161455,0.07923862,0.004292092],"study_design_scores_gemma":[0.000041298757,0.000020277046,0.000074394804,0.0000031286393,2.2947819e-7,0.0000049316204,0.000011679831,0.9670697,0.00018415319,0.0021342058,0.030419888,0.000036111593],"about_ca_topic_score_codex":0.000009573799,"about_ca_topic_score_gemma":0.0000030332644,"teacher_disagreement_score":0.9802099,"about_ca_system_score_codex":0.000009238042,"about_ca_system_score_gemma":7.670623e-7,"threshold_uncertainty_score":0.99952024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0371867,0.000028650054,0.95826066,0.00034848312,0.0021089073,0.00018782767,0.0000033047465,0.000016032844,0.0018594234],"genre_scores_gemma":[0.97726774,0.00000640897,0.02206374,0.000078869525,0.0004932189,0.0000056329154,0.0000037682348,0.000007900648,0.00007270346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860644,0.00005129661,0.0007869999,0.00015243194,0.0002721246,0.00013071204],"domain_scores_gemma":[0.99771124,0.00038614942,0.0008096338,0.00015813964,0.0008878705,0.000046994584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010498416,0.00008735301,0.00020013002,0.00033784937,0.00004995119,0.00009996696,0.00088413496,0.00007143498,0.0000160137],"category_scores_gemma":[0.0001468958,0.00008374812,0.00011554854,0.00017778235,0.000017409731,0.00029355436,0.000040183688,0.00021641055,0.0000023502405],"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.000052548658,0.00022712242,0.00081141625,0.00003525269,0.00013365841,0.000009236555,0.0011739687,0.028347982,0.030960057,0.7004924,0.000693577,0.23706278],"study_design_scores_gemma":[0.0017501751,0.0002102018,0.00032101633,0.00035210967,0.000010084084,0.00037488167,0.0004184833,0.91228527,0.032357123,0.016869102,0.0348142,0.00023734351],"about_ca_topic_score_codex":0.000024623454,"about_ca_topic_score_gemma":0.00003312576,"teacher_disagreement_score":0.94008106,"about_ca_system_score_codex":0.000049374128,"about_ca_system_score_gemma":0.00007535259,"threshold_uncertainty_score":0.34151495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03279391,0.00002496674,0.94570595,0.000096138814,0.0003433374,0.00009348545,3.771601e-8,0.00003662278,0.020905552],"genre_scores_gemma":[0.9788446,0.000022585902,0.020266093,0.00023427747,0.000013455416,0.0000086389455,2.1766695e-7,0.0000022892386,0.0006078373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995435,0.00003207884,0.000115005096,0.00014008928,0.000057021203,0.00011231734],"domain_scores_gemma":[0.99979264,0.00001703068,0.000022489261,0.00011782722,0.000020918122,0.000029114786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021875386,0.00004842105,0.000060904214,0.00005205843,0.000037369984,0.00008149751,0.00008980095,0.000028069628,0.000019064875],"category_scores_gemma":[0.000006429901,0.0000408234,0.000008904117,0.0001693993,0.000007144181,0.00033380825,0.000018864594,0.000042468473,0.000007678662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009776517,0.00008871055,0.06806865,0.000038146747,0.000016129028,0.000011742919,0.0034354539,0.6040526,0.00004148897,0.21999319,0.0025145863,0.10172952],"study_design_scores_gemma":[0.00017453586,0.0000249978,0.0013627728,0.000012204849,2.934741e-7,0.0000186571,0.00005189336,0.99693006,0.00009853173,0.000026806145,0.0012361404,0.00006310464],"about_ca_topic_score_codex":0.000018161714,"about_ca_topic_score_gemma":0.0000215614,"teacher_disagreement_score":0.9460507,"about_ca_system_score_codex":0.00002108246,"about_ca_system_score_gemma":0.000010366966,"threshold_uncertainty_score":0.166473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10391378,0.000022110988,0.89507776,0.00024641474,0.00013880749,0.00013623554,1.7518839e-7,0.00003415353,0.000430541],"genre_scores_gemma":[0.94633234,0.0000032909816,0.053441994,0.00011231547,0.000027128339,0.000007840417,2.9454793e-7,0.0000024196422,0.0000724004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994764,0.000027502161,0.00015570718,0.0001481321,0.00008903233,0.00010324048],"domain_scores_gemma":[0.999713,0.000027237318,0.000052024006,0.00013579984,0.000044479202,0.000027431179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017090417,0.00005496164,0.0000801784,0.000039393795,0.00004977022,0.000054200198,0.00012880408,0.000024683563,0.00002238542],"category_scores_gemma":[0.0000021976466,0.000042973203,0.000019198029,0.00010647715,0.0000136552235,0.000121335084,0.00003723211,0.00003624894,0.0000036454019],"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.000036821733,0.000083870334,0.0003506805,0.000086424974,0.000084304425,0.0000071847967,0.027066717,0.08220411,0.28101844,0.38499996,0.00088988146,0.2231716],"study_design_scores_gemma":[0.0019623858,0.0006147021,0.002285746,0.000053631797,0.000005855972,0.00006228458,0.00074165495,0.01367263,0.9476587,0.032034457,0.0006085153,0.00029943237],"about_ca_topic_score_codex":0.00015247104,"about_ca_topic_score_gemma":0.00006925237,"teacher_disagreement_score":0.84241855,"about_ca_system_score_codex":0.000014301659,"about_ca_system_score_gemma":0.000027990816,"threshold_uncertainty_score":0.17523964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05437281,0.00006804951,0.9417692,0.00017650213,0.00040890623,0.0005104915,0.000004374832,0.00013532642,0.002554387],"genre_scores_gemma":[0.99424744,0.000013560949,0.0034834824,0.0007442322,0.00015223603,0.000019633695,0.000011366035,0.000005335481,0.0013227239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990271,0.0000043606915,0.00030054647,0.00024547137,0.00016450173,0.0002580465],"domain_scores_gemma":[0.9993755,0.00013836315,0.00009528687,0.00022288818,0.0000924478,0.00007550205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024691233,0.00014030798,0.00017489457,0.000064195854,0.00020797859,0.00019101391,0.00020449441,0.00007297838,0.000011612437],"category_scores_gemma":[0.00001823318,0.0000982841,0.000052032727,0.00009566723,0.000011463618,0.00044782285,0.00003611062,0.00006695668,0.000009267819],"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.00047500938,0.00028426328,0.00060599385,0.00020846754,0.00009049817,0.00006799288,0.010793374,0.062392958,0.0024348292,0.52762395,0.06831533,0.32670736],"study_design_scores_gemma":[0.00079196255,0.0005036067,0.000051595845,0.00003531081,0.000004176306,0.000100406476,0.00015239538,0.9820814,0.00027797685,0.006015245,0.009819799,0.00016611248],"about_ca_topic_score_codex":0.000010771042,"about_ca_topic_score_gemma":0.00009920675,"teacher_disagreement_score":0.93987465,"about_ca_system_score_codex":0.000036968802,"about_ca_system_score_gemma":0.000013245371,"threshold_uncertainty_score":0.40079093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005326303,0.00033172462,0.9498573,0.004403009,0.0004404923,0.00014631715,3.9032196e-7,0.0002986369,0.03919584],"genre_scores_gemma":[0.9725222,0.00002340911,0.024807874,0.001118352,0.00007536325,0.00001760742,0.0000017130861,0.000007294563,0.0014261787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990465,0.00008027874,0.00022885503,0.00024977408,0.0001484207,0.00024615842],"domain_scores_gemma":[0.99891114,0.00008023339,0.00006105647,0.00078969734,0.000079577825,0.00007831598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026475274,0.00011158375,0.00013721244,0.00010927456,0.00018162242,0.00023169267,0.0010035265,0.000060618782,0.000106891806],"category_scores_gemma":[0.000024553854,0.00008837109,0.00008614949,0.00043237995,0.000029767054,0.00028199927,0.00024390385,0.0001817869,0.0002842677],"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.000005150032,0.00011383604,0.00012273953,0.000012994168,0.00003618665,0.000008075894,0.0020141208,0.00992166,0.00015742844,0.9517877,0.0062563904,0.029563688],"study_design_scores_gemma":[0.006554178,0.0007921362,0.0011982395,0.00076792925,0.000029859377,0.0013818135,0.0013026341,0.16980033,0.010944885,0.39675903,0.40818256,0.0022863902],"about_ca_topic_score_codex":0.00027091705,"about_ca_topic_score_gemma":0.00019496448,"teacher_disagreement_score":0.9671959,"about_ca_system_score_codex":0.00008368773,"about_ca_system_score_gemma":0.00004950782,"threshold_uncertainty_score":0.3653781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045454603,0.000035438217,0.9027513,0.00024552125,0.0011041211,0.00015996039,1.7628767e-7,0.000058767884,0.050190073],"genre_scores_gemma":[0.9985838,0.0000032511828,0.00027886473,0.00008520019,0.000046904224,0.000009333466,1.1129419e-7,0.0000027885449,0.000989761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993906,0.0001129938,0.000120610275,0.00013298276,0.00012421129,0.000118612545],"domain_scores_gemma":[0.9991485,0.00040616732,0.00003940829,0.0003268758,0.00005689537,0.00002217735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069948,0.000055408695,0.000082731385,0.00001989894,0.00010517829,0.000057399782,0.000371901,0.000027339516,0.0000023033529],"category_scores_gemma":[0.000019734634,0.000030917217,0.000056140987,0.0001311632,0.000021405158,0.000089380315,0.00005101649,0.00005217272,0.000033811983],"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.00001826637,0.00001652901,0.00007718266,0.000009001923,0.000011113846,0.0000012428976,0.00006583665,0.0068065496,0.00035759903,0.99008757,0.00022350893,0.0023256207],"study_design_scores_gemma":[0.00743317,0.004804313,0.04975663,0.0017150627,0.000021682778,0.00022900096,0.00037686073,0.17577338,0.3963689,0.30405667,0.058005404,0.0014588973],"about_ca_topic_score_codex":0.000079556645,"about_ca_topic_score_gemma":0.00003437537,"teacher_disagreement_score":0.9531292,"about_ca_system_score_codex":0.000034773882,"about_ca_system_score_gemma":0.000022303742,"threshold_uncertainty_score":0.12607674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003435129,0.000007786294,0.96181786,0.00018130391,0.0032528436,0.000057852456,2.423597e-7,0.00023317397,0.031013785],"genre_scores_gemma":[0.89276177,4.8571985e-7,0.10437608,0.0002959851,0.00055983086,0.000006619041,5.393313e-7,0.000005575077,0.0019931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992526,0.000019059187,0.00017019048,0.00022979475,0.00013021498,0.0001981448],"domain_scores_gemma":[0.9994136,0.000054827517,0.000038673108,0.00034434823,0.00007478812,0.00007377147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027010156,0.000078870355,0.000087385626,0.00004101359,0.000110687644,0.00017677288,0.0003984793,0.000057699646,0.00012785206],"category_scores_gemma":[0.000014417889,0.000063116764,0.000046227826,0.00016235618,0.000013579521,0.0002678195,0.00010461255,0.00018455987,0.00018058825],"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":[2.8306013e-7,0.000027890177,0.00048773945,0.0000017771368,0.000007151619,0.000018043604,0.00021889321,0.000041154773,0.0041485648,0.038456637,0.003954964,0.9526369],"study_design_scores_gemma":[0.00006631507,0.000028604762,0.00031289077,0.000004729145,7.931331e-7,0.0001631368,0.000014861266,0.9739252,0.0007414218,0.0006846315,0.023940505,0.000116910574],"about_ca_topic_score_codex":0.00010579036,"about_ca_topic_score_gemma":0.00008274008,"teacher_disagreement_score":0.97388405,"about_ca_system_score_codex":0.000006739,"about_ca_system_score_gemma":0.000014301128,"threshold_uncertainty_score":0.2573827},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011430826,0.00022049258,0.9955792,0.00001255834,0.00056447386,0.00031933823,9.707769e-8,0.00008995685,0.0020707971],"genre_scores_gemma":[0.8060671,0.000007396727,0.19290182,0.00013623462,0.000076043034,0.000012684873,1.2135747e-7,0.000010059575,0.000788527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985788,0.0003159731,0.0003318472,0.00027523356,0.00019335696,0.0003047948],"domain_scores_gemma":[0.9991777,0.00015388902,0.00016254565,0.00029549978,0.00014734954,0.000063050524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009606984,0.00013260408,0.00020872557,0.00007212353,0.000112994305,0.000076445634,0.00030795974,0.00007703078,0.00005132099],"category_scores_gemma":[0.000028390135,0.00010624351,0.000054580796,0.00048417176,0.000020366797,0.00029558394,0.00003306795,0.00007981375,0.0000103352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014155873,0.000038455873,0.00007836601,0.000020315341,0.000027772265,0.000005279676,0.00055781694,0.9789617,0.0022301145,0.012561102,0.0048117507,0.0006931414],"study_design_scores_gemma":[0.00020314235,0.00013680471,0.000013086637,0.000076983415,0.0000054467646,0.000041948937,0.000040529878,0.9902168,0.0057460805,0.0025939452,0.00074990344,0.00017530753],"about_ca_topic_score_codex":0.000019888634,"about_ca_topic_score_gemma":0.0000030726721,"teacher_disagreement_score":0.804924,"about_ca_system_score_codex":0.000039627626,"about_ca_system_score_gemma":0.00012397733,"threshold_uncertainty_score":0.43324846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019952634,0.00003616524,0.9757542,0.00023705576,0.00030072566,0.0005873004,0.0000022179288,0.00050542725,0.0026242526],"genre_scores_gemma":[0.9478672,0.0000066725165,0.051583614,0.00026597246,0.00012962858,0.00004921086,0.000004300458,0.000013570054,0.000079786536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879074,0.00006633901,0.00034178933,0.00039039718,0.00016914161,0.00024159114],"domain_scores_gemma":[0.9990399,0.0001831193,0.00018630197,0.00036291892,0.00014665768,0.000081104336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015622648,0.00020569768,0.0002621957,0.00021110839,0.00008163045,0.0004406389,0.00042277566,0.00011199726,0.0000018094729],"category_scores_gemma":[0.000017434253,0.0001769763,0.000087743596,0.00028762204,0.00007824661,0.00066250114,0.00021343361,0.00019524009,0.0000053828644],"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.00002200387,0.00016615594,0.0009842733,0.000061728795,0.00009914576,0.000008855522,0.0025099674,0.0036344172,0.0007983313,0.03193384,0.008064941,0.95171636],"study_design_scores_gemma":[0.0007445259,0.0010240173,0.0065319613,0.0009006414,0.0000075506687,0.00017299468,0.00022870043,0.9596372,0.006153593,0.016112426,0.0075222985,0.00096408476],"about_ca_topic_score_codex":0.00005318378,"about_ca_topic_score_gemma":0.000002313153,"teacher_disagreement_score":0.9560028,"about_ca_system_score_codex":0.0000406384,"about_ca_system_score_gemma":0.000014996257,"threshold_uncertainty_score":0.72168845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57820433,0.0000046162,0.41974896,0.0013116233,0.00024252516,0.00012675134,0.0000030795427,0.00006544802,0.00029266675],"genre_scores_gemma":[0.99551415,5.5445315e-7,0.0030944902,0.0012377696,0.000051605224,0.00002368083,0.00006189819,0.0000048451684,0.000011013172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988927,0.000029124727,0.00048470448,0.00013520241,0.00028235718,0.00017586273],"domain_scores_gemma":[0.9992297,0.000013356788,0.00037762642,0.00014601811,0.00019544282,0.000037803922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024224978,0.00011406251,0.00014917318,0.00030559846,0.00011008789,0.00011532411,0.00019525633,0.000054804732,0.00000395926],"category_scores_gemma":[0.000009700188,0.0000996684,0.00002481456,0.0005420279,0.000033876393,0.0029686252,0.00001416053,0.00019799275,0.00001587633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086912216,0.000074587326,0.0008986866,0.00029351015,0.000025089039,0.00000733771,0.0062369257,0.90232366,0.06847867,0.006080934,0.000071408664,0.015422289],"study_design_scores_gemma":[0.009173035,0.00043055648,0.020489337,0.005083078,0.000023902101,0.0012123307,0.00041458537,0.8520763,0.10575346,0.0005634428,0.0032642582,0.001515748],"about_ca_topic_score_codex":0.00012284193,"about_ca_topic_score_gemma":0.000020659356,"teacher_disagreement_score":0.41730982,"about_ca_system_score_codex":0.00012691479,"about_ca_system_score_gemma":0.00014762359,"threshold_uncertainty_score":0.40643597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06356813,0.000043021955,0.8806397,0.0005851516,0.0006953947,0.00006652516,4.647127e-8,0.00012285274,0.054279175],"genre_scores_gemma":[0.98877215,9.411498e-7,0.010147185,0.00032190714,0.00007562609,0.0000049420278,8.3439666e-8,0.0000025390493,0.00067461916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994334,0.000017276232,0.00014819387,0.00016046195,0.00008225865,0.00015841029],"domain_scores_gemma":[0.99973786,0.000020147312,0.000023369226,0.0001640089,0.000025280455,0.000029330384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016355343,0.000050554692,0.00007060401,0.000056803452,0.00003654408,0.00009468722,0.0002312934,0.000028592629,0.000025251928],"category_scores_gemma":[0.00001290552,0.000042325028,0.000023136558,0.00026425128,0.000005125265,0.00022667812,0.00005029714,0.000063030544,0.0000810777],"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.000003915722,0.00008701734,0.0017196002,0.000010878267,0.000007786772,0.000085820466,0.0034347782,0.021555604,0.00046203827,0.867187,0.0010165933,0.10442893],"study_design_scores_gemma":[0.005375284,0.0008573803,0.015250059,0.000566138,0.0000037630848,0.0007361788,0.0014635818,0.86493456,0.0028498108,0.047601923,0.058883704,0.0014775884],"about_ca_topic_score_codex":0.00096586265,"about_ca_topic_score_gemma":0.0006286752,"teacher_disagreement_score":0.92520404,"about_ca_system_score_codex":0.00004852021,"about_ca_system_score_gemma":0.000027172575,"threshold_uncertainty_score":0.17259645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09762963,0.0000629672,0.89707947,0.00023156701,0.003354372,0.00032509305,0.0000018762216,0.00023733557,0.0010776692],"genre_scores_gemma":[0.96423787,0.00006575259,0.033679407,0.00035411344,0.00094552926,0.00008328157,0.0000010802385,0.000035769266,0.0005972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979912,0.000035716235,0.00045986552,0.00056006265,0.0003582604,0.0005948959],"domain_scores_gemma":[0.99859786,0.00034966337,0.00014357654,0.00064341986,0.00013656693,0.00012892378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032635627,0.00029299472,0.00033605896,0.00019117154,0.00077141705,0.00017172891,0.00083259767,0.00012974959,0.000009028638],"category_scores_gemma":[0.0000063177617,0.00025045004,0.000193219,0.00050414447,0.00008712548,0.00041206836,0.000011137236,0.000406261,0.000021757529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012855079,0.0006752868,0.0034161538,0.00019438403,0.0006269393,0.00014350818,0.0059051486,0.61630946,0.0015327466,0.002149784,0.0028510808,0.36491],"study_design_scores_gemma":[0.0017998647,0.0011680534,0.0004009744,0.00073442445,0.000048304246,0.0015304255,0.00017924019,0.9680368,0.006875042,0.00015587495,0.018301936,0.00076907675],"about_ca_topic_score_codex":0.00002209982,"about_ca_topic_score_gemma":0.0000379425,"teacher_disagreement_score":0.86660826,"about_ca_system_score_codex":0.00010813446,"about_ca_system_score_gemma":0.00008061172,"threshold_uncertainty_score":0.99999475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009346603,0.00005736449,0.9870029,0.000075857446,0.0016310904,0.00018569305,9.0912266e-7,0.0003624835,0.0013370956],"genre_scores_gemma":[0.94828635,0.0000016650705,0.050567787,0.00019031967,0.00024179996,0.0000111255795,0.0000015211385,0.000008341603,0.0006911117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990974,0.000040528554,0.00020716448,0.0003005485,0.00011778051,0.00023657917],"domain_scores_gemma":[0.9993944,0.000067516055,0.00005177821,0.00027773078,0.00013086255,0.000077678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026003213,0.000090440124,0.000105125335,0.000117492906,0.0002914412,0.00023931905,0.00026598203,0.000053771473,0.000047167854],"category_scores_gemma":[0.0000071195645,0.000077871395,0.000077524746,0.00035655985,0.000009644545,0.00019741242,0.000022338056,0.000057046607,0.00001905469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013377754,0.00008312969,0.00003541156,0.000004974282,0.00001941216,0.0000027413491,0.0007818154,0.8767383,0.00013973347,0.0104489345,0.0019212331,0.10982299],"study_design_scores_gemma":[0.0002395287,0.00012654302,0.00001441129,0.000010019712,0.000001854098,0.0000133903895,0.0000507583,0.9968465,0.00028834972,0.00013897796,0.0021521254,0.000117554984],"about_ca_topic_score_codex":0.000052129293,"about_ca_topic_score_gemma":0.000006146881,"teacher_disagreement_score":0.93893975,"about_ca_system_score_codex":0.000023297933,"about_ca_system_score_gemma":0.0000035743656,"threshold_uncertainty_score":0.31755033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050186333,0.000009532453,0.89555407,0.00041023578,0.0010160487,0.08528882,0.000004241977,0.000052488966,0.012645938],"genre_scores_gemma":[0.93856984,1.405748e-7,0.006318797,0.0003151537,0.00007820281,0.052936412,8.4942513e-7,0.0000064814362,0.0017741045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920416,0.00010566975,0.00025524216,0.00014092245,0.000099383076,0.00019464554],"domain_scores_gemma":[0.9995307,0.000053333802,0.000088308276,0.00023848291,0.00007354624,0.000015646086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006215584,0.000057524965,0.00009427949,0.000022303879,0.00006499134,0.000046289882,0.00024791606,0.0000309837,0.00007670502],"category_scores_gemma":[0.000012756132,0.000036842837,0.0000546537,0.00029119255,0.0000064020687,0.00015944715,0.00003567197,0.000041152303,0.0000023019925],"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.000017079312,0.000054378834,0.049998637,0.000072004266,0.000017508559,4.694058e-7,0.00090547,0.0059650224,0.00020980928,0.83343923,0.10686658,0.0024537782],"study_design_scores_gemma":[0.0051176003,0.0004691389,0.015355836,0.00019664649,0.0000076202996,0.000022213835,0.0011084022,0.13505165,0.024297448,0.027182011,0.79068285,0.00050856324],"about_ca_topic_score_codex":0.0001103866,"about_ca_topic_score_gemma":0.0011427912,"teacher_disagreement_score":0.93355125,"about_ca_system_score_codex":0.000026714833,"about_ca_system_score_gemma":0.000045704022,"threshold_uncertainty_score":0.15024073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009807278,0.00024331683,0.9610289,0.00052469375,0.0009620042,0.0002315336,0.000011635331,0.00007765808,0.0368222],"genre_scores_gemma":[0.42210415,0.00016559474,0.4800083,0.0026278456,0.001973933,0.00024104519,0.000072852796,0.00004973539,0.09275655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999103,0.000032694305,0.00019384031,0.0003575239,0.000089157445,0.00022379955],"domain_scores_gemma":[0.99912494,0.0000648011,0.000042006668,0.0006952132,0.000033074703,0.000039977345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024486176,0.000083814695,0.0001303041,0.00008152016,0.000055143155,0.00014865986,0.00090508437,0.000050833605,0.00036115004],"category_scores_gemma":[0.000012172278,0.00006746121,0.000027281096,0.00017879719,0.00000833234,0.00046512994,0.000093831266,0.00006030585,0.000029955248],"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":[6.2914614e-7,0.000015326257,0.000014412698,0.000006756607,0.0000055833875,0.0000028668153,0.00028354194,0.000024296007,0.000011863815,0.0067364103,0.094981454,0.89791685],"study_design_scores_gemma":[0.00028067283,0.000041300475,0.000040691197,0.000009763573,7.8941696e-7,0.000017972356,0.000046949364,0.9159319,0.00007437506,0.000913088,0.08254884,0.00009365803],"about_ca_topic_score_codex":0.00021814812,"about_ca_topic_score_gemma":0.0008628531,"teacher_disagreement_score":0.9159076,"about_ca_system_score_codex":0.000020281377,"about_ca_system_score_gemma":0.000005490447,"threshold_uncertainty_score":0.395434},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040978074,0.00034407192,0.95253557,0.0015956671,0.0004628565,0.00009262152,0.000007226658,0.00010859342,0.0038753252],"genre_scores_gemma":[0.9976267,0.000022369079,0.0016634718,0.00011300651,0.0002854849,0.0000148331965,0.000047387588,0.0000067116925,0.00022000089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878985,0.00003904837,0.0003706514,0.0003712418,0.00017663217,0.00025256752],"domain_scores_gemma":[0.9995303,0.00006730898,0.00014698063,0.00009165208,0.0001122144,0.000051516854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027140343,0.00014582223,0.00015614064,0.00008344932,0.00016707905,0.0006023992,0.00024622836,0.00008445298,0.0000023760326],"category_scores_gemma":[0.000019335788,0.00013574556,0.000027174854,0.00019595417,0.000040745897,0.0005432288,0.00015009964,0.00015772122,0.0000012261407],"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.00013644973,0.0003516891,0.28998742,0.00014864346,0.00007959706,0.00018727247,0.0014338046,0.2842764,0.0014495901,0.3704414,0.0040610703,0.047446664],"study_design_scores_gemma":[0.00049568235,0.00001632046,0.014378882,0.00014304522,0.0000027141925,0.00011607668,0.00005491293,0.9819171,0.000012199909,0.0015965876,0.0010908698,0.00017560855],"about_ca_topic_score_codex":0.00027685982,"about_ca_topic_score_gemma":0.000058967827,"teacher_disagreement_score":0.95664865,"about_ca_system_score_codex":0.00005015311,"about_ca_system_score_gemma":0.00002222899,"threshold_uncertainty_score":0.5808949},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015551235,0.000028307968,0.97972506,0.0005175626,0.002573945,0.00037303168,0.0000012944172,0.00025632815,0.014969369],"genre_scores_gemma":[0.9863202,0.0000013015716,0.0061186524,0.0017860447,0.0010970823,0.0000356101,0.0000039366805,0.000013508164,0.0046236813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839264,0.000036628287,0.0003621936,0.0004017769,0.00025158253,0.00055519224],"domain_scores_gemma":[0.9989338,0.00026790748,0.000105133164,0.00046802062,0.00009826377,0.00012689817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010785072,0.0001616848,0.00018342429,0.00007781497,0.0002328096,0.00018784302,0.0005038784,0.00009732965,0.00003359062],"category_scores_gemma":[0.000013628996,0.00012895318,0.00012502707,0.00030987247,0.000013598249,0.00015081099,0.000092894166,0.00011430287,0.000066330445],"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.00011489545,0.00023456868,0.0014050215,0.000026563857,0.00013483416,0.000035200443,0.00076240976,0.057531312,0.00024515856,0.5244189,0.3317653,0.08332587],"study_design_scores_gemma":[0.0011827846,0.0006383734,0.00092703715,0.00012659217,0.000009418981,0.000035396442,0.00012977296,0.7125503,0.0014751268,0.0036577743,0.2786839,0.00058354484],"about_ca_topic_score_codex":0.00002482093,"about_ca_topic_score_gemma":0.000083432,"teacher_disagreement_score":0.98476505,"about_ca_system_score_codex":0.00008866085,"about_ca_system_score_gemma":0.000023305302,"threshold_uncertainty_score":0.52585584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052298058,0.000055967314,0.9431012,0.00017393386,0.00010373446,0.0001089236,0.000012851912,0.0001500199,0.0039953017],"genre_scores_gemma":[0.9942723,0.0000024848703,0.0044282265,0.00006447617,0.000016967595,0.000010281605,0.000009435287,0.0000039603715,0.001191877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907047,0.000036256315,0.000252644,0.0002675111,0.00021023094,0.00016286991],"domain_scores_gemma":[0.9991662,0.00006560178,0.00012339656,0.0004010391,0.00018475762,0.000059031132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011703213,0.000099479184,0.00026723006,0.00020123995,0.000052124782,0.000060200797,0.00039548034,0.000043478347,0.0003395664],"category_scores_gemma":[0.000016986432,0.00006824778,0.00010048317,0.0016952506,0.0000274188,0.00026760506,0.00004542491,0.000054508506,0.00001870717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018217863,0.0025620908,0.118799426,0.00029686364,0.014619566,0.00016060391,0.033572365,0.6767646,0.002839874,0.03191228,0.03685311,0.081437066],"study_design_scores_gemma":[0.0003215019,0.000049690658,0.0030923204,0.000012260435,0.00006705007,0.0000034355182,0.00012517885,0.99504256,0.00083969504,0.000005340634,0.00033022906,0.00011073973],"about_ca_topic_score_codex":0.0001779257,"about_ca_topic_score_gemma":0.00028143797,"teacher_disagreement_score":0.9419742,"about_ca_system_score_codex":0.0000193039,"about_ca_system_score_gemma":0.000005413102,"threshold_uncertainty_score":0.3718014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099717155,0.00019451027,0.8451146,0.00024178138,0.00029607152,0.00004248714,4.268755e-7,0.00007548847,0.05431749],"genre_scores_gemma":[0.99111545,0.000011728356,0.002709683,0.00012266228,0.000050967752,0.0000021582678,3.1161576e-7,0.0000030059196,0.0059840265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992101,0.000034310775,0.00024429781,0.000211929,0.00015349827,0.00014586914],"domain_scores_gemma":[0.9993723,0.000055353055,0.00008446464,0.0003725082,0.00007303623,0.00004230683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017779661,0.000073546435,0.00020431294,0.0001679744,0.00005154516,0.000068382964,0.0003533678,0.00004098304,0.00053650694],"category_scores_gemma":[0.000004267263,0.00005820592,0.00017072956,0.0007536572,0.0000138977275,0.00018508868,0.000067448,0.000049378235,0.000078146084],"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.000019604713,0.0015384643,0.1716203,0.00028247197,0.0046503074,0.00010706144,0.044218313,0.20485158,0.011897662,0.38637823,0.09693142,0.07750458],"study_design_scores_gemma":[0.00007804651,0.000031248157,0.00074150314,0.000006331744,0.000042881235,0.0000032039652,0.000090355,0.9945037,0.0018019851,0.00007276238,0.0025275287,0.000100455014],"about_ca_topic_score_codex":0.0002833,"about_ca_topic_score_gemma":0.000080557846,"teacher_disagreement_score":0.8913983,"about_ca_system_score_codex":0.000017051343,"about_ca_system_score_gemma":0.0000041590224,"threshold_uncertainty_score":0.5874375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6725385,0.00007476096,0.2771437,0.0014228617,0.004588555,0.00031811884,0.0000070167116,0.00011840917,0.043788087],"genre_scores_gemma":[0.9982863,0.0000023642208,0.0013282824,0.0002981322,0.000024256266,0.00000190089,5.448743e-7,8.0367295e-7,0.000057416193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987814,0.000078181016,0.00034229597,0.00009245677,0.00055400695,0.00015170596],"domain_scores_gemma":[0.99910045,0.000041022187,0.00026676673,0.00027472942,0.00026026278,0.00005677811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012379654,0.00006594593,0.000088597015,0.00006932859,0.0001735731,0.0002476637,0.000990121,0.000022084416,0.0000048324005],"category_scores_gemma":[0.0000656888,0.00003890051,0.00005347079,0.000773041,0.00012995828,0.002536326,0.0001420141,0.00005441976,0.000034265744],"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.000025156703,0.00009860757,0.05035235,0.000054253833,0.000040034436,0.0000010796795,0.05397922,0.14730701,0.00018576407,0.6597637,0.054482777,0.033710063],"study_design_scores_gemma":[0.00081726693,0.00025198443,0.006236985,0.00010550502,0.0000035565972,0.00004423248,0.0045522735,0.9326702,0.0017636596,0.0074664378,0.0458207,0.00026722],"about_ca_topic_score_codex":0.00020738044,"about_ca_topic_score_gemma":0.000031042295,"teacher_disagreement_score":0.7853632,"about_ca_system_score_codex":0.00002235474,"about_ca_system_score_gemma":0.00012577027,"threshold_uncertainty_score":0.23882268},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011557005,0.0010474728,0.9882231,0.00018145052,0.0019365726,0.00020727894,0.0000026319115,0.00007359523,0.0071721943],"genre_scores_gemma":[0.9594895,0.00007788415,0.039234024,0.0004464158,0.00026788938,0.0000032904677,8.100494e-7,0.000020763793,0.0004594132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762744,0.000029872075,0.00056241814,0.00090140937,0.00047562981,0.00040325895],"domain_scores_gemma":[0.99820805,0.0002830834,0.00034964088,0.0008803431,0.0001570222,0.00012187559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006543081,0.00036389122,0.00059999357,0.0006405603,0.00014417371,0.00022634838,0.0017951385,0.00026980776,0.000017293287],"category_scores_gemma":[0.000022878741,0.0003097804,0.000102508464,0.00029595068,0.0006658064,0.00043361948,0.0009562766,0.00041614813,0.000007944201],"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.00001209803,0.00002919929,0.0006134754,0.00009342953,0.000026829874,0.00004063762,0.0028652824,0.00090077944,0.00034465766,0.27707353,0.00005624667,0.71794385],"study_design_scores_gemma":[0.0007197705,0.0010567831,0.0011460582,0.0024372854,0.000029394227,0.0006039687,0.0000014650718,0.42981553,0.0135806985,0.54433423,0.0043946663,0.001880135],"about_ca_topic_score_codex":0.00019511912,"about_ca_topic_score_gemma":0.00013138144,"teacher_disagreement_score":0.9583338,"about_ca_system_score_codex":0.000072775816,"about_ca_system_score_gemma":0.00013617567,"threshold_uncertainty_score":0.99993545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025131708,0.0008042861,0.96517074,0.0015420269,0.0046761995,0.000524952,0.0000127140775,0.00058243197,0.0015549202],"genre_scores_gemma":[0.98287874,0.000027855378,0.015787018,0.000119491204,0.000102449485,0.00014073367,0.0000030866024,0.000022368518,0.00091824593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773294,0.00022456158,0.00064106093,0.0006888312,0.00022151948,0.0004910771],"domain_scores_gemma":[0.9982,0.00011878551,0.0002080191,0.0010197269,0.0002833151,0.00017015955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078217563,0.00028990023,0.00048796297,0.0008598414,0.0004626642,0.00019271096,0.00066517456,0.0005489431,0.000027997186],"category_scores_gemma":[0.00004231549,0.00026459974,0.00008732597,0.0008833553,0.00013770937,0.00019645526,0.000012955311,0.00047682997,0.00008027062],"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.00006258998,0.00028950078,0.000046668698,0.000070747585,0.00024664344,0.00009019849,0.0013790999,0.4451242,0.0010420404,0.019387733,0.00052772515,0.53173286],"study_design_scores_gemma":[0.00074017735,0.00034888313,0.000004086732,0.000111899855,0.00001925305,0.001592078,0.001355039,0.98521024,0.0012633641,0.004076661,0.0049604652,0.00031785638],"about_ca_topic_score_codex":0.0002516893,"about_ca_topic_score_gemma":0.000032805754,"teacher_disagreement_score":0.95774704,"about_ca_system_score_codex":0.00016356855,"about_ca_system_score_gemma":0.00011821995,"threshold_uncertainty_score":0.9999806},"labels":[],"label_agreement":null},{"id":"W2204817054","doi":"10.1142/s0219265915500073","title":"Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults","year":2015,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Connected component; Vertex connectivity; Upper and lower bounds; Mathematics; Graph; Connectivity; Discrete mathematics; Computer science","score_opus":0.030136330993255644,"score_gpt":0.24994725375267726,"score_spread":0.21981092275942163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204817054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1446156,0.0003964667,0.84570915,0.000517828,0.0054365867,0.00026553968,0.0000050788644,0.000108367705,0.0029453463],"genre_scores_gemma":[0.9970018,0.00004429996,0.00098089,0.00031270992,0.0012446556,0.0000068357317,0.0000065416266,0.000036333826,0.00036593017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955227,0.00079877523,0.0018617389,0.00047292272,0.0007875366,0.0005563274],"domain_scores_gemma":[0.9925659,0.00096147927,0.0027521036,0.0006122048,0.002687886,0.00042047777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037424045,0.00039642586,0.0009885136,0.00043080765,0.00017365617,0.00021658956,0.0010146227,0.00035748325,0.000012886298],"category_scores_gemma":[0.0008861027,0.00030976013,0.00037910373,0.001150689,0.00012992887,0.0012813376,0.00018043928,0.0010686917,0.000009774874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033787135,0.0006944097,0.0022647176,0.000022368713,0.0011549082,0.00028487717,0.0021763605,0.9349384,0.00016396976,0.0074272687,0.03972791,0.007766094],"study_design_scores_gemma":[0.0054973336,0.0051504998,0.0015443191,0.0010627721,0.00007724541,0.0016214758,0.0006608588,0.9793262,0.00026211282,0.0006191867,0.0036941464,0.00048384277],"about_ca_topic_score_codex":0.00019159375,"about_ca_topic_score_gemma":0.0003339144,"teacher_disagreement_score":0.8523862,"about_ca_system_score_codex":0.0003600345,"about_ca_system_score_gemma":0.00021227945,"threshold_uncertainty_score":0.99993545},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098564774,0.00005176646,0.84872895,0.00045892334,0.00069219514,0.00087695697,0.000005485116,0.00014282638,0.050478134],"genre_scores_gemma":[0.97746533,0.0000015443524,0.021730674,0.00009359959,0.000089276,0.00007060224,9.926976e-7,0.0000142074405,0.0005337531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880683,0.000061556675,0.00033398892,0.00022228115,0.00036134635,0.0002139843],"domain_scores_gemma":[0.9987316,0.00006628694,0.000220812,0.00078955025,0.00011293917,0.0000787743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061878416,0.00014785507,0.0002978707,0.000033025175,0.000086056396,0.0000717452,0.0007332843,0.00006606465,0.000008145222],"category_scores_gemma":[0.00005294264,0.00007406515,0.0000979229,0.00025525037,0.000059878697,0.00011516326,0.0003012674,0.00011345463,0.000016659005],"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.000013204061,0.00012447099,0.00004864751,0.00012828747,0.00005931916,0.0000012189794,0.00854446,0.0007148641,0.0063311257,0.97813225,0.004176968,0.0017251862],"study_design_scores_gemma":[0.0027944904,0.00019157224,0.00015391504,0.00025429006,0.00007405871,0.00008946158,0.0043003135,0.869152,0.027680129,0.08446174,0.009977531,0.0008705017],"about_ca_topic_score_codex":0.00003738472,"about_ca_topic_score_gemma":0.000025053008,"teacher_disagreement_score":0.8936705,"about_ca_system_score_codex":0.000044135257,"about_ca_system_score_gemma":0.00006150882,"threshold_uncertainty_score":0.30202892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09951149,0.00007416234,0.8975325,0.00037344784,0.00061788573,0.00051679206,0.000011866942,0.00029354257,0.001068301],"genre_scores_gemma":[0.8990223,0.0000025747638,0.0985515,0.0005390927,0.00060226844,0.00012524243,0.000038503676,0.000021596194,0.0010969628],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879295,0.0000623734,0.00024501065,0.0003000764,0.00028447673,0.00031514003],"domain_scores_gemma":[0.999029,0.00013248617,0.000094892224,0.0003349441,0.0002489081,0.00015980049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037351702,0.00011677346,0.0002348117,0.00008205764,0.00009230262,0.00015079672,0.00045943965,0.00006725991,0.00000992289],"category_scores_gemma":[0.000075261996,0.000111954956,0.00005969571,0.0001771214,0.0000121662115,0.0002624426,0.00011968768,0.00008703003,0.00009599511],"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.00038797088,0.020813894,0.011715334,0.0010576545,0.007818068,0.00025151388,0.037497763,0.0020875256,0.10300791,0.15615557,0.42037868,0.23882812],"study_design_scores_gemma":[0.0008988029,0.0002031509,0.00010976699,0.00006848317,0.000019004026,0.000006416784,0.000044417502,0.98647505,0.0032934619,0.0020859605,0.006602642,0.0001928445],"about_ca_topic_score_codex":0.000052737112,"about_ca_topic_score_gemma":0.000012086715,"teacher_disagreement_score":0.9843875,"about_ca_system_score_codex":0.00007486797,"about_ca_system_score_gemma":0.000029515173,"threshold_uncertainty_score":0.45653906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562266,0.001009178,0.2519546,0.026221799,0.0109243225,0.0029270458,0.000044636272,0.0010585547,0.1435939],"genre_scores_gemma":[0.9981429,0.0000037491611,0.0010209256,0.00014314966,0.00008459441,0.000047164664,6.425704e-7,0.000004391708,0.0005524893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990664,0.000008179639,0.00022943852,0.000183941,0.00031979027,0.00019223333],"domain_scores_gemma":[0.999288,0.000011334511,0.00015579202,0.00014582246,0.0003131435,0.00008588656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040477957,0.0000876929,0.00012553338,0.00004068688,0.00008190871,0.00010447423,0.00062170136,0.000032656684,0.000005982477],"category_scores_gemma":[0.000045128723,0.0000555196,0.00008411182,0.0004100514,0.000035945563,0.00029328314,0.00024146472,0.00007179143,0.000017025608],"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.000027898823,0.00024870576,0.007963274,0.000062939034,0.000087349064,8.5436164e-7,0.0018356752,0.0007738147,0.0057951855,0.69382894,0.28811887,0.001256478],"study_design_scores_gemma":[0.0047717094,0.00094538,0.0050995275,0.0007873184,0.00009126105,0.0002583454,0.002466784,0.111511976,0.31377363,0.27763748,0.28141448,0.0012421346],"about_ca_topic_score_codex":0.000049828705,"about_ca_topic_score_gemma":0.0000024604544,"teacher_disagreement_score":0.4358769,"about_ca_system_score_codex":0.00006105705,"about_ca_system_score_gemma":0.000022207492,"threshold_uncertainty_score":0.22640234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003951742,0.00013267697,0.988827,0.0004731946,0.0021662405,0.0002744673,0.0000015313826,0.00013350425,0.004039651],"genre_scores_gemma":[0.9432818,0.0000011033011,0.05337632,0.00072637177,0.0006352637,0.000043707125,0.0000026841374,0.000010110229,0.0019226098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988677,0.000054316944,0.00024029217,0.0003608473,0.00018217413,0.00029469616],"domain_scores_gemma":[0.999083,0.00016085907,0.000056382625,0.0002768997,0.00020490904,0.00021795882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005249516,0.00013396284,0.00018556093,0.00004506559,0.00011551531,0.00019022802,0.00024870128,0.000052620737,0.0000059986196],"category_scores_gemma":[0.000024404711,0.000104374376,0.000055914752,0.00011171993,0.000030506526,0.000271933,0.00016760576,0.0000815813,0.000009705703],"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.00010242465,0.00014970524,0.00020940985,0.000012090994,0.00010575478,0.000022062519,0.00067531044,0.21309197,0.00010902136,0.6685395,0.0737101,0.043272607],"study_design_scores_gemma":[0.0014402571,0.0001035864,0.000022777727,0.000010734177,0.000003988739,0.00005165076,0.00004165445,0.99442464,0.000044153134,0.0012166932,0.0024853854,0.00015450202],"about_ca_topic_score_codex":0.0001793117,"about_ca_topic_score_gemma":0.000072338815,"teacher_disagreement_score":0.9393301,"about_ca_system_score_codex":0.000047336,"about_ca_system_score_gemma":0.000031293326,"threshold_uncertainty_score":0.42562634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7635543,0.00006417263,0.2299522,0.00003278971,0.00025735493,0.00011639356,0.0000050448753,0.00006924497,0.005948538],"genre_scores_gemma":[0.9972287,0.000013305022,0.0024832739,0.00003321699,0.000022332093,2.9291957e-7,0.0000015426474,0.000004523111,0.00021283809],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992387,0.000071911,0.00010687168,0.00026909742,0.00014525397,0.00016815754],"domain_scores_gemma":[0.9995258,0.000013464188,0.00007395762,0.00023804183,0.000093493974,0.00005527398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018011185,0.000028767494,0.00014796731,0.00006312538,0.000091730086,0.00006993954,0.00050307234,0.00007249735,0.00007318906],"category_scores_gemma":[0.000012135285,0.00009850813,0.000060676255,0.00035788803,0.000070388676,0.0002383948,0.00013856264,0.00009106584,0.000013416279],"study_design_candidate":"observational","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.0000042005995,0.00010107618,0.015650284,0.0000376147,0.000016497037,0.0001614028,0.0021081434,0.00022519282,0.000024194564,0.00011694923,0.0009969423,0.9805575],"study_design_scores_gemma":[0.0003519091,0.00006582512,0.9728155,0.00010856059,0.0000031637,0.00005847954,0.00026951614,0.024720432,0.0000018644129,0.0013278314,0.00015609973,0.00012079146],"about_ca_topic_score_codex":0.12390561,"about_ca_topic_score_gemma":0.28918055,"teacher_disagreement_score":0.9804367,"about_ca_system_score_codex":0.000051535862,"about_ca_system_score_gemma":0.000046938556,"threshold_uncertainty_score":0.8819284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04879912,0.0014882175,0.897841,0.015141253,0.0021154839,0.0008479098,0.00010805069,0.00060809776,0.03305089],"genre_scores_gemma":[0.89420533,0.0019348568,0.07256892,0.00043597567,0.00024595275,0.00023161921,0.000649998,0.00013477432,0.029592574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9812386,0.012874439,0.0015523962,0.0020423576,0.0009883028,0.0013039208],"domain_scores_gemma":[0.98562485,0.0033034754,0.0013748081,0.004345517,0.004673742,0.000677603],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.016626103,0.0009518442,0.0010374624,0.00035132546,0.00085719296,0.0025674286,0.0047345986,0.00085969974,0.00020519744],"category_scores_gemma":[0.0020635293,0.0010073262,0.0005302853,0.0007586429,0.00051943545,0.0007922008,0.0032132536,0.0016132249,0.00025736896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.000054711236,0.0017322482,0.005232896,0.0014274612,0.00048553728,0.000069607915,0.033818644,0.007837523,0.0018192806,0.8055669,0.010512631,0.13144258],"study_design_scores_gemma":[0.0009254872,0.0000033351273,0.004251398,0.0055290037,0.00007782749,0.00016493213,0.00023233671,0.8241524,0.007266155,0.0046477807,0.15165503,0.0010943082],"about_ca_topic_score_codex":0.009319274,"about_ca_topic_score_gemma":0.009337172,"teacher_disagreement_score":0.84540623,"about_ca_system_score_codex":0.0006531083,"about_ca_system_score_gemma":0.0009722127,"threshold_uncertainty_score":0.9992377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15063776,0.000016630676,0.8401571,0.0009586246,0.0017013825,0.0003211297,0.0000026462708,0.00014941701,0.0060552927],"genre_scores_gemma":[0.9696411,0.0000061886703,0.029833341,0.0003980438,0.00005488515,0.000024406563,9.933711e-7,0.0000016144139,0.000039432423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978908,0.00003669368,0.00047807142,0.00038074944,0.00071185874,0.00050184276],"domain_scores_gemma":[0.9986549,0.0001274693,0.00026543738,0.0002822327,0.00050033093,0.00016960298],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006218279,0.00014349094,0.0001675135,0.00033702698,0.0014301462,0.0015102768,0.0011869589,0.000054916396,0.0000031095813],"category_scores_gemma":[0.00053075835,0.00010738144,0.000034667275,0.0014116019,0.0018551786,0.009792549,0.00032926587,0.000109883884,0.000015610298],"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.000015136524,0.000048613496,0.009124658,0.00013883103,0.000011689785,9.740639e-7,0.059274398,0.06801399,0.0002033803,0.42921832,0.0012653219,0.4326847],"study_design_scores_gemma":[0.0002570962,0.00019985925,0.0074663064,0.000042222615,0.000001113213,0.00006712939,0.007158042,0.9779071,0.00022958196,0.0054519214,0.0010204472,0.00019918685],"about_ca_topic_score_codex":0.00007136522,"about_ca_topic_score_gemma":0.0000036700285,"teacher_disagreement_score":0.9098931,"about_ca_system_score_codex":0.00012538338,"about_ca_system_score_gemma":0.00057468296,"threshold_uncertainty_score":0.9998699},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01244221,0.000024906332,0.9726299,0.0005431943,0.00027160687,0.0005531992,0.00002189793,0.00070031465,0.012812741],"genre_scores_gemma":[0.9952357,0.0000022688553,0.0032747348,0.00033383293,0.00022918277,2.4723957e-7,0.00015043672,0.0004353112,0.00033831975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810565,0.00041372303,0.0003572328,0.00046993935,0.0002412844,0.00041215657],"domain_scores_gemma":[0.9988376,0.00010301567,0.00012957175,0.0004647009,0.0003531378,0.00011197515],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012442464,0.0001402436,0.00018372355,0.00024488498,0.0012350584,0.0011730887,0.0011729974,0.00006415425,0.00046395054],"category_scores_gemma":[0.0005150569,0.00014891411,0.00006750494,0.00048304765,0.000039877865,0.00024546406,0.0004934109,0.00016898014,0.001451302],"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.00019108622,0.0008273781,0.00005650657,0.00084884657,0.00017013277,0.00008498546,0.010181705,0.09053184,0.047744453,0.076168604,0.23353668,0.5396578],"study_design_scores_gemma":[0.00048197628,0.00017046036,0.000055088498,0.000054997625,0.0000018935699,0.000044245695,0.000030829593,0.5953854,0.00026769945,0.00023264643,0.40311483,0.00015997593],"about_ca_topic_score_codex":0.00001295415,"about_ca_topic_score_gemma":6.977509e-7,"teacher_disagreement_score":0.98279345,"about_ca_system_score_codex":0.00012937671,"about_ca_system_score_gemma":0.0000046647715,"threshold_uncertainty_score":0.9998638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29014024,0.00012934988,0.69565535,0.00043613106,0.0009609282,0.00023243751,4.7075162e-7,0.00036254112,0.012082545],"genre_scores_gemma":[0.97487813,0.0000020678613,0.024708228,0.00007446116,0.00005662252,0.000012664472,2.7652817e-7,0.0000053408885,0.00026220025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991782,0.0001005903,0.00019015462,0.0002697946,0.000093107825,0.00016819441],"domain_scores_gemma":[0.999415,0.00007367001,0.00006593134,0.00020713794,0.00010628207,0.0001320142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031230785,0.00010733009,0.00020084075,0.000080493286,0.0000792938,0.00019447437,0.00011823467,0.000059087062,0.000008386352],"category_scores_gemma":[0.000019274044,0.0000739248,0.000012359247,0.00011206727,0.00009934358,0.000362707,0.000098457494,0.00006863995,0.000014902606],"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.000051037798,0.000042036652,0.0047163945,0.00024694923,0.00012122194,0.000069593996,0.0047962526,0.00034569274,0.00007068272,0.88860714,0.002530884,0.09840211],"study_design_scores_gemma":[0.0009499868,0.000298164,0.00012366624,0.00009727911,0.00000926452,0.0038384802,0.0040678442,0.9888914,0.00013331432,0.0002601258,0.001169512,0.00016092192],"about_ca_topic_score_codex":0.00020840441,"about_ca_topic_score_gemma":0.00009165859,"teacher_disagreement_score":0.9885458,"about_ca_system_score_codex":0.00004670034,"about_ca_system_score_gemma":0.0000292897,"threshold_uncertainty_score":0.30145657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0562579,0.004384278,0.9131918,0.00045953126,0.0034799855,0.0062136496,0.00010173991,0.00049769634,0.015413449],"genre_scores_gemma":[0.99432117,0.00009910121,0.0005062317,0.00030278447,0.0010776472,0.00015876425,0.000038619695,0.000049825023,0.0034458537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652743,0.00012280035,0.0012175945,0.0011748453,0.0003442409,0.0006130754],"domain_scores_gemma":[0.9976943,0.00030965812,0.00058673543,0.00088142295,0.0002644821,0.00026338364],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009025061,0.0005492578,0.0009220907,0.00022733076,0.00065354013,0.0011573986,0.00076092914,0.00038245105,0.0000038042895],"category_scores_gemma":[0.000011447376,0.0005276837,0.00006459768,0.00032467206,0.00007752909,0.00029884916,0.0006601186,0.00053823774,0.000030667463],"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.000016306634,0.00005791403,0.0064176586,0.0019217329,0.000108145694,0.000007802147,0.000802478,0.23503546,0.000004993233,0.7376285,0.005895209,0.012103769],"study_design_scores_gemma":[0.00064886804,0.00016261617,0.0049019875,0.0032479083,0.000026720598,0.0003207926,0.000060746515,0.7772645,0.000001482579,0.0012119741,0.210867,0.0012854246],"about_ca_topic_score_codex":0.00037818766,"about_ca_topic_score_gemma":0.00003162002,"teacher_disagreement_score":0.93806326,"about_ca_system_score_codex":0.00024498752,"about_ca_system_score_gemma":0.00006722484,"threshold_uncertainty_score":0.9998795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016773842,0.000028011498,0.97263044,0.0019923637,0.00030997058,0.00038932962,0.0000013007641,0.00024857497,0.007626174],"genre_scores_gemma":[0.9793712,1.8700882e-7,0.019377468,0.00041202267,0.00019672896,0.000031345255,0.0000042949873,0.0000064185206,0.00060033007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987264,0.00006768134,0.00017855508,0.00046238952,0.0002895497,0.00027541642],"domain_scores_gemma":[0.9984309,0.000037726277,0.00005955265,0.0011809468,0.00016023987,0.00013064493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010762129,0.000105849,0.00012093479,0.000028197857,0.00014026214,0.0005952068,0.0013797722,0.000026745016,0.00000498775],"category_scores_gemma":[0.00005404192,0.00005617492,0.000013074274,0.00041278207,0.000023546421,0.0005638613,0.00046976845,0.00010292988,0.000043468437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012542527,0.0001890459,0.002142702,0.00009912627,0.000058923168,0.000025128613,0.014386815,0.0058987434,0.000102364815,0.005640886,0.06386152,0.90746933],"study_design_scores_gemma":[0.0005349822,0.0003722935,0.0006884807,0.00016871074,0.000007956914,0.00016223396,0.0015905697,0.8886674,0.0007495959,0.00028613224,0.10635407,0.00041757358],"about_ca_topic_score_codex":0.00017942308,"about_ca_topic_score_gemma":0.00064554374,"teacher_disagreement_score":0.96259737,"about_ca_system_score_codex":0.00003752311,"about_ca_system_score_gemma":0.00011522773,"threshold_uncertainty_score":0.5739593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057459422,0.0008348391,0.85730314,0.0071802414,0.0057138023,0.00027931755,0.000004548658,0.00021592613,0.12272225],"genre_scores_gemma":[0.8731399,0.00012050666,0.052402366,0.0014448845,0.00071046245,0.00004049359,0.000003925282,0.00002922692,0.072108224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971847,0.00064572785,0.0006613847,0.0006117727,0.00021532405,0.0006811174],"domain_scores_gemma":[0.9982364,0.00021119673,0.00022467827,0.0006264238,0.0004572516,0.00024402689],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012694963,0.0003070945,0.00033621024,0.000110845125,0.00027200914,0.00039453746,0.0006825575,0.00032470093,0.0021515694],"category_scores_gemma":[0.000109785025,0.0002897895,0.00019777028,0.0003265252,0.00007339673,0.0010669751,0.00011658706,0.00032242996,0.00076551415],"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.000020244828,0.00017787161,0.0006368681,0.000056990666,0.000071464325,0.00007458744,0.004236355,0.000428456,0.00085809024,0.89331025,0.015395228,0.08473362],"study_design_scores_gemma":[0.00040997122,0.00023999298,0.0024369764,0.00025182634,0.000023970764,0.0005776202,0.00030337024,0.92733186,0.0078870505,0.035478324,0.02457229,0.00048675406],"about_ca_topic_score_codex":0.0064257686,"about_ca_topic_score_gemma":0.004088907,"teacher_disagreement_score":0.9269034,"about_ca_system_score_codex":0.00021076387,"about_ca_system_score_gemma":0.0004252072,"threshold_uncertainty_score":0.9999554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2659736,0.00008411673,0.7335888,0.000120255994,0.000082871346,0.000090397254,2.2972607e-7,0.000051719297,0.000008010468],"genre_scores_gemma":[0.9934544,0.000038398564,0.006431684,0.000015913234,0.000027634302,0.00001333997,0.0000013797345,0.000007687878,0.000009550014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922836,0.000030652864,0.00027839086,0.00018875868,0.000099144476,0.00017466531],"domain_scores_gemma":[0.99954486,0.00009595762,0.000057985246,0.00020133759,0.00005411956,0.00004575704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015876035,0.000094758696,0.0001652505,0.00015705546,0.000023570772,0.000034708788,0.00026934684,0.00005113591,6.226079e-7],"category_scores_gemma":[0.000028064256,0.000075208816,0.00002394923,0.00031345343,0.00000802578,0.00025688604,0.000090692294,0.00008854353,9.172603e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039458762,0.00024263245,0.0037374957,0.00026568677,0.000069183276,0.000011762368,0.0031699124,0.30699843,0.19533376,0.075092964,0.00003196375,0.41500673],"study_design_scores_gemma":[0.00025022757,0.000032835138,0.0012679981,0.00019629326,0.0000013345518,0.000009094226,0.0000016433935,0.997259,0.00080235174,0.00004367226,0.000040449104,0.00009510469],"about_ca_topic_score_codex":0.000012116217,"about_ca_topic_score_gemma":0.0000021500618,"teacher_disagreement_score":0.7274808,"about_ca_system_score_codex":0.00005971201,"about_ca_system_score_gemma":0.000010993865,"threshold_uncertainty_score":0.30669266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61988,0.00027280106,0.33012885,0.01308452,0.032925226,0.0007847674,0.000009359981,0.00072585355,0.0021886134],"genre_scores_gemma":[0.99479085,0.000004772656,0.0013687208,0.0017887624,0.00093467714,0.000034190507,0.000005229921,0.00002219498,0.0010506148],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784607,0.0001363857,0.00049163576,0.00060147385,0.0003952954,0.0005291692],"domain_scores_gemma":[0.9985733,0.000098041135,0.00016011679,0.00073443644,0.00014308594,0.0002910205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008048378,0.000223636,0.0002717565,0.00010449532,0.00035393017,0.00092921976,0.00067581696,0.00015682177,0.00008926814],"category_scores_gemma":[0.0001435659,0.00020607434,0.00014505674,0.00039352992,0.00006627328,0.00049470563,0.00017408244,0.00046783278,0.0002332636],"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.00012732022,0.0015032145,0.00088243565,0.00007088645,0.00020130203,0.00013702843,0.021000361,0.04771145,0.3773126,0.21025193,0.2586965,0.08210497],"study_design_scores_gemma":[0.0006191285,0.00027817287,0.00035509124,0.00020159643,0.000025893049,0.000085317726,0.0017186757,0.75362444,0.017936844,0.0009550261,0.22284898,0.0013508416],"about_ca_topic_score_codex":0.0008239934,"about_ca_topic_score_gemma":0.0014465303,"teacher_disagreement_score":0.70591295,"about_ca_system_score_codex":0.000049204,"about_ca_system_score_gemma":0.00010697559,"threshold_uncertainty_score":0.8960488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20117053,0.00008450683,0.73238796,0.004315045,0.0017412404,0.00028099108,0.0000011886505,0.00007613357,0.059942413],"genre_scores_gemma":[0.99746776,9.700603e-7,0.0010081495,0.0006287371,0.00006317389,0.0000041218973,3.461321e-8,0.0000031074942,0.0008239584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992126,0.00016421576,0.00013805773,0.00015624531,0.00020964292,0.00011920333],"domain_scores_gemma":[0.99899924,0.00041977808,0.00007622409,0.0003709767,0.00009633238,0.000037453312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008314416,0.000069268826,0.000098213306,0.000019808873,0.0001202703,0.00009319224,0.00044213844,0.000030884126,0.000005974203],"category_scores_gemma":[0.00013262616,0.00003185398,0.00003960678,0.00018072111,0.000055701978,0.00010480837,0.00034954908,0.00010591356,0.0000063612656],"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.000002981446,0.000041015344,0.00070521643,0.000005043531,0.000022173237,0.0000013098028,0.001525641,0.0006569395,0.00010931277,0.9477307,0.013607913,0.035591744],"study_design_scores_gemma":[0.00025359035,0.0001412489,0.0012732635,0.000050135255,0.0000028088334,0.0000638475,0.00032092957,0.9743048,0.0015410458,0.019627176,0.0023190319,0.00010210514],"about_ca_topic_score_codex":0.00024080784,"about_ca_topic_score_gemma":0.00004661613,"teacher_disagreement_score":0.9736479,"about_ca_system_score_codex":0.00001779293,"about_ca_system_score_gemma":0.000030501651,"threshold_uncertainty_score":0.12989676},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005767863,0.00018466616,0.9878008,0.003642089,0.0014718301,0.00032919063,6.263848e-7,0.00016627093,0.00063669024],"genre_scores_gemma":[0.98791105,0.000002726468,0.0046172403,0.006324223,0.0008427171,0.00007177433,0.0000030944832,0.000020358651,0.00020679503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985151,0.0000804611,0.00022764024,0.0003849723,0.00015635979,0.0006354355],"domain_scores_gemma":[0.99916494,0.00014584036,0.00012163048,0.0003656098,0.00009059164,0.000111409325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684735,0.00016187421,0.00017514812,0.00006062857,0.00013936116,0.00016401336,0.0005187775,0.0000659566,9.533498e-7],"category_scores_gemma":[0.00003891107,0.0001484812,0.000109710134,0.0002072247,0.00001576442,0.00020848768,0.000059561862,0.00024451254,0.000011726646],"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.000230657,0.00007919206,0.00006499054,0.000008339759,0.00017819679,0.000010524354,0.001429879,0.12585251,0.0030685896,0.7180965,0.12844695,0.022533689],"study_design_scores_gemma":[0.00057864084,0.00053394464,0.000005822715,0.000014718452,0.000004515681,0.000012140834,0.00002750363,0.98125005,0.00048360715,0.00076770416,0.016114805,0.00020652702],"about_ca_topic_score_codex":0.000014779822,"about_ca_topic_score_gemma":0.000023569324,"teacher_disagreement_score":0.98318356,"about_ca_system_score_codex":0.00025782918,"about_ca_system_score_gemma":0.000079753656,"threshold_uncertainty_score":0.6054887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028672146,0.0003288585,0.98225677,0.0003715398,0.0052159824,0.00022462511,0.0000031112338,0.00009264771,0.011477776],"genre_scores_gemma":[0.19622202,0.00012477356,0.7974092,0.000703527,0.0018603918,0.0000074434747,0.0000019178613,0.000055476314,0.003615242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721414,0.000031874617,0.00062122475,0.0010068801,0.0007011916,0.00042467378],"domain_scores_gemma":[0.9978018,0.0002600756,0.0004471786,0.001055458,0.00028007175,0.0001554548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005362626,0.00035898248,0.00051257794,0.0008225449,0.00012048814,0.00021310011,0.0019591718,0.00029044106,0.00005665926],"category_scores_gemma":[0.00003186768,0.00027869953,0.00018089,0.0004934335,0.00049382227,0.0004892922,0.000543065,0.00036969167,0.00003376041],"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.0000035008788,0.00000408467,0.000028875089,0.000014758091,0.0000088594525,0.000010018154,0.00020695655,0.00090291776,0.00011316153,0.27665994,0.00006263172,0.72198427],"study_design_scores_gemma":[0.0005995411,0.0003691106,0.00004992145,0.0017059444,0.000010181984,0.0005026517,3.0817748e-7,0.10654357,0.00260499,0.8770435,0.009689192,0.0008810807],"about_ca_topic_score_codex":0.000038698967,"about_ca_topic_score_gemma":0.00004052649,"teacher_disagreement_score":0.7211032,"about_ca_system_score_codex":0.00014779544,"about_ca_system_score_gemma":0.00049900473,"threshold_uncertainty_score":0.9999665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01054241,0.000042519117,0.8175625,0.00038631924,0.00083442696,0.00003485342,8.233178e-8,0.00022976303,0.17036709],"genre_scores_gemma":[0.98843706,6.0252484e-7,0.004720736,0.00024868274,0.00021164512,0.0000034969894,4.7118024e-7,0.0000031978575,0.006374123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999432,0.0000296649,0.00014723503,0.00016502415,0.00008086541,0.00014520643],"domain_scores_gemma":[0.9996233,0.000044327153,0.000027009024,0.00024783605,0.000037132693,0.000020403575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017716973,0.000057120935,0.00007161454,0.000046941077,0.00005720385,0.00015258296,0.00030554415,0.00002606634,0.00006841307],"category_scores_gemma":[0.000005125352,0.000045337212,0.000046194775,0.00014958614,0.0000068288923,0.00025313604,0.00006711514,0.000044382046,0.00016938035],"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":[5.2126865e-7,0.00001269017,0.0005656446,0.000001964354,0.0000031386285,0.000006239922,0.000047200967,0.00035175556,0.0003468865,0.968966,0.023751773,0.0059461687],"study_design_scores_gemma":[0.0004790702,0.00011053333,0.0029228516,0.000049085498,0.0000025626543,0.00017973167,0.000089433925,0.6611615,0.005506858,0.031271663,0.29770863,0.00051808235],"about_ca_topic_score_codex":0.0004143473,"about_ca_topic_score_gemma":0.00017471796,"teacher_disagreement_score":0.9778946,"about_ca_system_score_codex":0.000018070004,"about_ca_system_score_gemma":0.0000075938547,"threshold_uncertainty_score":0.21770982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97719055,0.0006848407,0.013587247,0.0005013468,0.00738593,0.000074101445,2.919689e-7,0.000013828409,0.0005618819],"genre_scores_gemma":[0.99616116,0.00014408542,0.00074748043,0.00008958044,0.0028173032,7.7766725e-7,7.968128e-7,0.0000065786553,0.00003224656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980312,0.00012553486,0.0006641691,0.00014220519,0.0008634669,0.00017343195],"domain_scores_gemma":[0.9980085,0.00010966965,0.00082154747,0.00015877046,0.00087362225,0.000027906508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018364612,0.00011534555,0.00018765668,0.00010465638,0.00019751862,0.00012496137,0.0007717306,0.000054408752,0.0000032035664],"category_scores_gemma":[0.000012434884,0.000082348415,0.00008821094,0.00020480384,0.000050545936,0.00038657882,0.00020150549,0.00023881477,8.168163e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025799192,0.00002423131,0.043064255,0.000014626764,0.000058899877,0.000002093689,0.0003103496,0.40022165,0.000045472418,0.00044496052,0.0004277412,0.5553599],"study_design_scores_gemma":[0.00055773085,0.00007385603,0.06694045,0.00064483384,0.000015858575,0.0002593546,0.000014335503,0.93006784,0.0002669716,0.00013610799,0.00093597104,0.00008666932],"about_ca_topic_score_codex":0.00003840775,"about_ca_topic_score_gemma":0.0000054499287,"teacher_disagreement_score":0.55527323,"about_ca_system_score_codex":0.00009735435,"about_ca_system_score_gemma":0.000076264514,"threshold_uncertainty_score":0.33580709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00795157,0.0015036712,0.975512,0.0009396451,0.0109824035,0.000049454033,0.00000271917,0.000019275323,0.003039241],"genre_scores_gemma":[0.996991,0.00026342878,0.00088630785,0.00017880923,0.00062489323,0.0000043562836,0.0000024281144,0.0000059720337,0.0010428176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889094,0.00008368776,0.0004497843,0.000150795,0.0003073972,0.00011741795],"domain_scores_gemma":[0.9991836,0.00006211843,0.00027111024,0.00008898546,0.00028953992,0.00010463801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053823466,0.000103541104,0.00017062532,0.000100602905,0.000068083005,0.0003364575,0.0002621009,0.00008050568,0.000013763155],"category_scores_gemma":[0.000006653275,0.00008196713,0.00004989403,0.000052690048,0.000022528686,0.0004357214,0.000021027894,0.00013567193,0.0000010209521],"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.00043918082,0.00020587334,0.0020826834,0.00006196274,0.0013816748,0.00025989293,0.0014153805,0.034317587,0.009764743,0.4048436,0.0981238,0.44710362],"study_design_scores_gemma":[0.0020765548,0.00026077026,0.0010709898,0.0003231135,0.00002578627,0.0019346277,0.00010002699,0.5241168,0.000121478784,0.0010367599,0.46868515,0.00024795625],"about_ca_topic_score_codex":0.00004310304,"about_ca_topic_score_gemma":0.0000072089742,"teacher_disagreement_score":0.9890394,"about_ca_system_score_codex":0.00002018241,"about_ca_system_score_gemma":0.000012864518,"threshold_uncertainty_score":0.33425227},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011270597,0.0000625326,0.84512615,0.009569523,0.0033197878,0.00008505007,1.2760279e-7,0.00017860465,0.14053117],"genre_scores_gemma":[0.97099185,0.000015300548,0.000461443,0.0010461073,0.00054825086,0.000011447866,3.003352e-8,0.0000039277443,0.026921634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925554,0.00006667238,0.00013473885,0.0001668761,0.00012931321,0.0002468561],"domain_scores_gemma":[0.999021,0.00039608974,0.000034202887,0.00046834248,0.00003583885,0.0000445404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042194896,0.00006356753,0.000059138296,0.000012540947,0.00025826256,0.0001452465,0.0005477658,0.000028009608,0.000034259694],"category_scores_gemma":[0.000016684862,0.000023890394,0.000049075632,0.00011632012,0.00002288565,0.00011498043,0.000076541655,0.00004029123,0.00059159833],"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.0000023141665,0.0000033269675,0.00014153596,2.2153307e-7,0.000005012987,0.0000010395888,0.000017123999,0.000038954364,0.000020629628,0.82228196,0.109930456,0.06755743],"study_design_scores_gemma":[0.00025811564,0.00013929328,0.0010653891,0.000050049977,8.468757e-7,0.00002227622,0.000010718391,0.023555275,0.00023584231,0.026114654,0.9483878,0.00015971505],"about_ca_topic_score_codex":0.000011110971,"about_ca_topic_score_gemma":0.000051545187,"teacher_disagreement_score":0.9698648,"about_ca_system_score_codex":0.000017618364,"about_ca_system_score_gemma":0.00001187682,"threshold_uncertainty_score":0.76039964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05312501,0.0009813405,0.9442346,0.00007075567,0.0009440525,0.00032890146,0.0000033074675,0.00011009178,0.00020192002],"genre_scores_gemma":[0.9530163,0.000016506787,0.046241075,0.00006480868,0.00056378567,0.000032413303,0.000025605294,0.00001110177,0.0000284305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835336,0.000051000938,0.00053775887,0.00044931256,0.00014539777,0.00046319724],"domain_scores_gemma":[0.9989777,0.00023859428,0.0002857719,0.00022661535,0.00012002228,0.00015126856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647131,0.00022591834,0.00037959006,0.000044261385,0.00057735684,0.00026027876,0.00026715052,0.00016409674,5.824983e-7],"category_scores_gemma":[0.00001967842,0.00018884054,0.000054959844,0.00021175186,0.000055416578,0.000092152644,0.00013985485,0.00026537103,5.925172e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015578874,0.00012749089,0.0021717388,0.0002611346,0.000105177176,0.0000041394437,0.00093628216,0.7669791,0.0000490199,0.10309141,0.0031861193,0.122932576],"study_design_scores_gemma":[0.00063815905,0.000087476685,0.0018249907,0.0002343058,0.000008203177,0.000034230805,0.000063051346,0.9896735,0.0000033934032,0.00039890775,0.0067941006,0.00023969517],"about_ca_topic_score_codex":0.000008224669,"about_ca_topic_score_gemma":0.000012612952,"teacher_disagreement_score":0.89989126,"about_ca_system_score_codex":0.0000108831155,"about_ca_system_score_gemma":0.000044190918,"threshold_uncertainty_score":0.77006936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006398116,0.0000075086086,0.98405784,0.0023376737,0.001580836,0.00013855856,4.0551868e-7,0.00014973461,0.011087609],"genre_scores_gemma":[0.98390245,0.0000026223663,0.008751793,0.0010639293,0.0006399144,0.00003711729,1.6429554e-7,0.000006938063,0.005595083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992434,0.000033220877,0.00015616896,0.00024394057,0.000084874235,0.00023844022],"domain_scores_gemma":[0.99924004,0.00033647713,0.000029179399,0.00029291038,0.000033709188,0.00006770759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461829,0.000077035016,0.0000967143,0.000039052964,0.00008966858,0.00008105649,0.00034789508,0.000051792635,0.000027641841],"category_scores_gemma":[0.000020486792,0.00004237728,0.00007381655,0.00006761872,0.000013710075,0.0001320408,0.00008258639,0.000046690486,0.000043362343],"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.00003496512,0.000028134897,0.000109971974,0.0000057389398,0.000018423349,0.000002900188,0.0000641309,0.0034053207,0.00016605199,0.78004164,0.028989183,0.18713354],"study_design_scores_gemma":[0.00042644198,0.0002046872,0.00014887087,0.000055437406,8.064833e-7,0.000014562613,0.0000033835101,0.95611495,0.00013108643,0.003450841,0.03931561,0.00013331008],"about_ca_topic_score_codex":0.000003032004,"about_ca_topic_score_gemma":0.000017974584,"teacher_disagreement_score":0.9832626,"about_ca_system_score_codex":0.000023431823,"about_ca_system_score_gemma":0.000008810123,"threshold_uncertainty_score":0.17280953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4210384,0.00019154335,0.5504815,0.026977733,0.00032523647,0.000173115,0.0000017854488,0.00009606729,0.00071461085],"genre_scores_gemma":[0.9972873,0.000008283161,0.00033862074,0.0022201857,0.000039822102,0.000028854074,9.546725e-7,0.000006354933,0.00006962448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989236,0.00013612797,0.0002752435,0.0002914784,0.00017953216,0.00019401671],"domain_scores_gemma":[0.99884933,0.00063691154,0.00015785272,0.00026372776,0.0000513053,0.00004089267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004500052,0.00011536287,0.00014450794,0.000047181835,0.00017664403,0.00007963544,0.00030860328,0.000053870423,0.000032670836],"category_scores_gemma":[0.00006189742,0.000060984654,0.000059089034,0.0001646603,0.00021833321,0.00026085228,0.000057977944,0.00011799023,0.0000122095225],"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.00017959601,0.00043340682,0.03792872,0.00023710701,0.0002917832,0.000047012087,0.0031731047,0.030007767,0.007899729,0.6689319,0.13812748,0.11274238],"study_design_scores_gemma":[0.0044242446,0.0006279274,0.11523156,0.002550908,0.00006107408,0.00045406827,0.00016349542,0.5483262,0.0010581053,0.3194668,0.0058022756,0.0018333446],"about_ca_topic_score_codex":0.0000061618744,"about_ca_topic_score_gemma":0.0000012160854,"teacher_disagreement_score":0.5762489,"about_ca_system_score_codex":0.000019746823,"about_ca_system_score_gemma":0.000015239464,"threshold_uncertainty_score":0.24868819},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009125777,0.00001275656,0.98875076,0.003471131,0.0009773317,0.00029439863,8.1472893e-7,0.00026605467,0.005314151],"genre_scores_gemma":[0.9474414,0.000030810974,0.011125892,0.0002648092,0.0007466576,0.00006898515,0.0000019790284,0.000013806082,0.040305667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990667,0.00005162054,0.00019798751,0.00031062416,0.000116456715,0.00025661144],"domain_scores_gemma":[0.9990404,0.0002214159,0.00007084549,0.00041928992,0.00017716436,0.0000708716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037829543,0.00010374151,0.00013318719,0.000040887608,0.000106421314,0.00010748789,0.0003536306,0.00008863989,0.000064267755],"category_scores_gemma":[0.000019220792,0.00006428136,0.00007696596,0.00012610572,0.000014282222,0.00036115834,0.000069522845,0.00003374999,0.00012260441],"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.000030989002,0.00006238063,0.0004231883,0.000020653659,0.000051723237,0.0000024565106,0.00023290861,0.0008940961,0.0039925836,0.71866584,0.21043842,0.065184794],"study_design_scores_gemma":[0.00058214384,0.00016230177,0.0004682949,0.00007618799,0.000004975614,0.000013999038,0.000015386506,0.9384169,0.0008387455,0.0021162801,0.05702882,0.0002759601],"about_ca_topic_score_codex":0.00004748452,"about_ca_topic_score_gemma":0.000036431375,"teacher_disagreement_score":0.9776249,"about_ca_system_score_codex":0.000057804133,"about_ca_system_score_gemma":0.00002721013,"threshold_uncertainty_score":0.26213178},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19532976,0.000076426375,0.78494906,0.0007112937,0.00095839816,0.00011506535,2.1435778e-7,0.000059416026,0.017800367],"genre_scores_gemma":[0.99418694,0.00002646488,0.00063731056,0.00010756341,0.000066735,0.000005641684,9.41426e-8,0.0000026878754,0.004966563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999243,0.0000937607,0.00019991213,0.00014057018,0.00016080613,0.00016193169],"domain_scores_gemma":[0.9992375,0.00014704662,0.00008757252,0.00040709582,0.000082588296,0.000038192822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050145615,0.000060081715,0.0000952478,0.000022434135,0.00016416698,0.00009275828,0.00040066062,0.000027601393,0.00002642671],"category_scores_gemma":[0.000031206353,0.00003622901,0.00006120614,0.00016003259,0.000025868647,0.00020074406,0.00008940601,0.000058047553,0.000024581677],"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.000062923325,0.0002560087,0.022058351,0.000015720434,0.00017097655,0.00005248707,0.0017814331,0.0068894015,0.0047682184,0.7846816,0.029252946,0.15000993],"study_design_scores_gemma":[0.0006801277,0.00015805903,0.008655971,0.000041567237,0.0000033667911,0.0001114678,0.00013319644,0.77644736,0.006258334,0.0050090495,0.20228717,0.00021431506],"about_ca_topic_score_codex":0.00008994589,"about_ca_topic_score_gemma":0.00010554318,"teacher_disagreement_score":0.7988572,"about_ca_system_score_codex":0.00001995817,"about_ca_system_score_gemma":0.000009363985,"threshold_uncertainty_score":0.14773762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004382832,0.000072617266,0.9941263,0.00049627584,0.000033655124,0.0007652798,0.00000960641,0.00003969712,0.00007368891],"genre_scores_gemma":[0.7623021,0.000001499398,0.23731358,0.00016441684,0.00008378828,0.00009038743,0.00002813488,0.0000064602505,0.000009647929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989281,0.00020521038,0.00039335832,0.00021310712,0.00012474714,0.00013542012],"domain_scores_gemma":[0.99875087,0.00021716185,0.00030776515,0.00056984037,0.00013399478,0.000020385554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029886715,0.00010627503,0.0001484098,0.000035847792,0.00015602676,0.00007422681,0.00056246517,0.000048845475,0.0000027175129],"category_scores_gemma":[1.9472392e-7,0.0000850581,0.00005791502,0.00038377335,0.000062661675,0.00009719614,0.00014150563,0.00007424598,0.000001475743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015817184,0.0005077993,0.0045376476,0.00007499568,0.00005180949,1.7107017e-7,0.00052689866,0.6322738,0.00877383,0.23235747,0.018879214,0.10200055],"study_design_scores_gemma":[0.00093616947,0.00019528197,0.033208128,0.00012858238,0.000022013026,0.000009837741,0.00002008047,0.90295047,0.022225028,0.006447661,0.03359104,0.00026568503],"about_ca_topic_score_codex":0.00011956839,"about_ca_topic_score_gemma":0.00002899573,"teacher_disagreement_score":0.75791925,"about_ca_system_score_codex":0.00003560079,"about_ca_system_score_gemma":0.000028252529,"threshold_uncertainty_score":0.34685686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97063076,0.000054920463,0.018593814,0.00049042125,0.005010515,0.00042889695,0.0000028763934,0.00014475721,0.0046430593],"genre_scores_gemma":[0.9991806,0.0000033606134,0.00037300965,0.00025586673,0.000013092747,0.000051364415,0.0000022210154,0.000011235626,0.00010920868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847835,0.00019731908,0.00036699846,0.00035701736,0.00029691707,0.00030338997],"domain_scores_gemma":[0.9983748,0.0003212994,0.0001882238,0.0006760507,0.00032795034,0.00011167913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031945118,0.00017405029,0.00032916732,0.00013907622,0.00012839313,0.00010629223,0.0005838552,0.000074565905,0.00008077198],"category_scores_gemma":[0.000049085866,0.00015302171,0.00011212501,0.00053915515,0.00006544118,0.0003131145,0.00015595184,0.00016615872,0.000289624],"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.0000062677886,0.00019409062,0.0008946259,0.000014355782,0.00003426101,0.0000024093922,0.00022747436,0.00016940694,0.0012501633,0.9858764,0.0106938835,0.0006366837],"study_design_scores_gemma":[0.002061782,0.00091672793,0.020824535,0.00017379851,0.0000106133875,0.000023844652,0.00005869026,0.12268724,0.0025542811,0.8447365,0.0053749396,0.00057701475],"about_ca_topic_score_codex":0.0004162978,"about_ca_topic_score_gemma":0.000014158642,"teacher_disagreement_score":0.14113985,"about_ca_system_score_codex":0.000040757914,"about_ca_system_score_gemma":0.000027126076,"threshold_uncertainty_score":0.6240045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9586763,0.00012759314,0.01688551,0.00043273112,0.007817055,0.00013032503,1.3737355e-7,0.00020971739,0.015720643],"genre_scores_gemma":[0.99924624,0.0000034830882,0.0003457779,0.00015961655,0.000015547661,0.000012358806,5.5977046e-7,0.0000073551555,0.00020904656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989583,0.00013281753,0.00022729588,0.0002692428,0.0001575362,0.0002547965],"domain_scores_gemma":[0.9993314,0.00011026446,0.000064118256,0.00039506942,0.0000416988,0.000057433874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005398864,0.00010367582,0.00016961341,0.00014600398,0.00007433724,0.00011939442,0.0005093478,0.00006202001,0.000007356116],"category_scores_gemma":[0.00003705108,0.000098215656,0.000057700803,0.00045418405,0.00001757628,0.0002726723,0.00009213759,0.00013611624,0.000060376027],"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.0000016422679,0.000025933372,0.009433937,0.0000026200062,0.0000038355192,0.000004743623,0.00032505643,0.00015073155,0.00008283531,0.98569065,0.0013933659,0.0028846501],"study_design_scores_gemma":[0.0010293048,0.00019425373,0.02827395,0.00009068396,0.0000022927093,0.000018922927,0.000050584946,0.18031235,0.00038136056,0.7783,0.011026686,0.0003196483],"about_ca_topic_score_codex":0.000113659305,"about_ca_topic_score_gemma":0.00006586695,"teacher_disagreement_score":0.20739068,"about_ca_system_score_codex":0.000031982563,"about_ca_system_score_gemma":0.000013215811,"threshold_uncertainty_score":0.4005118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.902231,0.0002775175,0.056567065,0.00036157388,0.006273002,0.0002672331,0.0000011100984,0.0001440572,0.033877447],"genre_scores_gemma":[0.99664146,0.000002789933,0.0031133788,0.0000935193,0.00000764206,0.0000037446382,1.11638904e-7,0.000006963267,0.00013040708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.000040872706,0.00015577163,0.0002297714,0.00016823181,0.00017303835],"domain_scores_gemma":[0.99933887,0.00008212541,0.000045575936,0.00033821497,0.00008546986,0.00010973325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013990833,0.000100181824,0.00015352333,0.00006436738,0.000060313458,0.000051028066,0.0002627,0.000053707663,0.000025045723],"category_scores_gemma":[0.000018740215,0.00007762634,0.00003407789,0.00017878645,0.0000638611,0.00018485794,0.000062384446,0.00009610606,0.000011169878],"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.000032376574,0.00006370936,0.0011551232,0.000007880186,0.000014100004,0.000018639874,0.0004299639,4.3043678e-7,0.000013103445,0.9948867,0.0015971157,0.0017808776],"study_design_scores_gemma":[0.00069982995,0.0015009103,0.0038833155,0.00010025171,0.000008222297,0.00005225024,0.000037407237,0.00085424475,0.0005350193,0.9916361,0.00052349194,0.00016896786],"about_ca_topic_score_codex":0.00017291747,"about_ca_topic_score_gemma":0.000018684563,"teacher_disagreement_score":0.09441045,"about_ca_system_score_codex":0.000010340532,"about_ca_system_score_gemma":0.000034824017,"threshold_uncertainty_score":0.31655103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97953075,0.00028370452,0.011898822,0.00018246374,0.004831698,0.00023198834,0.0000026588177,0.00009290458,0.0029450145],"genre_scores_gemma":[0.99967563,0.000018757233,0.00014984148,0.00006326024,0.000021580252,0.000019969271,0.000001750994,0.000009680605,0.00003951063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986773,0.00021512443,0.00030840977,0.00023479549,0.00022478198,0.00033954604],"domain_scores_gemma":[0.99898386,0.00028500307,0.00008926192,0.00037084866,0.00013811157,0.00013292042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957538,0.00016300187,0.0002900722,0.00012099789,0.000148848,0.000064838416,0.0002536923,0.00011918452,0.000017141618],"category_scores_gemma":[0.00005837593,0.00014958276,0.00009675212,0.00033375045,0.00006543162,0.0016645917,0.00007505908,0.00015729721,0.000013077083],"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.000008890998,0.00014103459,0.026886102,0.000034047564,0.000028044127,4.3027475e-7,0.0036093832,0.0000044817684,0.0011039266,0.96559346,0.00045270124,0.0021374798],"study_design_scores_gemma":[0.005187894,0.0009473013,0.29713193,0.00020892965,0.00007762555,0.0002535984,0.0014139062,0.029895835,0.043762736,0.6107757,0.008779041,0.0015654629],"about_ca_topic_score_codex":0.00012516131,"about_ca_topic_score_gemma":0.000016995462,"teacher_disagreement_score":0.35481775,"about_ca_system_score_codex":0.000038026945,"about_ca_system_score_gemma":0.000023261611,"threshold_uncertainty_score":0.60998076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99384,0.00008727532,0.0010329126,0.00046761188,0.0020003684,0.00036208818,0.000002868511,0.00003681791,0.002170102],"genre_scores_gemma":[0.9996721,0.00000718079,0.000097031225,0.000077484474,0.000009851604,0.000026499365,2.630901e-7,0.000008499069,0.00010104877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985959,0.00026364558,0.0003256476,0.00031498144,0.00026286102,0.00023698801],"domain_scores_gemma":[0.99832624,0.00046244558,0.0001582326,0.00070283614,0.00027386955,0.000076358505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047466104,0.00015231172,0.0003344926,0.00007310727,0.00012531244,0.000068402675,0.0005671485,0.000097158525,0.00003204528],"category_scores_gemma":[0.00013941654,0.000107721076,0.00013810223,0.0004198384,0.00018332053,0.00048090983,0.00028967,0.00016956103,0.0000060684565],"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.000005089085,0.00012994237,0.10440367,0.000034567765,0.00004388036,5.31092e-7,0.0011588335,0.000007718978,0.003948656,0.8883228,0.0011806278,0.00076369446],"study_design_scores_gemma":[0.0018146585,0.00043269712,0.51861995,0.00017221598,0.000022247383,0.000043569522,0.00058330514,0.012023043,0.021206385,0.4439667,0.0006747719,0.00044045574],"about_ca_topic_score_codex":0.0009178409,"about_ca_topic_score_gemma":0.000064119835,"teacher_disagreement_score":0.44435608,"about_ca_system_score_codex":0.000022214881,"about_ca_system_score_gemma":0.000043595996,"threshold_uncertainty_score":0.4392738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85682726,0.00009124719,0.13513201,0.0005782541,0.0053328103,0.0004739091,0.0000033359577,0.000110972986,0.0014502136],"genre_scores_gemma":[0.9970931,0.0000053455906,0.0026141803,0.00012368486,0.000015906691,0.0000350093,0.0000013276795,0.000010096866,0.00010134893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889165,0.00014024321,0.00027596383,0.0003205215,0.00014888734,0.00022271834],"domain_scores_gemma":[0.99810123,0.0009263496,0.00015164331,0.00039962973,0.00034416493,0.000077004646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000638609,0.00013628745,0.00030782085,0.000053164233,0.00013961602,0.00006642244,0.00032378762,0.000080191785,0.000006198461],"category_scores_gemma":[0.00027015858,0.00012477697,0.00006600147,0.00030628085,0.000057255344,0.0001748589,0.00012396286,0.00008470274,0.0000032567239],"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.000014576893,0.0000845853,0.0012540751,0.000040624836,0.000027085898,3.6395707e-7,0.00023552318,0.00002630892,0.0007712531,0.99401987,0.0018107282,0.0017150053],"study_design_scores_gemma":[0.0037242905,0.0008669603,0.010248409,0.00009367886,0.000019957815,0.000020350906,0.00006250159,0.15870589,0.0029950086,0.8093736,0.013426044,0.0004632775],"about_ca_topic_score_codex":0.00007742172,"about_ca_topic_score_gemma":0.00001995518,"teacher_disagreement_score":0.18464623,"about_ca_system_score_codex":0.000017355318,"about_ca_system_score_gemma":0.000026432284,"threshold_uncertainty_score":0.5088257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95652443,0.001983673,0.005832819,0.00051590573,0.021839948,0.00028250105,0.0000010962776,0.00016732384,0.012852275],"genre_scores_gemma":[0.99923325,0.000023049039,0.00016086733,0.00006961972,0.000026693946,0.000020681116,3.2865674e-7,0.0000075067073,0.00045799627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894714,0.00017155029,0.0002429608,0.00013753821,0.00017003303,0.00033078506],"domain_scores_gemma":[0.99869573,0.0004958539,0.00013700567,0.00049354776,0.00010664465,0.00007121884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086900266,0.00010535017,0.0001601414,0.000051449762,0.00023788738,0.000086285596,0.0006073207,0.000054976907,0.000005202474],"category_scores_gemma":[0.000057844074,0.000073692965,0.00010133691,0.0002759288,0.00007529313,0.00027645973,0.00013228662,0.00011291544,0.000019626657],"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.0000029870548,0.00003703165,0.0029934654,0.000005941398,0.000023749573,4.2994697e-7,0.0008740649,0.000005972042,0.000083040126,0.99198276,0.0025541477,0.0014363899],"study_design_scores_gemma":[0.00091008143,0.00026603157,0.0070023453,0.00006952986,0.000014090877,0.000049763472,0.00073911063,0.007996395,0.0058331266,0.9367464,0.039969593,0.0004035396],"about_ca_topic_score_codex":0.0000538591,"about_ca_topic_score_gemma":0.000011499114,"teacher_disagreement_score":0.055236388,"about_ca_system_score_codex":0.000024521984,"about_ca_system_score_gemma":0.000024152605,"threshold_uncertainty_score":0.30051118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93048674,0.0006815378,0.038889896,0.00032481764,0.018504363,0.00034105766,8.9389556e-7,0.00029091592,0.010479795],"genre_scores_gemma":[0.9987966,0.0000054966067,0.0006048575,0.00024438414,0.00005209231,0.000024567085,0.0000013961895,0.000012500893,0.00025809673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984437,0.00014047089,0.0003719731,0.0002709989,0.00025818407,0.0005146276],"domain_scores_gemma":[0.99914,0.00009565901,0.00009197707,0.00045006504,0.00008188219,0.00014039219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000677426,0.00015658738,0.00023448988,0.00011086269,0.00008680682,0.00012578811,0.0005327976,0.00010763706,0.000019536861],"category_scores_gemma":[0.000034921813,0.00014614125,0.000071479895,0.00045776847,0.000019971305,0.00063598756,0.00016006637,0.00021854615,0.00014513495],"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.000006973387,0.0001811576,0.008798946,0.00001556622,0.000013841543,0.000023462148,0.0022638747,0.0006410351,0.00017767298,0.98016584,0.0038821443,0.0038295148],"study_design_scores_gemma":[0.0025710044,0.00021228292,0.011610841,0.00034236477,0.0000080713135,0.00012873298,0.00035715807,0.89884603,0.0008560501,0.05160288,0.032593466,0.0008711141],"about_ca_topic_score_codex":0.00012160331,"about_ca_topic_score_gemma":0.000013356141,"teacher_disagreement_score":0.92856294,"about_ca_system_score_codex":0.0001253237,"about_ca_system_score_gemma":0.000032703407,"threshold_uncertainty_score":0.59594667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771258,0.00007110577,0.0075832545,0.00017282992,0.0037029414,0.00020205998,9.598702e-7,0.00013155947,0.011009467],"genre_scores_gemma":[0.9993645,0.0000013175279,0.0003225682,0.00010023407,0.000013448154,0.000015477915,0.0000010124834,0.000012274675,0.0001691903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986168,0.00018100684,0.00023712046,0.00034922126,0.0003749845,0.00024086307],"domain_scores_gemma":[0.9985441,0.00015463204,0.00016840592,0.00072021264,0.00026722302,0.00014541947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014447,0.00015643869,0.00028490022,0.000116809315,0.00007278338,0.00006207286,0.0005273812,0.00006283841,0.0000038785033],"category_scores_gemma":[0.00005714144,0.00012449962,0.000068205736,0.0005354366,0.00006248272,0.00027460293,0.00009613866,0.00015298308,0.00003154596],"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.000030820054,0.000121224,0.0014529543,0.0000068988265,0.000028727813,0.00001301543,0.00035444842,0.00023685336,0.0000902784,0.99244314,0.0047083627,0.00051327515],"study_design_scores_gemma":[0.0031609808,0.0016173314,0.0016118943,0.0001391949,0.000011810628,0.000057186375,0.000091734175,0.011226369,0.0057516,0.97398514,0.0019814032,0.00036533657],"about_ca_topic_score_codex":0.00014377973,"about_ca_topic_score_gemma":0.000027722983,"teacher_disagreement_score":0.022238655,"about_ca_system_score_codex":0.00005908415,"about_ca_system_score_gemma":0.0000671595,"threshold_uncertainty_score":0.5076947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42628226,0.0003999101,0.5142873,0.0019789934,0.02877556,0.002488457,0.000004558652,0.0018424175,0.023940548],"genre_scores_gemma":[0.9929333,0.0000041241196,0.0053256494,0.00075741776,0.00012299768,0.000057112637,0.00000860943,0.00001421841,0.00077656884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848616,0.0000734229,0.00030946604,0.00041391628,0.00018006063,0.0005369732],"domain_scores_gemma":[0.9988195,0.000108773034,0.00011370997,0.00062466925,0.00017473588,0.00015862021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000525868,0.00017672704,0.00025424815,0.00006938393,0.00022967572,0.000285864,0.00068364857,0.000117251475,0.000007743658],"category_scores_gemma":[0.000016100788,0.00016145827,0.00012495778,0.00040363456,0.000013553173,0.00064732414,0.000052499276,0.00011814742,0.000020354888],"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.000040846517,0.00010387721,0.00011995653,0.000004566771,0.000019877923,0.0000027112042,0.00021012573,0.00028086023,0.00011845473,0.961261,0.030613286,0.007224435],"study_design_scores_gemma":[0.003305637,0.0016021538,0.00090502086,0.000057040656,0.000015493111,0.000028075547,0.000018182833,0.25283024,0.00059071934,0.7131761,0.026945842,0.0005255421],"about_ca_topic_score_codex":0.0000289356,"about_ca_topic_score_gemma":0.000027264914,"teacher_disagreement_score":0.56665105,"about_ca_system_score_codex":0.00006140657,"about_ca_system_score_gemma":0.000038337046,"threshold_uncertainty_score":0.65840775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97089547,0.000021073301,0.009826271,0.00018961544,0.0053588967,0.00016573025,0.0000013569901,0.00012753504,0.013414041],"genre_scores_gemma":[0.99966115,0.0000032460462,0.000082154234,0.00014389778,0.000010587368,0.000011929172,0.0000013112023,0.000010440007,0.00007526956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854404,0.00030499723,0.00027091446,0.00036114172,0.0002719778,0.00024692388],"domain_scores_gemma":[0.998481,0.0005496626,0.00010055317,0.00058495085,0.00020166834,0.00008218774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038611187,0.00015284431,0.00028022396,0.00014884338,0.00009665947,0.00004657528,0.0004782988,0.000106763764,0.000008726121],"category_scores_gemma":[0.0001453323,0.00013976167,0.00011281303,0.0005420503,0.000047884758,0.0001910286,0.000060701295,0.00018499781,0.00002219098],"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.000017916018,0.000118097574,0.00084497593,0.000008794362,0.000024755504,0.0000026896075,0.00035827854,0.000041808882,0.00056341715,0.99532366,0.001430416,0.0012652163],"study_design_scores_gemma":[0.0015860845,0.0010201843,0.019220036,0.00012160594,0.0000112949765,0.00001213246,0.000035248842,0.05845573,0.006844912,0.9115466,0.00079738064,0.0003487781],"about_ca_topic_score_codex":0.00013928096,"about_ca_topic_score_gemma":0.000013596879,"teacher_disagreement_score":0.083777025,"about_ca_system_score_codex":0.00003797341,"about_ca_system_score_gemma":0.000030451474,"threshold_uncertainty_score":0.56993157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96827096,0.00028737134,0.007381418,0.00041728507,0.011648842,0.00030788424,0.0000049104874,0.00023882726,0.011442532],"genre_scores_gemma":[0.999275,0.000003991021,0.00036865592,0.00006382145,0.000023092898,0.000017468798,0.000001944379,0.00001105971,0.00023496049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838084,0.00026343382,0.00038472627,0.0003280905,0.00036665922,0.00027627833],"domain_scores_gemma":[0.99796253,0.0002760534,0.00016318732,0.0010111646,0.00040710584,0.0001799802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064529636,0.00015606775,0.00035887933,0.00016632507,0.00007027896,0.00007843422,0.0010747793,0.00011823043,0.000009460336],"category_scores_gemma":[0.00048280664,0.00014116183,0.00013559754,0.00082365214,0.000052736457,0.00043050662,0.00028488258,0.00015719175,0.000031592364],"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.00002033772,0.00013869867,0.0028986149,0.00000815146,0.000032471147,0.000009673468,0.0005520786,0.000023297627,0.00016390177,0.9621407,0.033276785,0.00073529925],"study_design_scores_gemma":[0.0056168414,0.00075533404,0.0047180518,0.000060678187,0.00001719161,0.000044204513,0.00021335468,0.014339635,0.0028389017,0.9620291,0.008932108,0.00043460773],"about_ca_topic_score_codex":0.00025196627,"about_ca_topic_score_gemma":0.00002322236,"teacher_disagreement_score":0.031004075,"about_ca_system_score_codex":0.00006407651,"about_ca_system_score_gemma":0.0001251345,"threshold_uncertainty_score":0.5756412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8602808,0.0010437744,0.09184701,0.00011121012,0.018232198,0.00044749744,8.076577e-7,0.00034994,0.027686736],"genre_scores_gemma":[0.9988751,0.00001627325,0.0008309473,0.00006369188,0.000013809952,0.0000088027255,6.472595e-7,0.000008893181,0.00018187836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988704,0.000097546785,0.00033779314,0.00027288377,0.00018646066,0.00023496614],"domain_scores_gemma":[0.9989193,0.00009119363,0.00017696731,0.00058254757,0.00014996468,0.000080010774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039266062,0.000116866955,0.00022281062,0.00014646116,0.000066415254,0.000025231157,0.00061073917,0.00008416499,0.000019060573],"category_scores_gemma":[0.000027046004,0.00010293871,0.00009267191,0.0008095778,0.000031554042,0.00022585629,0.0001864883,0.000105250656,0.000038909806],"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.000010599507,0.00012987155,0.0025001024,0.000008642867,0.000030257406,0.000007650816,0.00052098604,0.00011670424,0.00018632818,0.99029696,0.0037239445,0.0024679299],"study_design_scores_gemma":[0.0021637944,0.0012653894,0.016158883,0.00015868488,0.000040611474,0.00006325289,0.00016242468,0.62923276,0.01423191,0.3318878,0.0037662808,0.00086821674],"about_ca_topic_score_codex":0.00008371679,"about_ca_topic_score_gemma":0.00000193936,"teacher_disagreement_score":0.6584092,"about_ca_system_score_codex":0.000023936347,"about_ca_system_score_gemma":0.00001747019,"threshold_uncertainty_score":0.41977188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8557291,0.000083477826,0.008532758,0.006418575,0.031738367,0.00057098625,8.711974e-7,0.000113573384,0.0968123],"genre_scores_gemma":[0.9986262,0.0000010514527,0.000063427986,0.0004450242,0.000039718965,0.000013943514,2.291332e-7,0.0000054773286,0.0008049272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989456,0.0002476142,0.0001928274,0.00014522165,0.00031381386,0.00015494392],"domain_scores_gemma":[0.99880016,0.0002478514,0.00013883995,0.0006008296,0.00017378724,0.0000385307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086179236,0.00008058013,0.000105727304,0.000012006615,0.00012566944,0.00006524214,0.0007835198,0.000048265054,0.000013214873],"category_scores_gemma":[0.000103701735,0.000043113225,0.00006999136,0.00036198756,0.00003848597,0.00012641957,0.00015748142,0.00013103512,0.00007572422],"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.0000032397793,0.000022393999,0.0007316527,0.0000011480527,0.000007661278,3.8101416e-7,0.00030395467,0.00046505308,0.0000034413633,0.92095,0.07723879,0.0002723103],"study_design_scores_gemma":[0.00041225296,0.000063124746,0.0009528365,0.000048777267,0.0000038832077,0.000011750603,0.00006059652,0.043174922,0.00029440966,0.9450292,0.009855147,0.000093090464],"about_ca_topic_score_codex":0.000032593427,"about_ca_topic_score_gemma":0.0000056623726,"teacher_disagreement_score":0.14289711,"about_ca_system_score_codex":0.000046277124,"about_ca_system_score_gemma":0.000043055355,"threshold_uncertainty_score":0.17581064},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20703337,0.00012951742,0.7608159,0.0001793882,0.02006859,0.0005522768,0.0000017881406,0.000561131,0.010658015],"genre_scores_gemma":[0.97556233,0.0000046367913,0.022794165,0.0003908124,0.000108988934,0.000053349253,0.0000035139656,0.000024622874,0.0010576004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981758,0.000106923675,0.00035360962,0.00057660404,0.00026649694,0.00052058423],"domain_scores_gemma":[0.9983837,0.000035968354,0.00010027231,0.0009566938,0.00017984101,0.00034354333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048254177,0.000225496,0.000262132,0.00012236334,0.00021796871,0.00024938013,0.0013020196,0.00014374542,0.000091079855],"category_scores_gemma":[0.000005371701,0.00021056611,0.00009090771,0.0005604601,0.000027975713,0.0006974705,0.00022376548,0.000214825,0.00022752701],"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.00003773842,0.00027249553,0.0005246717,0.0000041562002,0.000045663222,0.000060840837,0.0019871918,0.0016050083,0.000050115195,0.95987874,0.01224773,0.023285665],"study_design_scores_gemma":[0.002566306,0.0016163357,0.0043471144,0.000078022415,0.000018652878,0.00011171527,0.00013381997,0.9438845,0.0019459614,0.030966677,0.013221269,0.001109657],"about_ca_topic_score_codex":0.00018681724,"about_ca_topic_score_gemma":0.000009235346,"teacher_disagreement_score":0.94227946,"about_ca_system_score_codex":0.000059332975,"about_ca_system_score_gemma":0.000041603762,"threshold_uncertainty_score":0.8586637},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78286564,0.000042010153,0.11805732,0.010673812,0.021188214,0.0004407205,7.7784705e-7,0.00047306332,0.06625845],"genre_scores_gemma":[0.9973305,0.0000018583908,0.00018289966,0.0018722744,0.000053210686,0.000025692252,4.039178e-7,0.000008796422,0.00052438956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987648,0.00034960976,0.00016559545,0.00027440957,0.00022073096,0.00022481628],"domain_scores_gemma":[0.99849385,0.0005760957,0.00007990615,0.00072165293,0.000072418414,0.000056048022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008159235,0.00011984233,0.00015264392,0.000040359304,0.0002443755,0.000180299,0.0006891538,0.000060175276,0.000023314347],"category_scores_gemma":[0.00013288185,0.00007866667,0.00008097548,0.00022197832,0.000026851052,0.00013445973,0.00010679399,0.00016155149,0.0002567905],"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.0000032302744,0.000025561973,0.00006682138,0.0000013704027,0.0000072959024,0.0000011591605,0.0001600501,0.00008027569,0.000115903305,0.9860632,0.011744104,0.0017310266],"study_design_scores_gemma":[0.0007338093,0.00025058613,0.000608022,0.000029435672,0.000003527735,0.000012560447,0.000011033281,0.2017384,0.0020048455,0.7039761,0.090393014,0.00023865823],"about_ca_topic_score_codex":0.00004634101,"about_ca_topic_score_gemma":0.000009318444,"teacher_disagreement_score":0.2820871,"about_ca_system_score_codex":0.00003774525,"about_ca_system_score_gemma":0.000016537339,"threshold_uncertainty_score":0.3300608},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58024204,0.0009939838,0.0864634,0.00514192,0.11316414,0.000529088,0.0000031317404,0.0012586911,0.2122036],"genre_scores_gemma":[0.998513,0.0000020083417,0.0003489824,0.000605515,0.0000697802,0.000013210478,5.277042e-7,0.0000087940925,0.0004382277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890816,0.0000995979,0.00017370861,0.00019933213,0.00022996332,0.00038925154],"domain_scores_gemma":[0.99899316,0.00029181037,0.000032257325,0.00045259006,0.00005982643,0.00017033104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003618768,0.00011169268,0.00013684195,0.00005885324,0.0001280601,0.000106176776,0.00041306324,0.00007253979,0.0000525161],"category_scores_gemma":[0.00010892426,0.00009734466,0.00006847368,0.00019790197,0.000028458082,0.0004368749,0.000090135945,0.00015027418,0.00057126686],"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.0000024648348,0.000110230176,0.0005269814,0.0000028914717,0.0000058246637,0.0000032011976,0.0002143206,0.000005024252,0.000020377229,0.97648257,0.021634191,0.0009918973],"study_design_scores_gemma":[0.0008307598,0.00046439067,0.0048349984,0.00008389191,0.000008747146,0.000069736736,0.000052111674,0.014548068,0.0009548272,0.9326481,0.04498877,0.00051558594],"about_ca_topic_score_codex":0.000012136619,"about_ca_topic_score_gemma":0.000001194934,"teacher_disagreement_score":0.41827092,"about_ca_system_score_codex":0.00005165353,"about_ca_system_score_gemma":0.0000145407885,"threshold_uncertainty_score":0.734267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626055,0.00009970145,0.010088914,0.0021093378,0.014264097,0.00020241269,0.0000031310074,0.00019053943,0.010436373],"genre_scores_gemma":[0.9982444,0.000009464401,0.00020812017,0.00052079395,0.000039275128,0.000013710214,8.420589e-7,0.000009545028,0.00095382717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906564,0.00004539178,0.00019129168,0.00029025032,0.00016385308,0.00024355769],"domain_scores_gemma":[0.9991615,0.000093597046,0.00005717358,0.0004551454,0.00011182263,0.0001207856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028018467,0.00011537876,0.00015079061,0.00006627113,0.00023822694,0.00030344984,0.00031209813,0.0001261892,0.00009451766],"category_scores_gemma":[0.000018822147,0.00010851846,0.000041668776,0.00019008624,0.000047336824,0.0004901563,0.000099728706,0.0003149411,0.000044720084],"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.0000024870164,0.000040481096,0.0045506973,0.0000032892722,0.000020116,0.0000030053318,0.00027202157,0.0000063128614,0.0009538476,0.9844562,0.009140113,0.0005514432],"study_design_scores_gemma":[0.002073293,0.00017362602,0.04084658,0.00003111913,0.00001420387,0.00017780815,0.00026962426,0.041609664,0.0019494571,0.7546656,0.15756123,0.00062781136],"about_ca_topic_score_codex":0.0002644917,"about_ca_topic_score_gemma":0.00016563764,"teacher_disagreement_score":0.2297906,"about_ca_system_score_codex":0.000019327323,"about_ca_system_score_gemma":0.00004860291,"threshold_uncertainty_score":0.44252545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99164474,0.000085056905,0.001950491,0.00011625613,0.0021033569,0.00026623908,0.0000026013975,0.00004825046,0.0037829857],"genre_scores_gemma":[0.9996831,0.000007659247,0.00015269594,0.00004496992,0.0000068879544,0.000017019167,8.988942e-7,0.000006688629,0.00008011696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860704,0.00024901817,0.0004073139,0.0003040189,0.00023073849,0.0002018596],"domain_scores_gemma":[0.9982497,0.00054582657,0.0002662571,0.0005635442,0.00028732774,0.000087313674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039338088,0.00013574687,0.00033329593,0.00012842282,0.00006694175,0.000043508506,0.00039596503,0.00010566996,0.000014085022],"category_scores_gemma":[0.00014947983,0.00012025736,0.00007871051,0.00044406825,0.00009052804,0.00026537327,0.00015100163,0.00013245607,0.00001009897],"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.000011409898,0.00015603067,0.0034408325,0.000038206814,0.000026949809,9.597345e-7,0.00031866584,0.000005036026,0.0014514296,0.98918766,0.0032425954,0.0021202073],"study_design_scores_gemma":[0.0016674721,0.0010195079,0.1441454,0.00014903958,0.000011623621,0.0000098794035,0.00008705549,0.015328078,0.0068531106,0.83021235,0.00019364018,0.00032282833],"about_ca_topic_score_codex":0.0004955157,"about_ca_topic_score_gemma":0.0000120685945,"teacher_disagreement_score":0.15897532,"about_ca_system_score_codex":0.000023087705,"about_ca_system_score_gemma":0.000034743036,"threshold_uncertainty_score":0.4903953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7187483,0.0005204034,0.26348105,0.0000677351,0.005824049,0.00025400936,3.5676283e-7,0.00012939965,0.010974711],"genre_scores_gemma":[0.99887156,0.000010940863,0.0010248821,0.00003176573,0.000011400381,0.0000063572343,4.4242054e-7,0.0000049808264,0.000037652233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993104,0.000060832368,0.0002190727,0.00017526382,0.000103049286,0.00013138709],"domain_scores_gemma":[0.9994322,0.000051002076,0.0001280024,0.00024381177,0.00010210343,0.000042891603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003714427,0.000072313545,0.00013076459,0.000050430965,0.000062614425,0.000030485879,0.00023384648,0.00005222118,0.0000053746885],"category_scores_gemma":[0.000020462914,0.00006740823,0.000029041681,0.00018330911,0.000027486722,0.00020844987,0.00008949089,0.00006801935,0.0000038069036],"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.000002675105,0.0000311744,0.0025401823,0.000013291009,0.0000103912935,0.0000029439457,0.0011781353,0.000039289116,0.000082904866,0.9903853,0.0001978494,0.0055158455],"study_design_scores_gemma":[0.001142172,0.00033941458,0.021960523,0.00016342574,0.000015802156,0.00007302689,0.00024894674,0.6882818,0.002894976,0.28410655,0.00039545548,0.00037794822],"about_ca_topic_score_codex":0.00009337687,"about_ca_topic_score_gemma":0.0000039920874,"teacher_disagreement_score":0.70627874,"about_ca_system_score_codex":0.000015686586,"about_ca_system_score_gemma":0.000012004361,"threshold_uncertainty_score":0.2748828},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9735782,0.00008112381,0.02295236,0.0003715286,0.0016101709,0.00072068383,1.7637025e-7,0.00007111718,0.0006146318],"genre_scores_gemma":[0.99938715,0.000010429755,0.0003239453,0.00007026554,0.000013960244,0.00012821559,0.0000012037044,0.0000091901165,0.000055628927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988982,0.00009932114,0.00032339385,0.00035569313,0.00013153003,0.0001918294],"domain_scores_gemma":[0.9993232,0.000054493546,0.00010911417,0.00030196353,0.00013891577,0.00007234029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037285904,0.000113698465,0.00018297815,0.00011692075,0.00007028738,0.000072692725,0.00026266824,0.00005966039,0.000007506037],"category_scores_gemma":[0.00001684684,0.000109818255,0.000031099415,0.0005355415,0.000009402446,0.00051415386,0.00017058512,0.00011931816,0.000029516908],"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.000008160497,0.000090943075,0.008129128,0.000041352563,0.000012184251,8.9152957e-7,0.002901692,0.0019140004,0.0037797762,0.96573937,0.0006789908,0.016703539],"study_design_scores_gemma":[0.00090638734,0.00024188375,0.036801923,0.00035467587,0.0000073162287,0.0000538087,0.00033686706,0.38741738,0.004271569,0.56863755,0.00045463536,0.00051602366],"about_ca_topic_score_codex":0.0007616329,"about_ca_topic_score_gemma":0.00010438082,"teacher_disagreement_score":0.3971018,"about_ca_system_score_codex":0.000046084388,"about_ca_system_score_gemma":0.000010165651,"threshold_uncertainty_score":0.44782585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2556777,0.00004515218,0.7371766,0.00008918138,0.005953204,0.00039701813,0.0000040809714,0.00015771727,0.00049934676],"genre_scores_gemma":[0.9905398,0.0000019667611,0.009199669,0.00008003749,0.00004072316,0.00005480984,0.0000038828252,0.000014829432,0.00006428354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865335,0.00018615981,0.00031789715,0.00040708468,0.00015498727,0.00028050438],"domain_scores_gemma":[0.9984129,0.00022451498,0.00019748286,0.00080504705,0.00025220227,0.00010781914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009457876,0.00015002182,0.0003143279,0.000096022166,0.00013923411,0.00008215313,0.00067837455,0.00011287139,0.000002592308],"category_scores_gemma":[0.000053870695,0.00014276619,0.00014450104,0.00027232635,0.00004703371,0.00038911268,0.00007120066,0.000095911724,0.0000036677989],"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.000005514846,0.0001337736,0.00019957876,0.000017352364,0.000025608097,3.964271e-7,0.00017987232,0.000012894061,0.002994781,0.9387721,0.000815898,0.056842234],"study_design_scores_gemma":[0.001007548,0.0007204627,0.0007667889,0.000020364158,0.000007572917,0.000005959301,0.000020952202,0.5694831,0.008644923,0.41662246,0.0025024794,0.00019741878],"about_ca_topic_score_codex":0.000075092226,"about_ca_topic_score_gemma":0.000010433903,"teacher_disagreement_score":0.7348621,"about_ca_system_score_codex":0.00002848121,"about_ca_system_score_gemma":0.000024195893,"threshold_uncertainty_score":0.5821836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6599725,0.0005080861,0.2357295,0.013895545,0.076343186,0.0028064451,0.00006610179,0.0013680418,0.009310615],"genre_scores_gemma":[0.994941,0.0000032429991,0.0028953308,0.0016091156,0.000039676706,0.00010545911,0.0000044704107,0.000015316045,0.00038642035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985166,0.00005794492,0.0003215118,0.0004385591,0.00022371233,0.00044163907],"domain_scores_gemma":[0.9986592,0.00019635902,0.000051565272,0.0005503541,0.00019887357,0.0003436292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029490938,0.00016311307,0.00021491315,0.00019704468,0.00026539338,0.00013042091,0.00068762875,0.0000894938,0.000040086234],"category_scores_gemma":[0.00009557586,0.00015966079,0.0001761569,0.0004607178,0.00005076826,0.0003796895,0.0001262098,0.00011431522,0.00007772178],"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.000006587398,0.0001403918,0.00010292248,0.000006671707,0.00001636022,0.0000046270497,0.0011828534,0.000006144604,0.00008252464,0.9369432,0.06139758,0.00011016075],"study_design_scores_gemma":[0.00047448633,0.0005109495,0.0005976256,0.000026144451,0.000010392672,0.000014850312,0.00010383505,0.0023696274,0.0007278665,0.9872313,0.0076901345,0.00024277718],"about_ca_topic_score_codex":0.000117696545,"about_ca_topic_score_gemma":0.00001635299,"teacher_disagreement_score":0.3349685,"about_ca_system_score_codex":0.00003830283,"about_ca_system_score_gemma":0.00006901928,"threshold_uncertainty_score":0.6510778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97974586,0.00047239815,0.001820109,0.0011429103,0.0060650795,0.0002498896,8.655083e-7,0.00032498405,0.010177874],"genre_scores_gemma":[0.99842304,0.000013394175,0.0008882585,0.0004139373,0.000046423225,0.000030415735,0.0000019275974,0.0000150006545,0.00016761218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820536,0.00019436117,0.0004461801,0.00045167524,0.00025999578,0.00044243602],"domain_scores_gemma":[0.9989347,0.00018632661,0.00013281807,0.0005256721,0.00010977144,0.000110732166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005532154,0.00018860846,0.00027618138,0.00022389526,0.00013911769,0.00021059907,0.00073506386,0.000090958245,0.00003325956],"category_scores_gemma":[0.00006758579,0.00018495083,0.00009351811,0.00074940524,0.00002925039,0.0007406664,0.00017140433,0.00025705973,0.00014641965],"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.00000973276,0.00012845291,0.0062042996,0.000009580524,0.000023582179,0.000030512854,0.001979685,0.00047597705,0.00036687625,0.9783758,0.0038237027,0.00857181],"study_design_scores_gemma":[0.007814256,0.0005833475,0.02060106,0.000492176,0.000022823731,0.000111682224,0.00059406244,0.46410418,0.004316858,0.45501688,0.044780683,0.001561984],"about_ca_topic_score_codex":0.00018649692,"about_ca_topic_score_gemma":0.00020351415,"teacher_disagreement_score":0.5233589,"about_ca_system_score_codex":0.0001041741,"about_ca_system_score_gemma":0.000046110585,"threshold_uncertainty_score":0.7542076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97249514,0.00022545266,0.001240902,0.0065071927,0.004557286,0.0003328612,8.5133127e-7,0.00023575834,0.014404566],"genre_scores_gemma":[0.99673885,0.000019782483,0.00012699004,0.002548042,0.000036910827,0.000012666359,7.085388e-7,0.000009355505,0.0005067106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861664,0.00016054382,0.0002439763,0.0003894681,0.0002759266,0.00031347087],"domain_scores_gemma":[0.9987576,0.0002969728,0.00007392219,0.0006909527,0.0000803222,0.000100231446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004857619,0.0001848847,0.00021367254,0.00007270658,0.00030538073,0.0002838848,0.00065302127,0.000096339216,0.00002012107],"category_scores_gemma":[0.00006695941,0.00012630137,0.000078754536,0.0003342293,0.000036770623,0.00024236483,0.00009046515,0.00021507377,0.000097248834],"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.000005903142,0.000056981742,0.000076295095,0.0000019875422,0.000012295232,0.000010100911,0.00035507474,0.000011604842,0.0004074208,0.9804588,0.01517552,0.0034280114],"study_design_scores_gemma":[0.0010511733,0.0007635554,0.0046464666,0.000089864734,0.000012104556,0.00010481949,0.00011928954,0.027051946,0.0011123248,0.9538408,0.010767362,0.00044029002],"about_ca_topic_score_codex":0.000026471322,"about_ca_topic_score_gemma":0.00000350305,"teacher_disagreement_score":0.027040342,"about_ca_system_score_codex":0.000042219133,"about_ca_system_score_gemma":0.000024157247,"threshold_uncertainty_score":0.51504207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9720909,0.0004442034,0.016420295,0.0002316456,0.005013832,0.00015682151,7.4574206e-7,0.00008885892,0.0055527086],"genre_scores_gemma":[0.99931604,0.0000062857093,0.0005221255,0.00005820955,0.000013359063,0.000008311413,4.570125e-7,0.000006430415,0.00006879845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895436,0.00011458139,0.00022194654,0.00025831442,0.00026856133,0.00018226591],"domain_scores_gemma":[0.9991483,0.00011220705,0.000112486516,0.0003522819,0.00014302314,0.00013170847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993636,0.00010558632,0.00020380254,0.00006661859,0.000053771597,0.00008662973,0.00036370556,0.00006905561,0.0000035363585],"category_scores_gemma":[0.000059175698,0.00009533558,0.000038891943,0.00018268653,0.000039243456,0.00040032505,0.00020857231,0.00009586416,0.0000135739],"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.000013335463,0.00008094267,0.0064620255,0.000015298809,0.000025673835,0.000010733062,0.0007823189,0.000014261575,0.00020027411,0.9868856,0.0013494948,0.004160049],"study_design_scores_gemma":[0.0030057004,0.0010403066,0.013983029,0.00009380352,0.000018719946,0.00011752769,0.00051917386,0.035724495,0.0016658927,0.9371181,0.0062742983,0.0004389633],"about_ca_topic_score_codex":0.00019740246,"about_ca_topic_score_gemma":0.000043122996,"teacher_disagreement_score":0.0497675,"about_ca_system_score_codex":0.00003866947,"about_ca_system_score_gemma":0.000033396787,"threshold_uncertainty_score":0.3887672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8502428,0.0005372774,0.052815344,0.0014405092,0.042504966,0.0005755895,0.0000034863656,0.001314145,0.05056588],"genre_scores_gemma":[0.99771667,0.0000039032175,0.0013026689,0.00025328674,0.0000372144,0.000025580246,0.000004267828,0.000015909136,0.0006405268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982932,0.00019745775,0.0003371979,0.00042518068,0.00036503715,0.0003819093],"domain_scores_gemma":[0.99838614,0.00010715345,0.0001292596,0.0007044225,0.00040043064,0.00027260947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357638,0.00018826067,0.00026200523,0.00012738448,0.00012450016,0.00023559261,0.00087694015,0.0001203709,0.0000143859825],"category_scores_gemma":[0.000078397585,0.00017632966,0.00010123168,0.00061150175,0.00004007819,0.00043691383,0.00020305652,0.00018634707,0.00026387512],"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.0000092782475,0.00006365585,0.00063877914,0.0000041563826,0.000029258139,0.000028758901,0.0005186569,0.00015892494,0.00008290913,0.95495945,0.04296671,0.0005394443],"study_design_scores_gemma":[0.0056785783,0.0011786276,0.002988104,0.00012076426,0.000027317283,0.00025611115,0.0005300738,0.09127354,0.0030330156,0.83045554,0.063100494,0.0013578497],"about_ca_topic_score_codex":0.00014035606,"about_ca_topic_score_gemma":0.000030223167,"teacher_disagreement_score":0.14747384,"about_ca_system_score_codex":0.00008314314,"about_ca_system_score_gemma":0.00011396545,"threshold_uncertainty_score":0.7190515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87402207,0.0001341984,0.11042572,0.0013113181,0.0038389256,0.0004563918,0.0000019305235,0.00036200875,0.009447424],"genre_scores_gemma":[0.9941045,0.000005462975,0.005317004,0.00027406897,0.00006387716,0.000045637546,0.0000026935543,0.000023118651,0.00016360698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817365,0.00019329847,0.0003603431,0.000502653,0.00033167246,0.00043838978],"domain_scores_gemma":[0.9983935,0.00017907516,0.00012685361,0.0010822358,0.00013141458,0.000086969725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043504575,0.00022453496,0.00032836088,0.000086280714,0.000164365,0.00022580817,0.0011156966,0.00012593906,0.0000040524947],"category_scores_gemma":[0.00012711993,0.00018067368,0.00006965003,0.00047295427,0.00006294937,0.0006955563,0.0003004136,0.00027224986,0.00003001011],"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.00003527193,0.00018766937,0.015647491,0.000037073045,0.00003081953,0.00003191547,0.0022866093,0.0021401583,0.00009591433,0.9699033,0.0057831956,0.0038205835],"study_design_scores_gemma":[0.005318657,0.0007564809,0.018179838,0.00056300353,0.000017415381,0.00012260533,0.00028150773,0.5122504,0.00084174715,0.43130627,0.029440979,0.0009210403],"about_ca_topic_score_codex":0.0004950154,"about_ca_topic_score_gemma":0.00048941973,"teacher_disagreement_score":0.538597,"about_ca_system_score_codex":0.00008154752,"about_ca_system_score_gemma":0.000051845025,"threshold_uncertainty_score":0.7367659},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9259066,0.000078681645,0.04122423,0.0004701096,0.02591441,0.000577221,0.000005304878,0.00022543642,0.0055980165],"genre_scores_gemma":[0.9982968,0.0000023711812,0.0013749573,0.00006049349,0.000023165254,0.00004015863,0.0000018378511,0.000008925806,0.00019128571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991317,0.000033447337,0.00026608934,0.00022977931,0.00012882924,0.00021017052],"domain_scores_gemma":[0.99868876,0.0003352159,0.00015373965,0.0004548292,0.00030318557,0.00006427583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038251455,0.000101433696,0.00021229702,0.00009055161,0.000097980104,0.00006618502,0.00051198195,0.000100996,0.000015620086],"category_scores_gemma":[0.00012187433,0.00009267944,0.000114485374,0.00025619447,0.000036200465,0.00026195624,0.000051557075,0.00014897283,0.000009303058],"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.000007902205,0.000058681588,0.00044741406,0.0000124974085,0.000022268423,7.9017286e-7,0.00012766934,0.000003391868,0.011839231,0.98064125,0.0044903187,0.0023485762],"study_design_scores_gemma":[0.001609131,0.0003084405,0.0015258155,0.000028698767,0.0000108113,0.000022902937,0.000044246743,0.011137352,0.07751178,0.88866085,0.018882932,0.00025705868],"about_ca_topic_score_codex":0.000043562934,"about_ca_topic_score_gemma":0.000028649196,"teacher_disagreement_score":0.091980435,"about_ca_system_score_codex":0.00000772294,"about_ca_system_score_gemma":0.000039255116,"threshold_uncertainty_score":0.37793577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930581,0.00011143941,0.00073284033,0.00020852906,0.004261517,0.00013446347,3.9809285e-7,0.00008104952,0.0014116726],"genre_scores_gemma":[0.9994503,0.000005375862,0.00034016994,0.000052171203,0.000017086288,0.000013275012,1.9244582e-7,0.000007084254,0.00011429798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991839,0.000060709506,0.00019827453,0.00024641407,0.00014351915,0.00016717744],"domain_scores_gemma":[0.99925435,0.00008017692,0.000080362144,0.00040806597,0.00011394403,0.00006313105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035343107,0.00010365224,0.0002004048,0.000057803834,0.00009101344,0.00007258716,0.00032450224,0.00008164445,0.00000781784],"category_scores_gemma":[0.00007313397,0.00008483252,0.000045549565,0.00017045208,0.00006875824,0.0003263303,0.00014446363,0.00017346487,0.000008459499],"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.0000042266747,0.00005781726,0.0031339424,0.000021635931,0.000016496366,0.000002142548,0.00059237995,0.000001676927,0.032260615,0.95974255,0.00042125507,0.0037452732],"study_design_scores_gemma":[0.00250084,0.00071276614,0.026744477,0.00017006621,0.000025048377,0.00023257616,0.00024748134,0.05421035,0.13590881,0.7717126,0.0066267606,0.0009082334],"about_ca_topic_score_codex":0.0001121822,"about_ca_topic_score_gemma":0.00005372883,"teacher_disagreement_score":0.18802994,"about_ca_system_score_codex":0.000008886301,"about_ca_system_score_gemma":0.000031923963,"threshold_uncertainty_score":0.34593698},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63874793,0.00012972472,0.3204715,0.0021792492,0.012748525,0.0011183124,0.0000034828909,0.00026921564,0.024332084],"genre_scores_gemma":[0.9968895,0.0000048428983,0.0025832132,0.00009488634,0.000016716614,0.000052261177,8.821979e-7,0.000011650389,0.000346064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896014,0.00009419615,0.00024600202,0.00023647405,0.00020743276,0.00025574898],"domain_scores_gemma":[0.9983735,0.0004470768,0.00014786293,0.0006620871,0.00030625446,0.000063200554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660109,0.00011118575,0.00018878884,0.00003038496,0.00036068002,0.0001214372,0.00058931456,0.000057101286,0.0000033273097],"category_scores_gemma":[0.000055991124,0.00007209941,0.000090901085,0.0002540512,0.00008159922,0.00014612699,0.000083769184,0.000091714144,0.000015245757],"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.000016051965,0.000042313415,0.00063271425,0.000008071495,0.000028915932,3.9632314e-7,0.00012479226,0.0000053274307,0.000036153742,0.9934694,0.0029932407,0.0026426062],"study_design_scores_gemma":[0.00082863827,0.00023813381,0.0012236328,0.00005065573,0.000010687447,0.00001991967,0.00004497633,0.011416552,0.00031601734,0.9715958,0.01411627,0.00013868374],"about_ca_topic_score_codex":0.000042352913,"about_ca_topic_score_gemma":0.00005479292,"teacher_disagreement_score":0.35814157,"about_ca_system_score_codex":0.000018188914,"about_ca_system_score_gemma":0.00003624166,"threshold_uncertainty_score":0.29401284},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587234,0.00002409253,0.014834539,0.00070344936,0.008325444,0.0002724632,6.448868e-7,0.0003234196,0.016792493],"genre_scores_gemma":[0.99911934,0.0000023818259,0.00019582981,0.0004949222,0.000025197978,0.00003541449,0.0000012167745,0.000014571792,0.0001111416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981072,0.00037330648,0.00032251433,0.0005397724,0.00025807729,0.00039913517],"domain_scores_gemma":[0.99840176,0.0005279358,0.00011316819,0.0007590545,0.00009255395,0.000105514206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008918867,0.00020140372,0.0003063042,0.00025844912,0.00012677033,0.00014024362,0.00068015564,0.00013562487,0.000012273732],"category_scores_gemma":[0.00023932537,0.00019094808,0.00010432803,0.0007939552,0.000030138603,0.00031039276,0.000121255885,0.00030973004,0.00015881722],"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.000012282329,0.00012451697,0.001838101,0.0000066635707,0.000007080949,0.000008527765,0.0003554097,0.00012640827,0.0001666858,0.99126434,0.001286579,0.00480341],"study_design_scores_gemma":[0.0020222908,0.0005453735,0.019015078,0.000119678305,0.0000034435807,0.000018985182,0.00001808665,0.1370861,0.001707414,0.832907,0.0060770083,0.0004795115],"about_ca_topic_score_codex":0.00015642447,"about_ca_topic_score_gemma":0.00013489668,"teacher_disagreement_score":0.1583573,"about_ca_system_score_codex":0.00009872166,"about_ca_system_score_gemma":0.00003081585,"threshold_uncertainty_score":0.7786637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87603766,0.00007351233,0.095325194,0.00025123623,0.0068294667,0.00014809992,5.233798e-7,0.00017656431,0.021157755],"genre_scores_gemma":[0.9989842,0.0000022744944,0.0007146501,0.0000838706,0.000020330799,0.0000083818595,3.945385e-7,0.000007332124,0.00017856841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989562,0.00015638201,0.0002467992,0.00025565553,0.0001921237,0.00019285243],"domain_scores_gemma":[0.9989164,0.00022386361,0.00011123087,0.0005618806,0.00012231841,0.00006429119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006149853,0.00010311038,0.00022431962,0.00006559287,0.000073067524,0.000048487807,0.000528158,0.00007137517,0.0000141151195],"category_scores_gemma":[0.000090432695,0.00009544602,0.00008902763,0.00025244866,0.00002806835,0.0002706253,0.00010827544,0.00009936167,0.000037873993],"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.0000022239103,0.00006008805,0.0009959999,0.000009657918,0.0000111822965,0.0000010275143,0.00017097518,0.000032069973,0.0011087109,0.9906231,0.0014229901,0.005561948],"study_design_scores_gemma":[0.0012938182,0.00044962586,0.0076132366,0.00007515691,0.0000102982885,0.0000384324,0.000040593342,0.13686426,0.012829078,0.82706743,0.01330899,0.00040907855],"about_ca_topic_score_codex":0.000066061,"about_ca_topic_score_gemma":0.000008003738,"teacher_disagreement_score":0.1635557,"about_ca_system_score_codex":0.000024857636,"about_ca_system_score_gemma":0.000020418314,"threshold_uncertainty_score":0.38921756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903504,0.00008026787,0.0010240979,0.00038061818,0.005873073,0.00024431176,0.0000020613077,0.00011761935,0.0019275071],"genre_scores_gemma":[0.9994616,0.000004842963,0.00037924416,0.00004062099,0.000025789694,0.00001784847,7.29356e-7,0.000010801262,0.000058535777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861735,0.00014412703,0.00026455254,0.0004914762,0.00021190644,0.00027057366],"domain_scores_gemma":[0.9985888,0.00022554031,0.00012575077,0.00074133597,0.00020299632,0.00011556542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008113561,0.00016957872,0.00031821907,0.000115420036,0.00015983518,0.00009520613,0.00042721254,0.000098114164,0.000010944657],"category_scores_gemma":[0.00016812871,0.0001577387,0.00008279151,0.00038808584,0.00011945619,0.00048736224,0.00016262503,0.00032024187,0.0000059894924],"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.000005391735,0.000103358594,0.03160354,0.000022153168,0.000022264812,0.0000040182204,0.00048959587,0.0000018785793,0.011998388,0.95196587,0.000491145,0.003292419],"study_design_scores_gemma":[0.0017310213,0.00053573266,0.19743878,0.00006061042,0.000023154691,0.00022616088,0.000112035625,0.011049327,0.048020992,0.7372322,0.0028254648,0.000744517],"about_ca_topic_score_codex":0.0003235243,"about_ca_topic_score_gemma":0.00020348692,"teacher_disagreement_score":0.21473365,"about_ca_system_score_codex":0.0000146094735,"about_ca_system_score_gemma":0.000052095842,"threshold_uncertainty_score":0.6432398},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933055,0.000049302154,0.047077402,0.00021693199,0.0049016625,0.0001416596,7.162664e-7,0.00018611949,0.014371203],"genre_scores_gemma":[0.99938947,0.0000037024574,0.00039644225,0.00006330703,0.000016809297,0.000009066694,7.546249e-7,0.000006895478,0.00011357855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883276,0.00019763301,0.0002708035,0.0002722082,0.00021695168,0.0002096419],"domain_scores_gemma":[0.9987375,0.00026992982,0.00015386973,0.00061969407,0.00014744703,0.00007153413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000397875,0.00010928069,0.00022683761,0.00011628436,0.00008316261,0.000055090703,0.0005718507,0.00007416506,0.000006908159],"category_scores_gemma":[0.00013037563,0.0001004561,0.00009419453,0.0005547564,0.000035459354,0.00023672744,0.00011737885,0.000121577534,0.000020154574],"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.0000039851157,0.000060331287,0.0036275128,0.000009016221,0.000013838789,0.0000011897683,0.00014823856,0.000027593587,0.0004268715,0.9910015,0.0019529265,0.0027270366],"study_design_scores_gemma":[0.0012815278,0.00052669214,0.043524947,0.000078550496,0.000008998924,0.000019752304,0.000027152984,0.06411414,0.0053955386,0.8737472,0.010906896,0.00036858695],"about_ca_topic_score_codex":0.00012421336,"about_ca_topic_score_gemma":0.000011466158,"teacher_disagreement_score":0.11725424,"about_ca_system_score_codex":0.000021443198,"about_ca_system_score_gemma":0.000022939981,"threshold_uncertainty_score":0.4096481},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023861521,0.0016550613,0.8006352,0.00018886734,0.0037396026,0.0002389523,0.0000036361814,0.00011181727,0.19340296],"genre_scores_gemma":[0.021117842,0.00020424892,0.0020423238,0.0008839896,0.0021854558,0.00008180444,0.00003052282,0.000057363417,0.9733964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730146,0.00044206728,0.00056591944,0.00078276644,0.00036990142,0.00053789804],"domain_scores_gemma":[0.9982491,0.00065220654,0.00024460146,0.00045983132,0.00008626307,0.00030796614],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00096335635,0.00032997294,0.0007858559,0.00022833676,0.00012790976,0.000112143636,0.00084684696,0.0016871649,0.00007101868],"category_scores_gemma":[0.00012593795,0.00023076043,0.00010700232,0.00007172342,0.0005267712,0.00017298938,0.0004560499,0.00057960337,0.000093510986],"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.00004112182,0.00009553262,0.000110996014,0.00020107187,0.00038281007,0.0011298485,0.0002860749,0.000067344736,0.000003195336,0.9221697,0.03906673,0.036445584],"study_design_scores_gemma":[0.0025466578,0.0012252666,0.000015789443,0.0010166747,0.00011344085,0.044392183,0.000042133077,0.66401184,0.000003338667,0.08457394,0.2004277,0.0016310448],"about_ca_topic_score_codex":0.000024959138,"about_ca_topic_score_gemma":0.0000020801167,"teacher_disagreement_score":0.83759576,"about_ca_system_score_codex":0.000108697255,"about_ca_system_score_gemma":0.00051857095,"threshold_uncertainty_score":0.9996089},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94247407,0.00016777599,0.030860264,0.00021585423,0.006802187,0.00025971173,0.000002596453,0.00013166701,0.019085888],"genre_scores_gemma":[0.9988321,0.000024597603,0.00088808313,0.00008236929,0.000019287214,0.0000050388744,0.0000017954164,0.0000055217147,0.00014118137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987851,0.00006407678,0.00046311333,0.00023936579,0.00023315384,0.000215197],"domain_scores_gemma":[0.9988213,0.00014735702,0.000248164,0.0005081888,0.0002116192,0.000063330495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022976572,0.00014057511,0.000306636,0.00016145832,0.00009048118,0.0000417497,0.00048034775,0.0000997045,0.000014494926],"category_scores_gemma":[0.000016308488,0.00012840393,0.0001162298,0.0005510916,0.00008506195,0.00022581709,0.00005933307,0.0001588944,0.00000768543],"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.000030392894,0.00009440999,0.00032859558,0.0000058059186,0.000023824512,0.0000023060816,0.00019911802,0.010824578,0.000091641916,0.98487484,0.0016159586,0.0019085448],"study_design_scores_gemma":[0.010447197,0.0051501077,0.009691245,0.00083701714,0.000070504524,0.0001577083,0.0005451926,0.47407398,0.016899245,0.47552285,0.0052073826,0.0013975872],"about_ca_topic_score_codex":0.000033001874,"about_ca_topic_score_gemma":0.0000024337378,"teacher_disagreement_score":0.50935197,"about_ca_system_score_codex":0.000024762905,"about_ca_system_score_gemma":0.000041567204,"threshold_uncertainty_score":0.523616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734458,0.00010557227,0.0036686887,0.00023959954,0.008959501,0.00027710502,0.0000016811122,0.00016731117,0.013134785],"genre_scores_gemma":[0.99961215,0.0000017423279,0.00015973752,0.0000356818,0.000018933979,0.000012969143,0.0000014131052,0.000008390487,0.00014898997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986317,0.00020127521,0.00026720072,0.0003483255,0.00032671448,0.00022476588],"domain_scores_gemma":[0.99857956,0.00015009473,0.00016289641,0.0006782314,0.0003108195,0.00011840504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048767333,0.0001293103,0.00023410517,0.00013293764,0.00006337913,0.000055686716,0.0005200656,0.000057344187,0.0000033864044],"category_scores_gemma":[0.00023462129,0.00011606266,0.00006890159,0.00062094536,0.000037811307,0.00026549297,0.00011145156,0.00016029034,0.000025739659],"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.000016751183,0.00013089144,0.0014072737,0.000006530799,0.000017697408,0.000004750581,0.00024325655,0.00013358505,0.00007748114,0.98324114,0.013984705,0.00073592184],"study_design_scores_gemma":[0.002256411,0.0013768828,0.0078113633,0.00010377142,0.0000104938,0.000024637362,0.000097655044,0.018092385,0.0052157687,0.96169674,0.0028906295,0.00042327543],"about_ca_topic_score_codex":0.000112157046,"about_ca_topic_score_gemma":0.0000075917897,"teacher_disagreement_score":0.026166385,"about_ca_system_score_codex":0.00006544028,"about_ca_system_score_gemma":0.000092545604,"threshold_uncertainty_score":0.47328982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912495,0.00014589763,0.00031321522,0.00041502688,0.0039330753,0.00018667629,1.5045634e-7,0.000081891434,0.0036745898],"genre_scores_gemma":[0.99898434,0.000003612177,0.00006130878,0.00018629563,0.00000882374,0.000026986749,1.4464047e-7,0.000005391104,0.000723073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.000052039584,0.00018455998,0.00016057926,0.0001663598,0.00014754513],"domain_scores_gemma":[0.99938095,0.000033400713,0.00007053464,0.00036686563,0.000105918276,0.000042327814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012827484,0.0000778619,0.00013273158,0.00005309938,0.000052094787,0.00007042737,0.00040416565,0.00004276979,0.000022858183],"category_scores_gemma":[0.000022768343,0.000058783124,0.000046103774,0.000121845,0.000024405479,0.0003696823,0.00007532671,0.0000751191,0.00022700086],"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.0000012215057,0.000041707,0.000064484135,0.000010029127,0.000008360748,7.836535e-7,0.0002534984,0.000027672253,0.0013419966,0.9890351,0.008504885,0.000710253],"study_design_scores_gemma":[0.00063118455,0.0004139471,0.0010763395,0.0001739766,0.0000028055651,0.00000824766,0.00006711781,0.027807416,0.029820831,0.9384351,0.0013031192,0.00025993458],"about_ca_topic_score_codex":0.00016642654,"about_ca_topic_score_gemma":0.000001116902,"teacher_disagreement_score":0.05060003,"about_ca_system_score_codex":0.000022795453,"about_ca_system_score_gemma":0.000018312423,"threshold_uncertainty_score":0.29177123},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593129,0.000054350992,0.02655964,0.00021905721,0.005256603,0.00011079878,6.7085784e-7,0.00013366417,0.008352302],"genre_scores_gemma":[0.99947697,0.0000035879393,0.0002869812,0.000097443684,0.000012614754,0.000009547893,6.1003595e-7,0.000006967166,0.000105249346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988997,0.00017897952,0.0002553487,0.00025868198,0.00019679812,0.0002104878],"domain_scores_gemma":[0.998893,0.00023325506,0.000104786785,0.0005569972,0.00013920822,0.00007274233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305837,0.0001065567,0.0002294218,0.000088649576,0.000082607316,0.00005511278,0.0004928458,0.00006583567,0.000014210777],"category_scores_gemma":[0.000090402624,0.000097639626,0.00009854641,0.0003697221,0.000043226308,0.00027578426,0.00011195345,0.00009892994,0.000040044233],"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.0000025268228,0.000051479525,0.005137073,0.000009746468,0.00001281161,7.951446e-7,0.00020585716,0.000027888684,0.000498555,0.9906936,0.0017958643,0.0015637836],"study_design_scores_gemma":[0.0009937185,0.00042559113,0.009399215,0.000060578273,0.000007766255,0.000018424187,0.0000341028,0.06272296,0.008934873,0.9025947,0.014487329,0.0003207664],"about_ca_topic_score_codex":0.00008440366,"about_ca_topic_score_gemma":0.000013895763,"teacher_disagreement_score":0.08809894,"about_ca_system_score_codex":0.00001717804,"about_ca_system_score_gemma":0.000018268694,"threshold_uncertainty_score":0.39816284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025693296,0.0007219699,0.858236,0.009316524,0.0023828852,0.00045161086,0.000017117181,0.00047929172,0.10270128],"genre_scores_gemma":[0.9435187,0.00017697139,0.03132886,0.00011005381,0.00015461868,0.00010086882,0.00006784555,0.000036441383,0.02450564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993385,0.0039325864,0.0006098976,0.0010939647,0.0005131842,0.00046537322],"domain_scores_gemma":[0.9918242,0.0005510809,0.0008133489,0.004807488,0.0017779983,0.00022589356],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0053703333,0.00038967485,0.00049871637,0.00017157644,0.0007551485,0.002064445,0.0041938294,0.00037849628,0.00006917683],"category_scores_gemma":[0.0007974916,0.00039018283,0.0003178968,0.00015404445,0.00020964218,0.00036359509,0.0029854334,0.00072759896,0.00013504953],"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.000018595423,0.00074767333,0.0073770783,0.0003377153,0.00031195502,0.0000365557,0.024081886,0.00078256795,0.0007767593,0.78400445,0.02099987,0.16052487],"study_design_scores_gemma":[0.0008739365,0.0000010370917,0.0026385987,0.003979707,0.000055478566,0.00006820009,0.00008759118,0.78175414,0.02687507,0.014526306,0.16777247,0.0013674408],"about_ca_topic_score_codex":0.0018817453,"about_ca_topic_score_gemma":0.0015211158,"teacher_disagreement_score":0.9178254,"about_ca_system_score_codex":0.00010375554,"about_ca_system_score_gemma":0.00030638272,"threshold_uncertainty_score":0.999855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3380758,0.0019805778,0.5894066,0.013066414,0.013793304,0.0022708045,0.000041822015,0.0012900671,0.040074598],"genre_scores_gemma":[0.9945044,0.000059991184,0.0031118188,0.00032090518,0.00025858262,0.00007260246,0.0000059126055,0.000012679965,0.001653141],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983317,0.000236786,0.000643362,0.0002825799,0.00013558698,0.00036993885],"domain_scores_gemma":[0.9970373,0.0005768458,0.00028554047,0.001908198,0.000112932124,0.00007917545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007393121,0.00014968296,0.00023585671,0.00012198187,0.000115780465,0.00012871032,0.0023150388,0.000109777575,0.000046809],"category_scores_gemma":[0.000058552963,0.00011403601,0.000060345817,0.00044866774,0.00009941221,0.00035345263,0.00057041796,0.00022369926,0.00034770338],"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.00014200197,0.0008254374,0.23185275,0.00011742914,0.0002519095,0.00012558815,0.005281887,0.0010962611,0.004187828,0.18066074,0.18762457,0.3878336],"study_design_scores_gemma":[0.0030989097,0.00024918042,0.0068988837,0.001729456,0.000026984124,0.00021431204,0.00010049136,0.45384607,0.00014208998,0.006549868,0.5262995,0.00084426993],"about_ca_topic_score_codex":0.00007947891,"about_ca_topic_score_gemma":0.0014814254,"teacher_disagreement_score":0.6564286,"about_ca_system_score_codex":0.000077711666,"about_ca_system_score_gemma":0.000059893722,"threshold_uncertainty_score":0.46502534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011151629,0.00016165001,0.9943238,0.000107294785,0.0018729705,0.0014551185,0.00047247426,0.00040570402,0.00008583996],"genre_scores_gemma":[0.9761347,0.0000069964162,0.022598712,0.000047156947,0.0001111992,0.00054412126,0.000024003424,0.000027127648,0.00050595414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973147,0.00023122766,0.00072202104,0.0008489364,0.0003117669,0.0005713453],"domain_scores_gemma":[0.9982372,0.00035827656,0.00027808262,0.000538857,0.0003615387,0.00022607426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006215557,0.00037209663,0.0005479417,0.00022764324,0.0006359143,0.00030520093,0.00037140687,0.00022617877,7.5604856e-7],"category_scores_gemma":[0.000012346361,0.0002673434,0.0002132005,0.0004123102,0.000067111665,0.00033785592,0.0000053908125,0.00017037116,0.000008056392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067435125,0.00019940994,0.000024764578,0.00015526343,0.000100805206,0.0000022665627,0.00027687533,0.9954167,0.00061483297,0.0021990794,0.00040958097,0.0005330062],"study_design_scores_gemma":[0.0026668091,0.00014666896,0.000019050702,0.00032345363,0.000020421789,0.000047334066,0.00046630637,0.99534786,0.000052762705,0.000012261761,0.00050998403,0.0003870702],"about_ca_topic_score_codex":0.00015127742,"about_ca_topic_score_gemma":0.000007572235,"teacher_disagreement_score":0.9750196,"about_ca_system_score_codex":0.00023807427,"about_ca_system_score_gemma":0.000093813695,"threshold_uncertainty_score":0.9999779},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009794376,0.07721262,0.14472897,0.0004948617,0.0037590263,0.0006042748,0.000010300481,0.0005392918,0.77167124],"genre_scores_gemma":[0.9492107,0.0086048,0.0003090937,0.000590085,0.0010909863,0.000022303979,0.000031347143,0.000077752906,0.040062897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985448,0.000028827559,0.00028917516,0.0004970931,0.0001825615,0.00045753142],"domain_scores_gemma":[0.99922556,0.00008166248,0.00018364238,0.00037012575,0.000070512426,0.00006850449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001614968,0.00034560985,0.000365758,0.000101979895,0.00008989353,0.00012431007,0.00031003173,0.00008907776,0.0000053072663],"category_scores_gemma":[0.000003884944,0.0003092189,0.00007929159,0.000083407285,0.0000659117,0.0007142125,0.000049045073,0.0005982833,0.000033111686],"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.00001598105,0.000026209435,0.00015321694,0.00003253334,0.00001603131,0.000012640375,0.0001470156,0.00025718953,0.000101445155,0.81258905,0.0003495238,0.18629919],"study_design_scores_gemma":[0.0008395933,0.00039979076,0.000093137875,0.0016206675,0.000033274126,0.0001285987,0.00004675331,0.06667478,0.002342847,0.31907323,0.6069568,0.0017905704],"about_ca_topic_score_codex":0.00001901189,"about_ca_topic_score_gemma":0.000029734632,"teacher_disagreement_score":0.9482313,"about_ca_system_score_codex":0.00010299634,"about_ca_system_score_gemma":0.000037239803,"threshold_uncertainty_score":0.999936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44710252,0.000015013663,0.551826,0.00009383882,0.00065596256,0.00014215453,4.0166404e-7,0.00004488645,0.00011920695],"genre_scores_gemma":[0.9928126,0.0000050364256,0.006967411,0.000020275414,0.00006288038,0.000015693427,1.07769466e-7,0.000009848067,0.00010617623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984637,0.000091568334,0.0003926997,0.00033961475,0.00047206864,0.0002403476],"domain_scores_gemma":[0.99908847,0.00009591697,0.00016601666,0.00032933912,0.00028516425,0.00003511931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009644927,0.00013459945,0.00017214053,0.00021969716,0.00016789055,0.00002572647,0.00028105095,0.000056854853,0.000008478423],"category_scores_gemma":[0.000010928439,0.000096627096,0.00004823304,0.00050242076,0.0000384292,0.00011224951,0.0000041351486,0.00015634291,0.0000037170234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011564627,0.00009613515,0.00030651948,0.000025756062,0.000011330062,7.606619e-7,0.0012093082,0.78823483,0.00020398587,0.00022475822,0.0000026996242,0.20967238],"study_design_scores_gemma":[0.0008607483,0.00011504417,0.0010034726,0.000691356,0.000008432303,0.0000086175305,0.000062529296,0.99215466,0.0048985253,0.000022626213,0.00003438279,0.00013961035],"about_ca_topic_score_codex":0.00002280873,"about_ca_topic_score_gemma":0.000050722854,"teacher_disagreement_score":0.54571,"about_ca_system_score_codex":0.00014510758,"about_ca_system_score_gemma":0.00008148974,"threshold_uncertainty_score":0.39403388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008257319,0.0000075714806,0.97966427,0.002480013,0.0015327304,0.000082057624,5.2226557e-7,0.00029479124,0.0076807453],"genre_scores_gemma":[0.9778487,0.0000038253547,0.0031370155,0.0006276584,0.0002844318,0.000012983443,2.0563924e-7,0.0000054792577,0.01807971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991709,0.00007216497,0.00015522246,0.00029099232,0.00010446165,0.00020627791],"domain_scores_gemma":[0.9994939,0.000088514236,0.000045292778,0.00024188941,0.00008017006,0.000050243387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016334158,0.00009246464,0.00010189072,0.00007257636,0.00011629793,0.00005962012,0.00027229602,0.00007803833,0.00018386604],"category_scores_gemma":[0.000013101788,0.00005320358,0.00005292044,0.00013811087,0.000020719752,0.00022855059,0.000051597206,0.000057730023,0.0005213099],"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.000037406953,0.0002735562,0.008744517,0.00001552557,0.000072544426,0.00001472301,0.0006473801,0.00034878854,0.011138941,0.67299485,0.10653816,0.19917358],"study_design_scores_gemma":[0.0036454378,0.001508271,0.014490127,0.00031209146,0.000010815977,0.00033708967,0.0002450545,0.7084563,0.058491692,0.005156917,0.2059815,0.0013647431],"about_ca_topic_score_codex":0.0000937349,"about_ca_topic_score_gemma":0.00013035921,"teacher_disagreement_score":0.9765272,"about_ca_system_score_codex":0.000057603866,"about_ca_system_score_gemma":0.000018069002,"threshold_uncertainty_score":0.6700558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019060853,0.00005116145,0.9947328,0.0006877883,0.00047850667,0.0013694256,0.000011107216,0.0005012641,0.0002618608],"genre_scores_gemma":[0.9890449,0.000116298004,0.008330832,0.00003753712,0.00007711017,0.0005444324,0.0000061366923,0.000029416471,0.0018133456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973986,0.0006350801,0.0007071198,0.00044432728,0.0003890259,0.00042580627],"domain_scores_gemma":[0.99656785,0.0013545282,0.0004644527,0.0011234728,0.00042086083,0.00006883694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013582837,0.00023702251,0.0003503705,0.00033506384,0.00035450663,0.000105901585,0.00082009373,0.00019883177,0.000029687175],"category_scores_gemma":[0.000060033122,0.00018729515,0.00017015752,0.0004979813,0.00003157092,0.0005565899,0.0000072218254,0.00015104492,0.000102878985],"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.0011181933,0.0018493088,0.000057788893,0.00068086607,0.0011190284,0.0000014841472,0.0025488012,0.16396794,0.13945541,0.40523815,0.019233607,0.26472944],"study_design_scores_gemma":[0.001872337,0.002927194,0.000078736426,0.0008390543,0.000044716664,0.000055762674,0.000063119485,0.9631309,0.023247663,0.0035112107,0.0037521191,0.0004772002],"about_ca_topic_score_codex":0.000081280945,"about_ca_topic_score_gemma":0.000015399888,"teacher_disagreement_score":0.9871388,"about_ca_system_score_codex":0.0006181493,"about_ca_system_score_gemma":0.00024125539,"threshold_uncertainty_score":0.7637675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025878453,0.00013419958,0.9906283,0.0026349588,0.0022186881,0.0003828551,0.000004951496,0.00023691432,0.0011712743],"genre_scores_gemma":[0.95560414,0.000012200597,0.03884055,0.00044184588,0.0004877005,0.00011399414,6.4010754e-7,0.0000116621495,0.0044872705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985533,0.000076480195,0.00033825147,0.00045002322,0.000121442936,0.00046049786],"domain_scores_gemma":[0.99884516,0.00042100847,0.00011327312,0.00041493765,0.00010222047,0.00010338456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059051363,0.0001468746,0.00025877616,0.0000636177,0.0002296116,0.00019335843,0.0003861635,0.00018577758,0.000022828046],"category_scores_gemma":[0.000051845254,0.00009207702,0.00008696085,0.00012108458,0.000026130536,0.00023871558,0.00014274791,0.000087601045,0.000033801116],"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.000006008019,0.000018768877,0.001316427,0.00003145035,0.000026883597,0.0000021602673,0.00085400237,0.000029446683,0.00004187161,0.9911933,0.004238965,0.002240703],"study_design_scores_gemma":[0.0020108132,0.0003586185,0.0010615058,0.00096449396,0.0000142600775,0.00022549326,0.0031617973,0.8048354,0.00009372998,0.045572564,0.14082439,0.00087694696],"about_ca_topic_score_codex":0.000041441082,"about_ca_topic_score_gemma":0.000034603643,"teacher_disagreement_score":0.9530163,"about_ca_system_score_codex":0.00003745065,"about_ca_system_score_gemma":0.00002052448,"threshold_uncertainty_score":0.3754792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01704684,0.000029023879,0.9582462,0.00029407835,0.0005644969,0.00031194376,0.0000062542113,0.00029332464,0.023207882],"genre_scores_gemma":[0.95318747,0.00001121469,0.045467492,0.000116745716,0.00010678145,0.00008057351,0.0000012517174,0.00002298898,0.0010054696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863696,0.00001557416,0.00037539235,0.00034807954,0.0002769325,0.0003470625],"domain_scores_gemma":[0.99867386,0.0002544698,0.00016408892,0.00074195355,0.000050282546,0.00011537545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002564135,0.00019605875,0.00025580838,0.000085714106,0.000116896255,0.00012811054,0.0006858633,0.00008411978,0.0000433931],"category_scores_gemma":[0.00003012535,0.000119574026,0.00010649911,0.00023288312,0.00005326046,0.00020337358,0.00015764998,0.00007122542,0.00042797954],"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.0000038564403,0.000044167315,0.000038272294,0.000038094666,0.00002690591,0.0000038959533,0.0007509717,0.000004616872,0.008605977,0.97852224,0.0033646394,0.008596342],"study_design_scores_gemma":[0.0053369193,0.00030243193,0.00019122568,0.000739548,0.000065256005,0.00019269557,0.0014721596,0.15614396,0.041974872,0.5958465,0.19513428,0.002600168],"about_ca_topic_score_codex":0.0000033721258,"about_ca_topic_score_gemma":0.000003384607,"teacher_disagreement_score":0.93614066,"about_ca_system_score_codex":0.000036586138,"about_ca_system_score_gemma":0.000018402521,"threshold_uncertainty_score":0.5500954},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003649476,0.00056958024,0.10506693,0.00037797765,0.0010943131,0.00016935816,0.0000031222082,0.00016071252,0.8925215],"genre_scores_gemma":[0.05863431,0.00013810374,0.0025940838,0.0018015939,0.0006947552,0.000009335566,0.000003884092,0.00003565839,0.93608826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984676,0.000019255609,0.00035171967,0.00060683215,0.00027616267,0.0002784141],"domain_scores_gemma":[0.9990619,0.000084251726,0.000079312355,0.00053900806,0.00006619371,0.00016932368],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002283271,0.0002953402,0.00034239094,0.00018430442,0.00015601369,0.00046771,0.0004616836,0.00026156477,0.0015457149],"category_scores_gemma":[0.0000028781392,0.00025030458,0.00011165572,0.000041085492,0.000035482648,0.00020189639,0.00020790374,0.0002621133,0.00047842838],"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.0000037513107,0.0000035716496,0.0000030117276,0.000009427232,0.000042756274,0.00003374008,0.00020995946,0.00003230291,0.000005645539,0.9188594,0.012824036,0.06797237],"study_design_scores_gemma":[0.00009243788,0.000088307344,0.000007001834,0.00012346203,0.00000833975,0.00020682569,0.0000037736786,0.0050342926,0.00000787398,0.011966878,0.9820977,0.00036312907],"about_ca_topic_score_codex":0.00011132558,"about_ca_topic_score_gemma":0.00020004973,"teacher_disagreement_score":0.9692736,"about_ca_system_score_codex":0.00006471626,"about_ca_system_score_gemma":0.000040467214,"threshold_uncertainty_score":0.99999493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0156055,0.00052953576,0.98085946,0.0004426576,0.00045823422,0.00042801356,0.00000393096,0.00011115274,0.0015615333],"genre_scores_gemma":[0.9405346,0.000067494395,0.05836208,0.00012846598,0.00011978187,0.000100865254,0.000016752514,0.000006376545,0.00066360686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989107,0.00006608134,0.00027419414,0.0003728087,0.00015668737,0.00021949406],"domain_scores_gemma":[0.99918437,0.00012448066,0.00011481262,0.00012803052,0.000370104,0.00007817762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014562471,0.000126692,0.00013785737,0.00008847443,0.00027878382,0.00012492228,0.00016692032,0.00006472055,0.000015557007],"category_scores_gemma":[0.0000134562915,0.00012690324,0.00004031806,0.0002086509,0.000044493347,0.00030550768,0.000050481955,0.000058534977,0.000020915975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084158026,0.00013638954,0.0024257926,0.00008277876,0.00008162515,0.000016186887,0.0025095744,0.631176,0.00023775884,0.1613021,0.013216177,0.18873145],"study_design_scores_gemma":[0.00038119507,0.00020285576,0.00883244,0.000033934215,0.0000054352304,0.00017631546,0.00008888246,0.93681955,0.000007026662,0.049213666,0.0040816385,0.00015707876],"about_ca_topic_score_codex":0.000039676885,"about_ca_topic_score_gemma":0.000015239868,"teacher_disagreement_score":0.9249291,"about_ca_system_score_codex":0.000040944,"about_ca_system_score_gemma":0.000091833004,"threshold_uncertainty_score":0.5174964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2826627,0.0000015929655,0.7143486,0.00020486192,0.0014678095,0.00042187216,0.000051097908,0.000053102824,0.00078832445],"genre_scores_gemma":[0.99890786,0.000002713076,0.0007810162,0.00013530042,0.00010183889,0.000034412053,0.000009264791,0.000011738274,0.000015869602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815,0.00054020114,0.00039229664,0.00035546775,0.00034605953,0.00021597983],"domain_scores_gemma":[0.99743164,0.0015406115,0.00024522687,0.0006649893,0.00005252894,0.000064999964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073983154,0.00018480452,0.00027085602,0.00019598704,0.0002624341,0.00008219853,0.00066635665,0.00004479653,0.000036116762],"category_scores_gemma":[0.000014752553,0.00012830281,0.00016276707,0.00025400784,0.00007435224,0.00012738185,0.000017148137,0.0003364105,0.000007828846],"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.00092091295,0.00068946404,0.0001985913,0.00016681572,0.0005756599,0.000014483881,0.019454231,0.0959763,0.04535338,0.098078094,0.0021781127,0.7363939],"study_design_scores_gemma":[0.0053656693,0.011869179,0.002138232,0.0011397888,0.00012413625,0.00006391861,0.00064112636,0.77144665,0.20045966,0.001543613,0.00436827,0.0008397548],"about_ca_topic_score_codex":0.00015041343,"about_ca_topic_score_gemma":0.00009971284,"teacher_disagreement_score":0.7355542,"about_ca_system_score_codex":0.000020929174,"about_ca_system_score_gemma":0.000028666074,"threshold_uncertainty_score":0.5232037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025084384,0.000010737315,0.96861905,0.00316774,0.00084594823,0.00017550425,0.0000015389645,0.00016824984,0.0019268567],"genre_scores_gemma":[0.9927565,8.32533e-7,0.0019401141,0.004311456,0.00023524788,0.000022959857,0.000002030786,0.000010554107,0.00072029233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988039,0.000118632546,0.00020361194,0.00039471858,0.00019902342,0.00028010216],"domain_scores_gemma":[0.999235,0.00019998116,0.0000734434,0.0003612617,0.00004165974,0.00008866946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029124945,0.00016375455,0.00014753648,0.00009727263,0.00012788324,0.0001379685,0.00024567242,0.00010291339,0.000027226557],"category_scores_gemma":[0.000012277352,0.00009714101,0.00005995362,0.00016700244,0.000031102816,0.00015217846,0.000034807614,0.00011774774,0.000027275632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005061287,0.00030813992,0.0041869404,0.000052978852,0.0001062771,0.00004337662,0.00069446076,0.5027864,0.002131569,0.2932962,0.010265358,0.18562222],"study_design_scores_gemma":[0.00075963605,0.0003804463,0.003188172,0.00012530353,0.0000020447494,0.0000070068386,0.0000043701543,0.99221957,0.000223611,0.0016816333,0.0012043898,0.0002038327],"about_ca_topic_score_codex":0.000016284346,"about_ca_topic_score_gemma":0.00018148638,"teacher_disagreement_score":0.9676721,"about_ca_system_score_codex":0.00004060696,"about_ca_system_score_gemma":0.00004220928,"threshold_uncertainty_score":0.39612955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008160283,0.000018579749,0.98431736,0.0030288454,0.001994762,0.0002160982,0.0000015482673,0.00020807407,0.009398728],"genre_scores_gemma":[0.9838078,0.0000015855716,0.0043819183,0.0024778633,0.000598343,0.00006547476,6.3715004e-7,0.000010184428,0.008656174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903405,0.000041772353,0.00019621699,0.0003110709,0.00012223457,0.00029466065],"domain_scores_gemma":[0.9989699,0.0003676989,0.000056921752,0.00044327968,0.000082827144,0.00007936107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031908377,0.00011115748,0.00012922712,0.000055874385,0.00011093502,0.000095138144,0.0004419983,0.00006689305,0.00005803359],"category_scores_gemma":[0.000027078428,0.000062557556,0.00011077317,0.00012260913,0.000016839607,0.00014935207,0.000035018144,0.00003953046,0.00011351288],"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.000049846876,0.00007060565,0.00026499762,0.000011216465,0.000027733186,0.000004551791,0.000050380193,0.008252537,0.00021249034,0.65223914,0.19018197,0.14863454],"study_design_scores_gemma":[0.001042004,0.00035243976,0.00014124531,0.000085486376,0.0000025973961,0.0000060940456,0.0000057904617,0.81782544,0.00196228,0.0021213924,0.17619045,0.00026475036],"about_ca_topic_score_codex":0.000014835145,"about_ca_topic_score_gemma":0.000026602953,"teacher_disagreement_score":0.9829918,"about_ca_system_score_codex":0.00003712924,"about_ca_system_score_gemma":0.000027398473,"threshold_uncertainty_score":0.2551023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015424526,0.000021332959,0.98245823,0.0004682579,0.00097093784,0.00025854292,0.000013366782,0.00024620557,0.0001385722],"genre_scores_gemma":[0.9975758,0.000007735816,0.0017222291,0.00022797704,0.000029272403,0.00008113353,2.3709487e-7,0.0000099285135,0.00034563913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827975,0.00023660567,0.0006106088,0.00032422034,0.00026639088,0.00028245166],"domain_scores_gemma":[0.99798036,0.00087555713,0.00022849915,0.0007136707,0.00010509729,0.000096810036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045065157,0.00017502053,0.00054321415,0.00045988424,0.00010300259,0.00005931922,0.00043610242,0.00010230672,0.00020162776],"category_scores_gemma":[0.000010745973,0.00011751027,0.0004517608,0.0009926697,0.000046051282,0.00020743757,0.0000014830018,0.0000746027,0.000034412853],"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.00006398311,0.0003373365,0.00009383785,0.000021998565,0.003764028,0.000010873327,0.0003942042,0.42504707,0.003202215,0.0039899074,0.00025350534,0.56282103],"study_design_scores_gemma":[0.0009846257,0.00014078959,0.0004024668,0.00006231111,0.00032255176,0.00000632215,0.000009676845,0.9972236,0.0005122491,0.000095690215,0.000090168214,0.00014952484],"about_ca_topic_score_codex":0.000040303647,"about_ca_topic_score_gemma":0.000073596064,"teacher_disagreement_score":0.9821513,"about_ca_system_score_codex":0.00006391817,"about_ca_system_score_gemma":0.0000283624,"threshold_uncertainty_score":0.479193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015680237,0.000009472085,0.99536395,0.0013148066,0.0018421297,0.00086871505,0.0000051289267,0.0002468382,0.0001921483],"genre_scores_gemma":[0.96468157,0.000027916924,0.032142572,0.0019470644,0.0002436173,0.0005428847,6.1361396e-7,0.000024242736,0.0003895004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986811,0.00013787931,0.0002430268,0.00051016215,0.00015097446,0.00027681308],"domain_scores_gemma":[0.99796194,0.0012879401,0.000075361255,0.00048929226,0.000065249835,0.00012023665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031314165,0.00019635734,0.0001840181,0.00016510725,0.0003108248,0.00014627699,0.00035549345,0.000085698266,0.0000051538573],"category_scores_gemma":[0.000001600505,0.0001445581,0.0001116371,0.00019966655,0.000040953386,0.00019019241,0.0000024970584,0.00012707684,0.000041870448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007818548,0.00013628397,4.935566e-7,0.000006517363,0.000052926283,0.0000013122685,0.00015641384,0.71950316,0.0001245732,0.020941932,0.0035411662,0.255457],"study_design_scores_gemma":[0.001094749,0.00089009904,0.0000103385455,0.00015872158,0.000011303652,0.000023386616,0.000009814618,0.98746514,0.0019477608,0.0010970543,0.0069895755,0.00030204342],"about_ca_topic_score_codex":0.0000031852503,"about_ca_topic_score_gemma":0.000003841432,"teacher_disagreement_score":0.9645248,"about_ca_system_score_codex":0.000062335464,"about_ca_system_score_gemma":0.000025923247,"threshold_uncertainty_score":0.58949083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013763213,0.00003308187,0.97638994,0.00045150414,0.00034547885,0.000436633,0.0000072039684,0.00018041233,0.008392542],"genre_scores_gemma":[0.911438,0.000004058163,0.08743119,0.00010712639,0.00015641548,0.00018347573,0.0000014233551,0.00002016284,0.0006581424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988449,0.000010345739,0.00034151293,0.00029402343,0.00020975227,0.00029944172],"domain_scores_gemma":[0.9988914,0.00031462454,0.00014577116,0.00050959445,0.00006262857,0.00007599034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026819462,0.00015687266,0.00022480467,0.00005983035,0.00012620326,0.00011685238,0.00051443477,0.00006237877,0.000020378122],"category_scores_gemma":[0.000020558693,0.00009074739,0.00009838128,0.00013942733,0.000036886828,0.000061613806,0.00010250038,0.000035344216,0.00010938698],"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.000009863758,0.000065109714,0.0000024941335,0.00006131113,0.000032714033,8.091232e-7,0.0011791607,0.000117028634,0.008522505,0.97026235,0.0018746001,0.01787207],"study_design_scores_gemma":[0.0015919451,0.00014200235,0.000023887196,0.0002569694,0.0000341568,0.000012768599,0.00045101694,0.88316464,0.013984837,0.08218071,0.01757122,0.0005858602],"about_ca_topic_score_codex":0.0000013429952,"about_ca_topic_score_gemma":0.0000029434511,"teacher_disagreement_score":0.8976748,"about_ca_system_score_codex":0.000034065895,"about_ca_system_score_gemma":0.000016892358,"threshold_uncertainty_score":0.3700571},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2800506,0.00031316385,0.7169341,0.00021317435,0.00026178078,0.0000713353,1.5020012e-7,0.00011613881,0.0020395454],"genre_scores_gemma":[0.9463285,0.000012886464,0.053039107,0.00037699786,0.000116682146,0.0000027191452,1.6056934e-7,0.0000055109545,0.000117430645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991709,0.000054204633,0.00019083796,0.00025347425,0.00012745832,0.0002030967],"domain_scores_gemma":[0.99961305,0.000048926482,0.000036202913,0.00019299876,0.000043192947,0.000065627304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026033472,0.00010033,0.00013812212,0.00007831304,0.00017103612,0.00022484885,0.00019473741,0.00004369223,0.0000151649765],"category_scores_gemma":[0.0000055432156,0.00007783965,0.00004428887,0.00014248451,0.00002115065,0.0004109084,0.000066490255,0.0000644756,0.000011703704],"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.000016591142,0.00017749198,0.009096813,0.00008231263,0.00021351477,0.00009604192,0.012259762,0.036131557,0.12526953,0.52967215,0.004199026,0.28278524],"study_design_scores_gemma":[0.00014582844,0.000023016917,0.00027978257,0.000038006852,0.000004078011,0.00029243523,0.00019722279,0.9937046,0.0026736527,0.0006574833,0.0018220699,0.00016179113],"about_ca_topic_score_codex":0.00009802567,"about_ca_topic_score_gemma":0.00003442456,"teacher_disagreement_score":0.95757306,"about_ca_system_score_codex":0.000021330168,"about_ca_system_score_gemma":0.000014484792,"threshold_uncertainty_score":0.31742087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7950111,0.0009964254,0.18805344,0.0014628062,0.0011899066,0.00034054837,0.000010237169,0.00012668932,0.012808823],"genre_scores_gemma":[0.9991391,0.000012174925,0.00007764324,0.0002760077,0.00004111417,0.000015250244,0.000006576066,0.0000031578727,0.0004290002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.00017749518,0.00021450219,0.00015251119,0.00012450629,0.00016673781],"domain_scores_gemma":[0.99904597,0.0005105246,0.000073521245,0.00024834785,0.0000625284,0.00005908293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054920674,0.00008125758,0.00010728008,0.000023654824,0.00010984357,0.00003927463,0.00017957775,0.000065967964,0.00024537582],"category_scores_gemma":[0.000036953228,0.000048212132,0.00004191043,0.00019840995,0.00007953698,0.00017690977,0.000049927672,0.00010852318,0.000011562389],"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.0000042250517,0.000093607276,0.00788361,0.0000021777614,0.000038269965,3.2084702e-7,0.0001804799,0.0017036659,0.00012118514,0.8876526,0.10177107,0.00054879504],"study_design_scores_gemma":[0.00071841665,0.00030801794,0.057289496,0.000051928324,0.000016103313,0.00006339565,0.00015741741,0.8928091,0.0028005193,0.03922672,0.006103232,0.00045566857],"about_ca_topic_score_codex":0.00006492881,"about_ca_topic_score_gemma":0.00001859617,"teacher_disagreement_score":0.8911054,"about_ca_system_score_codex":0.000010861533,"about_ca_system_score_gemma":0.0000062991976,"threshold_uncertainty_score":0.2686693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009213445,0.00013394524,0.9891675,0.00020784228,0.00041605008,0.00023842706,4.5838e-7,0.00008776334,0.0005345641],"genre_scores_gemma":[0.68170923,0.0000066128846,0.31710958,0.00082640065,0.00025709425,0.0000059531612,0.0000010420817,0.0000052752152,0.00007882454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921966,0.000034924455,0.0001756284,0.00027546185,0.00008897686,0.00020538043],"domain_scores_gemma":[0.9995542,0.000079773454,0.00005419047,0.00019779928,0.00005213864,0.00006189201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001323509,0.00011079458,0.00011870267,0.00007381987,0.00015871058,0.00018577385,0.00016995585,0.000057185778,0.000006670124],"category_scores_gemma":[0.000009531876,0.00008729916,0.000043773514,0.00013117121,0.000011710824,0.00006447536,0.00002362156,0.00005753921,4.887523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005403547,0.000009788944,0.000022025055,0.0000016148721,0.0000052266873,0.0000013957017,0.000067745554,0.95758283,0.000008310728,0.003066448,0.00024732001,0.038981907],"study_design_scores_gemma":[0.00019479932,0.0002012517,0.0001915328,0.000019993791,0.0000033974106,0.00006616882,0.000006166985,0.99788857,0.000032680302,0.0010999249,0.00017660689,0.000118936034],"about_ca_topic_score_codex":0.000011159583,"about_ca_topic_score_gemma":0.0000039501683,"teacher_disagreement_score":0.6724958,"about_ca_system_score_codex":0.000016673703,"about_ca_system_score_gemma":0.0000103137045,"threshold_uncertainty_score":0.35599563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04500092,0.000006233123,0.9328467,0.0004175969,0.00057848624,0.00021975343,7.126628e-7,0.000068089634,0.020861482],"genre_scores_gemma":[0.99643004,2.767902e-7,0.0014580351,0.0017236522,0.00024412997,0.000007185481,0.0000015939661,0.0000049709165,0.00013009601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898255,0.000102785154,0.00026145732,0.00019092755,0.00022072846,0.000241579],"domain_scores_gemma":[0.9991284,0.0002659327,0.00009911714,0.00039552295,0.00006251752,0.000048487418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011791768,0.00008199603,0.00009784105,0.00004917786,0.00013788817,0.00008497623,0.0003657114,0.00003147107,0.00019670307],"category_scores_gemma":[0.0000052976843,0.000052767547,0.00004738508,0.00026167175,0.00001827943,0.00015123449,0.000026588343,0.000074630225,0.000014166618],"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.000045958997,0.000110764515,0.0045405836,0.0000074174573,0.000028340657,0.0000052965606,0.0015686484,0.25009996,0.00051953626,0.67381465,0.017874131,0.05138467],"study_design_scores_gemma":[0.00054049445,0.0006346946,0.005165403,0.000049204173,0.000003067569,0.0000026188297,0.0007258444,0.9647522,0.024820551,0.00056599226,0.002581485,0.00015846214],"about_ca_topic_score_codex":0.00025926487,"about_ca_topic_score_gemma":0.000229725,"teacher_disagreement_score":0.9514291,"about_ca_system_score_codex":0.000030854335,"about_ca_system_score_gemma":0.000021568061,"threshold_uncertainty_score":0.21537606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26446924,0.000031233012,0.70923615,0.00024202756,0.0022167023,0.00017238122,0.0000013941763,0.00008677071,0.023544097],"genre_scores_gemma":[0.9952275,0.000013433541,0.0034107943,0.00007489644,0.00016688963,0.000018623656,5.3183834e-7,0.0000033520218,0.001083989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946797,0.000018849265,0.00017869579,0.00014097354,0.000086830696,0.000106679],"domain_scores_gemma":[0.99952286,0.00010896836,0.00007117033,0.00016392536,0.00010751725,0.000025529067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015318036,0.00005623183,0.00009988137,0.000064286534,0.000037944592,0.000024118914,0.0002562264,0.00002785001,0.00008358096],"category_scores_gemma":[0.000021565595,0.000044672248,0.000050282568,0.00010789754,0.000012723081,0.0002757841,0.000034538094,0.000035034504,0.000025450434],"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.00005688744,0.00027303118,0.0037638096,0.00016990543,0.00014725662,0.0000025141028,0.014736697,0.0032897813,0.0025825503,0.6181239,0.037758335,0.31909534],"study_design_scores_gemma":[0.00021380823,0.00018542352,0.00013219986,0.000023471393,0.0000013702543,0.0000091255,0.000058696794,0.9902182,0.005643537,0.00034837663,0.0031007496,0.000064997286],"about_ca_topic_score_codex":0.000027113161,"about_ca_topic_score_gemma":0.000028176833,"teacher_disagreement_score":0.98692846,"about_ca_system_score_codex":0.000017736133,"about_ca_system_score_gemma":0.000002450244,"threshold_uncertainty_score":0.18216814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1928685,0.000010432731,0.7735408,0.000040908097,0.0005372883,0.000037435522,1.3137982e-7,0.00005135923,0.03291315],"genre_scores_gemma":[0.99711233,0.000005308801,0.0016067817,0.00034439936,0.00008658874,0.0000012324763,9.068219e-7,0.000002778091,0.00083966914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991255,0.000022215954,0.00028600768,0.00019070512,0.00016996168,0.00020565727],"domain_scores_gemma":[0.99929583,0.00010890183,0.00009056078,0.00039022317,0.00006157815,0.000052906464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006748294,0.00007618339,0.00018577189,0.0002935258,0.000051926734,0.000034451703,0.00037581866,0.00004307015,0.000035197256],"category_scores_gemma":[0.0000045084867,0.000058704078,0.0001343386,0.0013203196,0.00001563736,0.00015143567,0.000046677575,0.000065427135,0.000012936326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004032283,0.000096990596,0.08824308,0.000011551677,0.0008596835,0.000008185538,0.0007963613,0.68575394,0.00007324033,0.15224124,0.0034895923,0.0683858],"study_design_scores_gemma":[0.00006731033,0.00007381182,0.04023329,0.000008448635,0.000022299088,0.0000016675988,0.0000234984,0.95862967,0.00020298843,0.000008180137,0.00065376563,0.000075050135],"about_ca_topic_score_codex":0.000042338343,"about_ca_topic_score_gemma":0.00007021795,"teacher_disagreement_score":0.80424386,"about_ca_system_score_codex":0.00002173003,"about_ca_system_score_gemma":0.0000061054234,"threshold_uncertainty_score":0.23938827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1280616,0.0001329356,0.8701332,0.00023531396,0.0005726033,0.00030009053,6.151297e-7,0.000075086944,0.00048855966],"genre_scores_gemma":[0.95949274,0.0000066515468,0.039782666,0.00010197782,0.00025562258,0.000057946505,6.595744e-7,0.000010457561,0.00029128755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989074,0.00015101366,0.00021621663,0.00019459653,0.00021455708,0.00031622578],"domain_scores_gemma":[0.999347,0.00005033551,0.00014446706,0.00028966143,0.00007408031,0.000094495954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045871965,0.00012749166,0.00016524472,0.00008490716,0.00014988298,0.0000506257,0.00023574401,0.00009501621,0.000012224238],"category_scores_gemma":[0.000011636538,0.00009816774,0.00004861578,0.00019720077,0.00006573542,0.00032392197,0.000029462566,0.0001368661,0.000016199208],"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.0014451644,0.002048822,0.022151887,0.00087329425,0.0011584685,0.000088662426,0.11619609,0.047707133,0.17887634,0.40758103,0.018204642,0.20366848],"study_design_scores_gemma":[0.0063997814,0.0050116996,0.018091701,0.00086542213,0.00017290565,0.002148463,0.0054668807,0.78353584,0.12548698,0.0049710623,0.044421665,0.0034275951],"about_ca_topic_score_codex":0.00009229568,"about_ca_topic_score_gemma":0.000008613008,"teacher_disagreement_score":0.83143115,"about_ca_system_score_codex":0.0001046721,"about_ca_system_score_gemma":0.00002638195,"threshold_uncertainty_score":0.4003164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29997474,0.0000019235108,0.6952348,0.00027008224,0.00029500824,0.000104015846,4.8396555e-7,0.00012900139,0.003989955],"genre_scores_gemma":[0.996015,6.6276186e-7,0.0028338807,0.00026331743,0.00019156157,0.000013587497,4.665923e-7,0.000008715886,0.0006727702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990364,0.000023916928,0.00014116938,0.000300646,0.0002922954,0.00020557671],"domain_scores_gemma":[0.99939287,0.00007710773,0.000059715112,0.00029385142,0.00010600039,0.00007044034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013822506,0.00011895056,0.00012866472,0.00006145656,0.000093866816,0.000101527265,0.00023802144,0.00003994633,0.000018080354],"category_scores_gemma":[0.00001794946,0.00005832161,0.00004478929,0.00018585652,0.000022046717,0.00019548267,0.000059705813,0.000053439533,0.00014696411],"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.00007361585,0.00025530474,0.00021948233,0.000010706049,0.00003671427,0.000011408873,0.0018560814,0.05273113,0.00365479,0.8924055,0.0004011613,0.048344065],"study_design_scores_gemma":[0.0006451925,0.00031234496,0.00029263058,0.00014196581,0.0000025838465,0.000011155824,0.000053611788,0.99081475,0.006675251,0.00020061027,0.0006898743,0.00016004503],"about_ca_topic_score_codex":0.000016985698,"about_ca_topic_score_gemma":0.000011685876,"teacher_disagreement_score":0.9380836,"about_ca_system_score_codex":0.00006164137,"about_ca_system_score_gemma":0.000029128667,"threshold_uncertainty_score":0.23782861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016890692,0.00011536897,0.97741836,0.0014758616,0.00090706773,0.0013365363,0.000007405847,0.0001796231,0.0016691019],"genre_scores_gemma":[0.99832934,0.000012526632,0.00029385427,0.00042099835,0.00015900539,0.0001694407,0.0000037353293,0.000043536696,0.00056758436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963528,0.0010008249,0.0007247679,0.0008178976,0.00055204,0.000551707],"domain_scores_gemma":[0.9968839,0.0012124395,0.00039940927,0.00088416104,0.00044179417,0.00017825208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013731769,0.0004870385,0.00058107486,0.00028722992,0.00027017936,0.00039311236,0.000735291,0.00030222727,0.0000063270645],"category_scores_gemma":[0.000058000078,0.00020139418,0.0001220446,0.0006702012,0.00017635892,0.00019008649,0.000043135748,0.0005369243,0.000013441306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026296114,0.00094412087,0.00055841246,0.0006253158,0.0007092827,0.00022880822,0.0050789835,0.63774997,0.069093905,0.17695622,0.010827182,0.09459816],"study_design_scores_gemma":[0.0028373639,0.0060834433,0.0000991571,0.009262549,0.00004765613,0.00026568532,0.00046112065,0.971415,0.00651649,0.00014522864,0.0020043785,0.0008619338],"about_ca_topic_score_codex":0.000076507815,"about_ca_topic_score_gemma":0.000011236782,"teacher_disagreement_score":0.98143864,"about_ca_system_score_codex":0.00013140675,"about_ca_system_score_gemma":0.0001644042,"threshold_uncertainty_score":0.82126164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014308656,0.0000096079675,0.99676394,0.00041947095,0.00031123136,0.00022496462,3.618049e-7,0.00007288129,0.0007666648],"genre_scores_gemma":[0.9666402,0.000002041851,0.03244272,0.0001754136,0.000078497804,0.0000122794745,2.7322525e-7,0.0000037861842,0.00064483634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995732,0.000031298863,0.00009691665,0.00015842046,0.000057892295,0.000082320876],"domain_scores_gemma":[0.9995568,0.00013482413,0.000035034227,0.00009634642,0.00015113507,0.000025895117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019721696,0.00004585826,0.00005027415,0.000029595094,0.00007679854,0.00006323552,0.00007977131,0.000028328453,0.000010083247],"category_scores_gemma":[0.00003440463,0.000027298545,0.000010464288,0.00010716771,0.000008490408,0.00013782653,0.00002011543,0.000010486441,0.000013324737],"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.000012475827,0.000024728393,0.00005549288,0.0000041611866,0.000011312715,4.6293016e-7,0.0004960586,0.0016719486,0.0069628973,0.9717228,0.00404058,0.014997121],"study_design_scores_gemma":[0.00045417107,0.00023950578,0.00016822112,0.00002415522,0.0000028522948,0.000016303471,0.000034286455,0.9770278,0.01838982,0.0026156348,0.0009026465,0.00012465786],"about_ca_topic_score_codex":0.000002739078,"about_ca_topic_score_gemma":0.0000024235765,"teacher_disagreement_score":0.9753558,"about_ca_system_score_codex":0.00002157917,"about_ca_system_score_gemma":0.000017372438,"threshold_uncertainty_score":0.11132024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23277532,0.0007348676,0.7653613,0.00024210391,0.00023798982,0.00021843519,5.1329926e-7,0.00006829756,0.0003611954],"genre_scores_gemma":[0.9966232,0.00033784247,0.0028091224,0.00011951577,0.00003625928,0.00004124279,0.0000014390241,0.00000520176,0.000026157399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882305,0.00014822818,0.0002481687,0.00044783147,0.00012820154,0.0002045042],"domain_scores_gemma":[0.9991975,0.0003154252,0.00020423112,0.00010395157,0.0001051352,0.00007374576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023171821,0.00014719566,0.00014937611,0.00007744114,0.00020971808,0.0002866951,0.00011362221,0.000053256965,0.0000010608984],"category_scores_gemma":[0.000019688685,0.00010477084,0.000009201009,0.00022073228,0.000080380734,0.0018137277,0.00012403553,0.000099617515,8.855614e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043059862,0.00018765956,0.04365064,0.00019923081,0.00012618118,0.00012344346,0.044110186,0.004899519,0.00017936433,0.22920874,0.000077156976,0.6768073],"study_design_scores_gemma":[0.0013999442,0.00027013174,0.015806941,0.00071409816,0.000017950008,0.00015654314,0.005230175,0.975334,0.000017750048,0.00029956986,0.0004602733,0.00029260834],"about_ca_topic_score_codex":0.0000904024,"about_ca_topic_score_gemma":0.00003562113,"teacher_disagreement_score":0.9704345,"about_ca_system_score_codex":0.000019543495,"about_ca_system_score_gemma":0.000011863554,"threshold_uncertainty_score":0.42724308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022974107,0.000011486176,0.9643115,0.0011222274,0.00058787013,0.00018820255,6.8165286e-7,0.0001341175,0.03341418],"genre_scores_gemma":[0.8051891,0.0000017950593,0.17280345,0.00078051805,0.00030145064,0.00008419687,5.200905e-7,0.000007358627,0.020831615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932826,0.000023508097,0.00014439624,0.00023325416,0.00007893323,0.00019164916],"domain_scores_gemma":[0.9995388,0.00007423321,0.000036872087,0.00025756937,0.000049200076,0.000043375163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026558543,0.000064819535,0.00008731362,0.000049685023,0.000068194284,0.00008139208,0.00033824134,0.000036044574,0.0000125136185],"category_scores_gemma":[0.000010954669,0.000036430592,0.00006753464,0.00009335152,0.000010744919,0.0002379539,0.00007093785,0.000019551657,0.000023499786],"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.000014154479,0.00006032036,0.00027851196,0.000055884004,0.000051996114,0.0000018269108,0.0008357462,0.00023102507,0.002062436,0.6513697,0.1570919,0.18794648],"study_design_scores_gemma":[0.00080982543,0.00008096666,0.00007990143,0.000043436823,0.0000017605872,0.00004036354,0.00016241714,0.83053964,0.00043805162,0.0020009906,0.16555312,0.00024952553],"about_ca_topic_score_codex":0.000008240702,"about_ca_topic_score_gemma":0.0000021884548,"teacher_disagreement_score":0.8303086,"about_ca_system_score_codex":0.000027023782,"about_ca_system_score_gemma":0.000011002703,"threshold_uncertainty_score":0.14855964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92723465,0.0000308294,0.067624435,0.000908112,0.0015139811,0.00016518928,0.0000015972283,0.00013247207,0.0023887341],"genre_scores_gemma":[0.9979362,0.000007876343,0.0007669942,0.00013182174,0.000036693593,0.000021170683,4.424018e-7,0.00001818181,0.0010806387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864423,0.00013841513,0.00016698414,0.00046022958,0.00025337623,0.00033678583],"domain_scores_gemma":[0.9990624,0.00016752389,0.00011049178,0.00043598583,0.000111956724,0.000111598834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031164257,0.00019708987,0.00024653628,0.000055740355,0.00018397269,0.00022151093,0.00034179154,0.00009429367,0.000029334598],"category_scores_gemma":[0.000015208526,0.00012469859,0.000043165193,0.00016302348,0.000060822822,0.0006935398,0.00019215333,0.00012493474,0.000029776129],"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.00005607257,0.00010945436,0.27259278,0.000016704595,0.00011130416,0.00006226234,0.0019260345,0.000046818826,0.00033351025,0.7101062,0.0025020652,0.012136803],"study_design_scores_gemma":[0.005508562,0.0004469337,0.13111559,0.00037977073,0.000023106097,0.00052773836,0.00037509677,0.013942548,0.0012727543,0.8384853,0.0067745443,0.0011480597],"about_ca_topic_score_codex":0.00041399288,"about_ca_topic_score_gemma":0.00035507753,"teacher_disagreement_score":0.1414772,"about_ca_system_score_codex":0.000064145366,"about_ca_system_score_gemma":0.000038814003,"threshold_uncertainty_score":0.50850606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9343499,0.00020642378,0.059011377,0.00047461127,0.003870069,0.0003471273,0.000010147838,0.00024571008,0.0014846242],"genre_scores_gemma":[0.99952036,0.000053710217,0.00014517254,0.00005411126,0.000022511627,0.000027755232,0.0000014205609,0.000018909248,0.00015606533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974641,0.0004945512,0.0005232206,0.00069201627,0.00036296542,0.00046312343],"domain_scores_gemma":[0.99701595,0.0011851322,0.0003232364,0.0008640517,0.00039972394,0.00021192126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062908,0.00027975446,0.0005213281,0.00026241026,0.00020517541,0.00008693159,0.0006255232,0.00023334255,0.000013449934],"category_scores_gemma":[0.0003851699,0.00021342079,0.000128037,0.0010417169,0.00026055827,0.00062765664,0.00033813258,0.00022215142,0.000017233433],"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.00005693705,0.00020583041,0.010887447,0.000028201677,0.000065506916,0.000022747787,0.00020112307,0.000004525689,0.005049264,0.96794945,0.0042752693,0.011253698],"study_design_scores_gemma":[0.0076655643,0.0018113588,0.31410426,0.0004951355,0.000051891555,0.00019079614,0.00013211847,0.013131699,0.021884413,0.6341516,0.005111454,0.0012697623],"about_ca_topic_score_codex":0.0003256443,"about_ca_topic_score_gemma":0.000048599515,"teacher_disagreement_score":0.3337979,"about_ca_system_score_codex":0.000113469556,"about_ca_system_score_gemma":0.000117507836,"threshold_uncertainty_score":0.8703047},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772459,0.00008397434,0.08686,0.0027028848,0.008623172,0.00052614673,0.000002976016,0.00016667851,0.02378829],"genre_scores_gemma":[0.99775165,0.000005501454,0.00006425569,0.00017596275,0.000028831038,0.00002604262,2.7687312e-7,0.000010573429,0.0019368948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998723,0.00023635685,0.00024398277,0.0002631641,0.00028933262,0.00024416836],"domain_scores_gemma":[0.9984526,0.00044578253,0.00015344273,0.0007519767,0.00013944543,0.000056745663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063554576,0.00013313163,0.0002165053,0.00002522214,0.00011052192,0.00005370259,0.0006487329,0.000067294786,0.000046205932],"category_scores_gemma":[0.00004238675,0.000062384024,0.000090358015,0.0003026423,0.000060758906,0.00015942674,0.00009108574,0.00011636301,0.000052113923],"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.000022001175,0.00003579098,0.0030821387,0.0000030138924,0.000042560627,0.000005446953,0.000085370644,0.000045974804,0.000023961296,0.9806806,0.015015093,0.0009580548],"study_design_scores_gemma":[0.0065038186,0.0016951151,0.011393259,0.0012996155,0.0000618045,0.00020249955,0.00017698605,0.039886083,0.002288024,0.9155649,0.019648887,0.0012789957],"about_ca_topic_score_codex":0.000049102033,"about_ca_topic_score_gemma":0.00000575398,"teacher_disagreement_score":0.12050578,"about_ca_system_score_codex":0.00004386229,"about_ca_system_score_gemma":0.000030972813,"threshold_uncertainty_score":0.25439465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91757727,0.00008892866,0.058974564,0.0012131946,0.00430894,0.00020727572,0.0000014561595,0.0004270345,0.017201345],"genre_scores_gemma":[0.9977707,0.000010299352,0.0005852318,0.00018728197,0.000022805967,0.00001753262,2.8466104e-7,0.0000146500815,0.0013911594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988983,0.00006313667,0.00017952285,0.0003257907,0.00023529465,0.00029792497],"domain_scores_gemma":[0.9990302,0.00012282954,0.00005957813,0.0005652634,0.0001191639,0.0001030062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021720237,0.00014254508,0.0001743342,0.000068406574,0.00012484567,0.00011859377,0.0005645954,0.00006069167,0.00003140461],"category_scores_gemma":[0.000020812842,0.0000856726,0.000046084842,0.00029543648,0.000038086044,0.0005283077,0.00012603473,0.00008239218,0.00021250182],"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.000009738908,0.000036754645,0.0040478976,0.0000055441596,0.000026425609,0.000031095486,0.00017881978,0.000015309997,0.0012880297,0.9865632,0.0017809503,0.006016199],"study_design_scores_gemma":[0.013094229,0.0030794905,0.022738326,0.0016987156,0.000060817612,0.0018007976,0.0004090564,0.02307763,0.01702687,0.54750514,0.3660574,0.0034515646],"about_ca_topic_score_codex":0.000042148324,"about_ca_topic_score_gemma":0.000012582125,"teacher_disagreement_score":0.43905813,"about_ca_system_score_codex":0.000058351823,"about_ca_system_score_gemma":0.000047884347,"threshold_uncertainty_score":0.34936273},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8964344,0.00019904731,0.061338656,0.0017289737,0.016882638,0.00029396277,0.0000018249327,0.00055553846,0.022564922],"genre_scores_gemma":[0.9988128,0.000009407124,0.0005599619,0.00006493676,0.000010413057,0.0000058623204,1.1492481e-7,0.000006662192,0.0005298394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.000056107172,0.000234463,0.00021353083,0.00018468779,0.0001794795],"domain_scores_gemma":[0.99915755,0.00013024111,0.00010702702,0.0004481313,0.0000978827,0.00005919823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026498633,0.00008959906,0.00016291156,0.000058934937,0.000050711,0.00003210304,0.0005538246,0.00005584161,0.000016698297],"category_scores_gemma":[0.000027568709,0.000059381273,0.00007255744,0.00019072361,0.000017383132,0.00030917858,0.00011132606,0.000049602975,0.00008086526],"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.000002493365,0.000046284506,0.0010955286,0.00000610455,0.000018504654,0.0000028214213,0.0003418302,7.743472e-7,0.0011114405,0.9875456,0.005015429,0.0048131878],"study_design_scores_gemma":[0.0028549968,0.0005452529,0.006196633,0.000276931,0.000013637675,0.000045871817,0.0000421739,0.013575167,0.013470567,0.9082932,0.0541622,0.00052336016],"about_ca_topic_score_codex":0.000024137751,"about_ca_topic_score_gemma":0.0000063461825,"teacher_disagreement_score":0.10237837,"about_ca_system_score_codex":0.00004121356,"about_ca_system_score_gemma":0.000030922383,"threshold_uncertainty_score":0.24214981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93759626,0.00006877606,0.05513791,0.00046165416,0.0021653702,0.00017404133,0.0000015517039,0.0001421094,0.0042523257],"genre_scores_gemma":[0.99900496,0.0000051678503,0.00055332814,0.00004209999,0.000015034422,0.000015835087,2.4946235e-7,0.000010982629,0.00035232506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873936,0.00012644005,0.00024326843,0.00035331503,0.0002778827,0.00025972084],"domain_scores_gemma":[0.998617,0.00020323902,0.00016770576,0.0007344497,0.00019390185,0.00008369823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004077064,0.00014275964,0.00025517182,0.0000980266,0.000080432845,0.00004411819,0.00055879576,0.000052479503,0.0000141742385],"category_scores_gemma":[0.00003370454,0.00008688475,0.00008147938,0.0004106785,0.000080175545,0.00041939758,0.00011123667,0.000075673095,0.000021854394],"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.0000164801,0.000066321954,0.009052503,0.000008360034,0.00003672316,0.000009497854,0.00015359446,0.000008133986,0.0015710695,0.98446256,0.0009459917,0.0036687534],"study_design_scores_gemma":[0.005038282,0.0012341773,0.019115727,0.0005434427,0.000021983573,0.00013146258,0.000059247228,0.0027336208,0.038799923,0.92462623,0.0069750263,0.0007208693],"about_ca_topic_score_codex":0.00008939624,"about_ca_topic_score_gemma":0.000034947243,"teacher_disagreement_score":0.061408717,"about_ca_system_score_codex":0.000038212023,"about_ca_system_score_gemma":0.000040451523,"threshold_uncertainty_score":0.3543057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008972034,0.0001866595,0.9560372,0.0060501955,0.005449545,0.00056905305,0.0000044104836,0.00014994087,0.02258096],"genre_scores_gemma":[0.9687581,0.00002029924,0.0054516355,0.0013189955,0.0008856929,0.00007454029,8.90213e-7,0.000012122272,0.023477698],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990198,0.000026229322,0.00020621518,0.00032063844,0.00013755324,0.0002895765],"domain_scores_gemma":[0.99826765,0.00021149976,0.00014856589,0.0012205313,0.00009567797,0.000056078556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041715943,0.00013178935,0.00015363593,0.00002769905,0.00087724085,0.00088684727,0.0016005186,0.000066883615,0.00004765083],"category_scores_gemma":[0.000043353455,0.00007806671,0.00014994356,0.00003934762,0.0000534589,0.00041546935,0.00022550255,0.00009728033,0.00009950451],"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.000033130193,0.000058141635,0.0021099357,0.000027113076,0.00013138662,0.0000089626665,0.0011894827,0.00022782761,0.001107886,0.18818943,0.6674706,0.13944611],"study_design_scores_gemma":[0.00056723977,0.00012265267,0.005317309,0.000040694697,0.000010767544,0.000037416026,0.000099409874,0.2162547,0.001382096,0.0022806013,0.7736172,0.000269926],"about_ca_topic_score_codex":0.00028893753,"about_ca_topic_score_gemma":0.0003202414,"teacher_disagreement_score":0.9597861,"about_ca_system_score_codex":0.000025881356,"about_ca_system_score_gemma":0.000025531892,"threshold_uncertainty_score":0.85518885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034033784,0.000044485867,0.98854125,0.0006704712,0.0020598753,0.00019001204,0.000028636316,0.00011428617,0.0049476335],"genre_scores_gemma":[0.4512908,0.0000032793878,0.5474638,0.0001399195,0.0004128697,0.000018479639,0.000007995781,0.000009131567,0.0006537648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899334,0.00007054362,0.00027459412,0.00027825733,0.00015904267,0.00022423189],"domain_scores_gemma":[0.99902356,0.00028421998,0.00008724858,0.0002621023,0.00021563939,0.00012725672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003604066,0.00009873801,0.0001716442,0.000048742935,0.00010877289,0.00015661551,0.00021805531,0.00005410016,0.000013944516],"category_scores_gemma":[0.00026847128,0.00008903935,0.000047494534,0.0001260248,0.000052508876,0.00015778006,0.00004946927,0.00007188351,0.0000398638],"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.000017812068,0.000017586077,0.00013797088,0.00001084471,0.000018996661,0.0000042024894,0.00053108536,0.0005671476,0.00011045469,0.9477692,0.032456584,0.018358072],"study_design_scores_gemma":[0.0008088602,0.00032159212,0.00017491766,0.000032450567,0.000012781681,0.00007242984,0.00025933085,0.8432672,0.00016863193,0.055158284,0.099465415,0.00025810144],"about_ca_topic_score_codex":0.000047664795,"about_ca_topic_score_gemma":0.00001867729,"teacher_disagreement_score":0.89261097,"about_ca_system_score_codex":0.000043499127,"about_ca_system_score_gemma":0.0001018229,"threshold_uncertainty_score":0.36309195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9599588,0.00066869456,0.028423836,0.00033008397,0.0072993464,0.00022600591,5.788773e-7,0.00010654679,0.0029861385],"genre_scores_gemma":[0.9992496,0.00006687111,0.00050814956,0.00005266635,0.000027956115,0.000007691392,7.073206e-7,0.000012207706,0.000074152355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987757,0.00008252059,0.00030484586,0.0003631104,0.0002027485,0.00027104176],"domain_scores_gemma":[0.99837154,0.00010267203,0.00032672498,0.0009711368,0.00011382167,0.00011412165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259974,0.00016041995,0.00029961357,0.000073922456,0.00047526578,0.00030702277,0.00086268823,0.00011271319,0.000004738951],"category_scores_gemma":[0.000059324357,0.00014824879,0.000084738764,0.00010913245,0.00009497771,0.0005286554,0.00034385532,0.00017851366,0.0000045734037],"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.0000063846296,0.000043864868,0.011294,0.00003222226,0.000053021668,0.000014289581,0.0009314727,0.0004900162,0.00015285997,0.9786655,0.0016297413,0.0066866633],"study_design_scores_gemma":[0.0012706933,0.00025872036,0.02270969,0.00029048912,0.000017332528,0.00004989536,0.00011669532,0.7754708,0.00032153243,0.19717488,0.0018632092,0.00045607766],"about_ca_topic_score_codex":0.00024227204,"about_ca_topic_score_gemma":0.000018025856,"teacher_disagreement_score":0.78149056,"about_ca_system_score_codex":0.000029993776,"about_ca_system_score_gemma":0.00002472196,"threshold_uncertainty_score":0.604541},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92080104,0.0002604919,0.032769725,0.0006752521,0.020315325,0.0002392265,0.0000010160752,0.00016778507,0.024770152],"genre_scores_gemma":[0.9989988,0.000008372467,0.0005383283,0.000038137958,0.00006851718,0.0000059713147,5.643848e-7,0.000008367436,0.00033290026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892426,0.00007699195,0.00030181347,0.00025956577,0.00019829588,0.00023906319],"domain_scores_gemma":[0.99818295,0.00009757684,0.00035135774,0.0011655085,0.00014375216,0.000058843634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448997,0.00010510671,0.00021634085,0.000040526935,0.00040688703,0.00027238016,0.0013254116,0.000082037826,0.000005534506],"category_scores_gemma":[0.00008793263,0.000099006094,0.000070335445,0.0000808031,0.000058562153,0.00044041596,0.00037638366,0.00012509174,0.000012425583],"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.0000041285857,0.00002642187,0.006076865,0.000009879386,0.000016871698,0.000008996068,0.00014446775,0.00020081532,0.0000552683,0.9877556,0.0019442934,0.0037563874],"study_design_scores_gemma":[0.002765356,0.0004216315,0.07142583,0.00049954874,0.000024719364,0.00006655472,0.0001421149,0.32951334,0.005582841,0.5798755,0.00876874,0.00091379613],"about_ca_topic_score_codex":0.00012843215,"about_ca_topic_score_gemma":0.000010296445,"teacher_disagreement_score":0.40788007,"about_ca_system_score_codex":0.00002132308,"about_ca_system_score_gemma":0.000030509573,"threshold_uncertainty_score":0.40373513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02270073,0.0009418812,0.9358558,0.0082108155,0.0048944894,0.0004729861,0.000008070746,0.0008876258,0.026027592],"genre_scores_gemma":[0.99250335,0.00012120702,0.0006182033,0.000073702686,0.000046820667,0.00010970701,3.3964477e-7,0.000009757024,0.0065169213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988084,0.000049470942,0.0002903211,0.00044915764,0.0001087342,0.00029390925],"domain_scores_gemma":[0.9973964,0.000081435486,0.0001832017,0.0021845915,0.000084051746,0.000070308946],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003691971,0.00016426528,0.0002747651,0.0003988365,0.0013944845,0.0005421131,0.0014394338,0.00030576336,0.000024383136],"category_scores_gemma":[0.000043850625,0.00014473613,0.0000619154,0.0001817766,0.00014045417,0.0004736445,0.000014917288,0.00033590815,0.00011466361],"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.00002659532,0.00012815894,0.0012238083,0.00009650676,0.00023115981,0.00006116411,0.0002947262,0.0006831748,0.0011199953,0.5216255,0.0013479473,0.47316125],"study_design_scores_gemma":[0.0063738055,0.0027088549,0.0052052964,0.0021482185,0.00013972576,0.006415337,0.0030737845,0.27831635,0.029222384,0.13662104,0.5259625,0.0038127066],"about_ca_topic_score_codex":0.00011742695,"about_ca_topic_score_gemma":0.000034078475,"teacher_disagreement_score":0.9698026,"about_ca_system_score_codex":0.0000275036,"about_ca_system_score_gemma":0.000022526134,"threshold_uncertainty_score":0.9999056},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29566008,0.00007158362,0.7015953,0.00033532808,0.0012077392,0.0003729076,0.000009573452,0.000104781386,0.00064269133],"genre_scores_gemma":[0.99802244,0.0000010287082,0.0014129191,0.00008206613,0.00016368805,0.0001080888,0.000001197697,0.0000058640167,0.00020271513],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987474,0.00007197998,0.00027595856,0.00049908855,0.00017700286,0.00022853757],"domain_scores_gemma":[0.99806434,0.00016216445,0.0002864616,0.0010913761,0.0003030331,0.00009262759],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007815497,0.00012819355,0.00029796173,0.00008758255,0.00068872486,0.0016784808,0.0015931468,0.0000881843,0.000004658431],"category_scores_gemma":[0.00009976669,0.00010715194,0.00012915416,0.00020627442,0.000045406287,0.00088286324,0.00014387112,0.00008174732,0.0000069362295],"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.00048362344,0.0006455225,0.70960325,0.0063498127,0.0031507495,0.00012259187,0.0026405235,0.098864034,0.0057452787,0.118352175,0.02468586,0.029356616],"study_design_scores_gemma":[0.00032517462,0.00003608427,0.01015379,0.000062624174,0.000049630868,0.0000024389456,0.00001088865,0.9854878,0.0028906176,0.000096968055,0.00071810855,0.00016587805],"about_ca_topic_score_codex":0.0003825842,"about_ca_topic_score_gemma":0.00018584818,"teacher_disagreement_score":0.88662374,"about_ca_system_score_codex":0.000055535536,"about_ca_system_score_gemma":0.00005625192,"threshold_uncertainty_score":0.9993579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90920395,0.00038610052,0.064025305,0.00038501428,0.014398655,0.0002996767,0.0000011780019,0.000113990325,0.011186136],"genre_scores_gemma":[0.9994694,0.000026196583,0.0003623147,0.000023890068,0.000034801717,0.0000069520215,9.4412127e-7,0.000010812403,0.00006467737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987451,0.00008357366,0.0004014523,0.00028335105,0.0002485266,0.0002379971],"domain_scores_gemma":[0.997872,0.000082795385,0.00050433964,0.0013151849,0.00014657296,0.00007912922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047466336,0.00013724678,0.00033372905,0.00006437536,0.00024458632,0.000117438285,0.0013786346,0.00011356507,0.000011618316],"category_scores_gemma":[0.000062198254,0.00012677365,0.00013237834,0.00011031237,0.00010117383,0.0003888988,0.00029343832,0.00015278738,0.000008362042],"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.000007287007,0.000100784455,0.006319663,0.00003941493,0.000072703086,0.0000097730945,0.0008158902,0.0010077882,0.00022569053,0.9795338,0.0020640984,0.009803136],"study_design_scores_gemma":[0.0018313963,0.00046475127,0.035372764,0.00040440823,0.000025539828,0.000028950551,0.00011134516,0.6938595,0.0022385358,0.2634508,0.0016608086,0.0005511743],"about_ca_topic_score_codex":0.0004914367,"about_ca_topic_score_gemma":0.000017293585,"teacher_disagreement_score":0.71608293,"about_ca_system_score_codex":0.000030149693,"about_ca_system_score_gemma":0.000042638556,"threshold_uncertainty_score":0.5169679},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046843357,0.0004338352,0.94317985,0.0038792654,0.00048718826,0.0006367322,0.00007783214,0.0010876121,0.0033743407],"genre_scores_gemma":[0.94336873,0.00007298625,0.05316786,0.0022375388,0.000097779135,0.00026646964,0.000040742514,0.00004866312,0.00069923984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645394,0.00026459384,0.0006578723,0.0010346336,0.00058773934,0.0010012056],"domain_scores_gemma":[0.9960081,0.0001129123,0.00044606617,0.0026928182,0.0002765964,0.00046348854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013052349,0.00051220844,0.00072845287,0.0009578915,0.0003350585,0.0008773836,0.002315055,0.00037601308,0.00007261202],"category_scores_gemma":[0.0001053549,0.00045954617,0.00048467578,0.0015595854,0.00009573755,0.0011736896,0.00062791177,0.0005158678,0.00003528038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00044335471,0.0011637019,0.23783965,0.00009246283,0.0040608575,0.00081155036,0.019333959,0.002505053,0.0030351763,0.6228444,0.08888102,0.018988812],"study_design_scores_gemma":[0.0022285369,0.0010287986,0.16997537,0.00026227176,0.0008722638,0.0009778902,0.002682205,0.77265215,0.006720582,0.012961666,0.025981376,0.0036568667],"about_ca_topic_score_codex":0.015664775,"about_ca_topic_score_gemma":0.00803789,"teacher_disagreement_score":0.8965254,"about_ca_system_score_codex":0.0003335641,"about_ca_system_score_gemma":0.00018663748,"threshold_uncertainty_score":0.9997856},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13083665,0.000013226609,0.865884,0.0015300006,0.00044658268,0.00020555554,7.604168e-7,0.00010220341,0.0009809847],"genre_scores_gemma":[0.7662972,3.3456848e-7,0.23245798,0.00078256853,0.0001079606,0.000034411078,6.6926583e-7,0.0000062537338,0.00031261749],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988196,0.00013031016,0.00024350073,0.00038349454,0.00013230568,0.0002908146],"domain_scores_gemma":[0.99871266,0.00010784839,0.00014689227,0.0008275953,0.00009349074,0.00011148839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086825906,0.000104910716,0.00017312318,0.000043527347,0.00043923492,0.0003603976,0.0007492244,0.00006746478,0.000013469218],"category_scores_gemma":[0.0000687323,0.00009552866,0.000054914548,0.0001179515,0.000027860262,0.00029935493,0.00018371323,0.0000734379,0.00007172253],"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.00008155901,0.00029609902,0.006140834,0.00006740666,0.000114164424,0.000019890973,0.0035989175,0.17914373,0.49395135,0.15506056,0.027452882,0.13407262],"study_design_scores_gemma":[0.00020684887,0.000043077573,0.00018996272,0.0000122655765,0.0000027574588,0.000009714472,0.00006682173,0.9639928,0.026230507,0.00011483261,0.00898829,0.00014214571],"about_ca_topic_score_codex":0.0005485305,"about_ca_topic_score_gemma":0.00004050673,"teacher_disagreement_score":0.78484905,"about_ca_system_score_codex":0.000050971106,"about_ca_system_score_gemma":0.00003085155,"threshold_uncertainty_score":0.38955456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021258667,0.0021623604,0.93216395,0.034486737,0.0045481343,0.000518665,0.000079486075,0.000106319756,0.0046756985],"genre_scores_gemma":[0.9886274,0.00030906443,0.0057195644,0.00035052394,0.002246771,0.000055566084,0.000032411972,0.000040961237,0.0026177897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99605834,0.0011159761,0.0009593799,0.0005962085,0.00046001186,0.0008100828],"domain_scores_gemma":[0.996333,0.001499285,0.000669872,0.0008864053,0.00034298212,0.00026843004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016777398,0.00038275716,0.0006274923,0.00031403825,0.0003120515,0.00017129084,0.0006910836,0.00042322653,0.00018065696],"category_scores_gemma":[0.00029524852,0.00031645206,0.00031619833,0.001113605,0.00043547706,0.00047105725,0.00020709174,0.00047326632,0.00003843333],"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.00020792564,0.0003452227,0.00242814,0.00034939472,0.00019562471,0.00002238481,0.0040634396,0.14704075,0.0031834808,0.7732453,0.054245364,0.014673007],"study_design_scores_gemma":[0.001884143,0.0010936371,0.011157731,0.0038258433,0.00011256667,0.00068606733,0.00014234234,0.054293737,0.012272207,0.056658868,0.8569588,0.00091405737],"about_ca_topic_score_codex":0.0003065524,"about_ca_topic_score_gemma":0.00027797293,"teacher_disagreement_score":0.96736866,"about_ca_system_score_codex":0.00016999534,"about_ca_system_score_gemma":0.00062325055,"threshold_uncertainty_score":0.9999288},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003063468,0.040218525,0.8336466,0.00011849006,0.010325362,0.002922998,0.000019026073,0.00019447347,0.11224819],"genre_scores_gemma":[0.98313177,0.0019619735,0.0004011809,0.000037259324,0.0006010746,0.00009757896,0.00003163929,0.000051474617,0.013686062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698246,0.00015347272,0.0013137361,0.00082231377,0.0003001667,0.0004278434],"domain_scores_gemma":[0.99644667,0.0009590651,0.0012544575,0.0010478343,0.00021301614,0.00007893808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017093621,0.00045519453,0.00086618256,0.00036087914,0.00043354335,0.0006725096,0.0010206962,0.00036406508,0.0000010047359],"category_scores_gemma":[0.00007891457,0.00044356263,0.00012299656,0.000046730052,0.00007235823,0.00046229802,0.00029074657,0.00057827844,0.000010691388],"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.000017920725,0.00001846573,0.00032498437,0.0005339574,0.000026011514,0.0000115737175,0.00066099555,0.0843371,7.0178845e-7,0.87585896,0.000091582064,0.038117737],"study_design_scores_gemma":[0.00039149338,0.00017835687,0.000032702726,0.016601324,0.000008997096,0.00006932292,0.00037256617,0.87865245,0.0000036635877,0.0047398265,0.09833477,0.00061452505],"about_ca_topic_score_codex":0.00034360297,"about_ca_topic_score_gemma":0.00030833902,"teacher_disagreement_score":0.9828254,"about_ca_system_score_codex":0.00029857157,"about_ca_system_score_gemma":0.00004705611,"threshold_uncertainty_score":0.99980164},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009709495,0.0014661717,0.27377573,0.002045619,0.0066835964,0.0027323437,0.00019696423,0.00008673456,0.70330334],"genre_scores_gemma":[0.91828287,0.00018109684,0.0059601837,0.0017446262,0.00083533744,0.00026864142,0.00021764437,0.00006799437,0.07244163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971383,0.00009819513,0.0005264655,0.0005435124,0.0012603682,0.0004331207],"domain_scores_gemma":[0.998395,0.00051015726,0.00040043972,0.0004258042,0.0000023713988,0.0002662206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000029512474,0.0003654797,0.0005526237,0.000045683635,0.0002780078,0.00014224571,0.0007105239,0.00011446337,0.000012344762],"category_scores_gemma":[0.0000042808865,0.00032413518,0.00010793774,0.00010048537,0.000026278873,0.00037509372,0.00007069921,0.00028918582,4.5490895e-9],"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.002667276,0.00011471998,0.0002453739,0.0017093227,0.0005855723,0.000044434262,0.0005965007,0.01993891,0.0010574686,0.861737,0.040724024,0.07057937],"study_design_scores_gemma":[0.0015525565,0.0002155333,0.0008355767,0.00056205556,0.000033813994,0.000009379035,0.0011978998,0.9657106,0.005954366,0.0015701054,0.021608057,0.00075007096],"about_ca_topic_score_codex":0.0015279277,"about_ca_topic_score_gemma":0.008381465,"teacher_disagreement_score":0.9457717,"about_ca_system_score_codex":0.000011420286,"about_ca_system_score_gemma":0.0010843003,"threshold_uncertainty_score":0.9999211},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010340373,0.00037950333,0.9585314,0.0003667962,0.000890259,0.00036439075,0.0000014287189,0.00049243023,0.028633442],"genre_scores_gemma":[0.9866902,0.0000016522872,0.011457224,0.0001286846,0.000507137,0.000034091496,9.918571e-7,0.000017293249,0.0011627083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984453,0.0002442479,0.0002658751,0.00044505368,0.000248372,0.00035118108],"domain_scores_gemma":[0.99895793,0.00029617123,0.00012966193,0.0004993707,0.00005404667,0.0000628457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041987732,0.000206229,0.00027498533,0.00006720929,0.000272237,0.00044075,0.00036128212,0.00010767512,0.0000020675723],"category_scores_gemma":[0.000013661898,0.00016557863,0.000063560845,0.00023239348,0.000025670626,0.00019896872,0.000089286885,0.00018361805,0.00005453941],"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.000035905887,0.000032420303,0.00014162163,0.0005335078,0.000046268662,0.00013200921,0.0051548346,0.049792785,0.0010372712,0.9284978,0.010435934,0.0041596456],"study_design_scores_gemma":[0.003130433,0.0011964735,0.0017849476,0.0046224855,0.00007563824,0.0045049805,0.0122108,0.8945263,0.009370934,0.0035415355,0.062414207,0.0026212474],"about_ca_topic_score_codex":0.0005036788,"about_ca_topic_score_gemma":0.0000218225,"teacher_disagreement_score":0.97634983,"about_ca_system_score_codex":0.000119408425,"about_ca_system_score_gemma":0.000026793432,"threshold_uncertainty_score":0.67521006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061820596,0.00007190738,0.9655751,0.0002511623,0.0030319062,0.000108484324,1.8962184e-7,0.000099304045,0.024679909],"genre_scores_gemma":[0.9834013,0.0000028186741,0.01380668,0.00024347207,0.00031360757,0.000010317301,2.9336988e-7,0.0000061390574,0.0022153913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989211,0.000046301284,0.00024447488,0.00032377007,0.00014770834,0.00031667593],"domain_scores_gemma":[0.9989657,0.00004787331,0.00012245523,0.00075331196,0.00004501686,0.00006565816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049860973,0.00010467817,0.00014752882,0.00006556224,0.00035937253,0.00062216836,0.00094232993,0.00006607016,0.00002472126],"category_scores_gemma":[0.000019201989,0.000088262,0.000054701304,0.0000961042,0.000026582093,0.00019888842,0.0003323636,0.00015559644,0.000050443632],"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.0000057248953,0.0001367205,0.0050593494,0.000010883741,0.000022272432,0.00017794779,0.0007265164,0.28555354,0.00003177223,0.036761798,0.008824882,0.6626886],"study_design_scores_gemma":[0.00021466523,0.00001973112,0.0033905678,0.00004169947,5.4269634e-7,0.000025716141,0.00002033497,0.993497,0.000013027087,0.00006995559,0.0025876225,0.000119122065],"about_ca_topic_score_codex":0.000285563,"about_ca_topic_score_gemma":0.000082099854,"teacher_disagreement_score":0.9772192,"about_ca_system_score_codex":0.00003538929,"about_ca_system_score_gemma":0.00001667173,"threshold_uncertainty_score":0.5999584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12230462,0.000036217327,0.7729599,0.005175144,0.004895676,0.0010861869,0.000006402963,0.00024076483,0.093295075],"genre_scores_gemma":[0.99213696,0.0000041463277,0.0019321119,0.0010288127,0.00029192152,0.00009757867,0.0000011278397,0.000014953879,0.004492375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984466,0.00006535921,0.0003590805,0.00053286087,0.000179257,0.000416864],"domain_scores_gemma":[0.9984811,0.00018221918,0.0001319424,0.001021335,0.000082824336,0.000100594196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055403484,0.00019728045,0.00030097977,0.00014612229,0.00032257376,0.0005397353,0.0014065477,0.000120605306,0.00006969052],"category_scores_gemma":[0.00008959421,0.00016101009,0.00019003716,0.00008218206,0.00004411402,0.0006351744,0.000087254055,0.00017551372,0.00013045761],"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.00020900325,0.00040123035,0.0021345872,0.00012180752,0.00009997953,0.0000923088,0.0054057157,0.0008345685,0.0014792872,0.88045126,0.029699404,0.07907087],"study_design_scores_gemma":[0.008222171,0.0021259456,0.021545773,0.0010400703,0.000021045069,0.000108772285,0.00060012966,0.8175213,0.009470593,0.026621003,0.11091762,0.0018055866],"about_ca_topic_score_codex":0.00034497853,"about_ca_topic_score_gemma":0.0013087089,"teacher_disagreement_score":0.86983234,"about_ca_system_score_codex":0.000060654234,"about_ca_system_score_gemma":0.000038330527,"threshold_uncertainty_score":0.6565801},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6826362,0.000071388604,0.30603227,0.00035079595,0.0009646755,0.0002175657,0.0000012234597,0.000050494702,0.009675397],"genre_scores_gemma":[0.98899925,0.0000062135905,0.010534303,0.000092991264,0.000046229557,0.00001132454,6.1379086e-7,0.000004304444,0.00030476865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904364,0.0000349091,0.0002992814,0.00024031049,0.000195925,0.00018593304],"domain_scores_gemma":[0.99907607,0.000032675263,0.00017458269,0.0005936095,0.00007632913,0.00004673141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028591583,0.00009651333,0.00017924997,0.00005993414,0.0001177329,0.00012388731,0.0008301956,0.000043150114,0.000021652244],"category_scores_gemma":[0.000021016196,0.00007808508,0.000049521,0.000043456504,0.000034482688,0.00023251795,0.00025788412,0.000065708766,0.000015861982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018690177,0.0008235885,0.019763982,0.00013870987,0.0001344594,0.0001744028,0.0062794937,0.9046012,0.0018475906,0.035332147,0.0016524184,0.029065102],"study_design_scores_gemma":[0.0007610941,0.00017330836,0.0020580748,0.00008111068,0.0000019749386,0.000039975137,0.00011981013,0.9904846,0.0040494343,0.000044208275,0.0020185574,0.00016787974],"about_ca_topic_score_codex":0.00039685084,"about_ca_topic_score_gemma":0.00018232032,"teacher_disagreement_score":0.30636308,"about_ca_system_score_codex":0.000037112768,"about_ca_system_score_gemma":0.000019527954,"threshold_uncertainty_score":0.31842172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5912396,0.00032098862,0.36883157,0.0011758282,0.02423575,0.0018579125,0.00008431557,0.0004510917,0.011802974],"genre_scores_gemma":[0.99659663,0.0000037051861,0.0028887147,0.00004426028,0.000033139208,0.000050114784,0.000003631341,0.00001270606,0.00036708175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885786,0.000070129965,0.0002706621,0.00034660185,0.00018401127,0.0002707368],"domain_scores_gemma":[0.9981473,0.00021015362,0.00033157994,0.0010267354,0.00020160912,0.00008259404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051153183,0.00014689672,0.00032707216,0.000079531215,0.00044302226,0.00018962253,0.001080792,0.00010656633,0.000007570797],"category_scores_gemma":[0.00008842684,0.00013935257,0.00017403357,0.00009420181,0.00006996264,0.0004389698,0.00013025918,0.00009931622,0.000029637105],"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.000008822753,0.00012011656,0.0011178578,0.000027178596,0.0000589196,0.000005830865,0.00026381822,0.0000029671064,0.00026127105,0.9658164,0.009529004,0.02278784],"study_design_scores_gemma":[0.0026637884,0.0007211711,0.0085595725,0.00015324469,0.000021740754,0.00003143914,0.00003593595,0.1701381,0.0033715167,0.80555207,0.008254607,0.0004967988],"about_ca_topic_score_codex":0.00011623198,"about_ca_topic_score_gemma":0.00001084187,"teacher_disagreement_score":0.4053571,"about_ca_system_score_codex":0.000031613916,"about_ca_system_score_gemma":0.000038932503,"threshold_uncertainty_score":0.5682633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97266805,0.000091693706,0.003476514,0.0003615905,0.010495598,0.00008226928,0.0000017470534,0.000030098015,0.01279241],"genre_scores_gemma":[0.999627,0.0000059864774,0.000043694385,0.000033378994,0.000009497107,0.0000054185307,1.3291181e-7,0.00000494452,0.00026994804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911,0.00010432006,0.00023475118,0.00018578101,0.00021845018,0.00014669451],"domain_scores_gemma":[0.9979103,0.00008762999,0.00040996994,0.0014010624,0.00015804303,0.000032945456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003757889,0.00008720657,0.00020616589,0.000039640945,0.00030153262,0.0000895635,0.0015463805,0.000063492225,0.0000045122283],"category_scores_gemma":[0.000082117454,0.00006312722,0.00014998806,0.00013099483,0.00013593801,0.00028248806,0.00036302517,0.000078227895,0.0000013910495],"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.0000027862939,0.000046522684,0.01120461,0.000007804582,0.000020675281,6.606358e-7,0.0001374107,0.0000061961114,0.00042685666,0.9859334,0.0010981965,0.0011148802],"study_design_scores_gemma":[0.00054720906,0.00011502901,0.051155377,0.000074923104,0.0000073505066,0.000008285792,0.000018864892,0.0051540695,0.021511544,0.91868067,0.0025867787,0.00013992617],"about_ca_topic_score_codex":0.0008504532,"about_ca_topic_score_gemma":0.000116928226,"teacher_disagreement_score":0.067252755,"about_ca_system_score_codex":0.000017692866,"about_ca_system_score_gemma":0.000044716155,"threshold_uncertainty_score":0.28735852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007758655,0.000031678566,0.9827307,0.00075368705,0.00037476,0.00050549343,4.856201e-7,0.00023998345,0.0076045766],"genre_scores_gemma":[0.9775151,3.030064e-7,0.015652472,0.0008772463,0.00012799253,0.00014407774,0.0000010236116,0.000010491603,0.0056713205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989193,0.000034265886,0.00022823205,0.00035184203,0.0001597102,0.0003066457],"domain_scores_gemma":[0.99935824,0.00011137187,0.000072512514,0.00028052405,0.00009964135,0.0000777092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021779728,0.00012528789,0.00013667205,0.00007098713,0.00020638882,0.0003835961,0.00048689893,0.00006373,0.000049643117],"category_scores_gemma":[0.00003556901,0.00009030712,0.00007754302,0.0002007304,0.00002055913,0.00036231533,0.00004205291,0.000077428514,0.00013486232],"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.000016800392,0.000671037,0.00014220126,0.00014919354,0.000025542155,0.0000036815038,0.0057288352,0.0044169263,0.0008012218,0.4804192,0.11840222,0.38922316],"study_design_scores_gemma":[0.00039576634,0.00013595878,0.00013487299,0.000037534155,0.0000011630567,0.000008050403,0.00020264868,0.98818773,0.00041187057,0.00094669184,0.009379458,0.00015823315],"about_ca_topic_score_codex":0.00003512667,"about_ca_topic_score_gemma":0.0000085483625,"teacher_disagreement_score":0.98377085,"about_ca_system_score_codex":0.000026905383,"about_ca_system_score_gemma":0.000022555168,"threshold_uncertainty_score":0.3699026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122797266,0.00004813632,0.86270934,0.0007125074,0.000511628,0.00007254943,1.603716e-7,0.00002549388,0.013122911],"genre_scores_gemma":[0.99868125,0.000005031835,0.0010004786,0.00008452702,0.00004150718,0.0000016257636,9.339272e-8,0.0000015006771,0.00018396114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996512,0.000032733653,0.00010690481,0.000084813284,0.00006931377,0.00005504937],"domain_scores_gemma":[0.9994574,0.000063888896,0.000118140866,0.00030001017,0.000047694048,0.000012871425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030936857,0.000030665033,0.000051563413,0.000011628512,0.00034036627,0.000249433,0.00028916277,0.00001659452,0.000003328942],"category_scores_gemma":[0.000057982525,0.00001868701,0.0000142061435,0.000023978653,0.00003328034,0.00025119164,0.00010685857,0.000026180955,0.0000018465656],"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":[7.4827364e-7,0.0000041717653,0.0065698866,0.000007934842,0.00000727574,5.0651175e-7,0.0009481702,0.00010156859,0.0009855139,0.95482224,0.0004953427,0.036056656],"study_design_scores_gemma":[0.00016318263,0.00003632839,0.01054848,0.0001132695,0.000002196088,0.000016202663,0.00039994245,0.98150176,0.0053619593,0.00090008863,0.00087308075,0.00008351744],"about_ca_topic_score_codex":0.00019932412,"about_ca_topic_score_gemma":0.0001303476,"teacher_disagreement_score":0.9814002,"about_ca_system_score_codex":0.000004527068,"about_ca_system_score_gemma":0.00000513374,"threshold_uncertainty_score":0.26178566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96772873,0.00003041075,0.0021573782,0.0011154802,0.0077127684,0.00016615902,0.0000010727985,0.00005325486,0.021034734],"genre_scores_gemma":[0.9996229,0.0000037029597,0.000035727215,0.00012660694,0.000012442557,0.0000132945315,1.454129e-7,0.000005442622,0.00017978308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991234,0.00011749508,0.00016586427,0.00022194158,0.00020450872,0.00016681185],"domain_scores_gemma":[0.99790126,0.00030420785,0.00023545898,0.001416197,0.00010303142,0.000039859693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006623297,0.00009817572,0.00015955238,0.00003547401,0.0004970935,0.00019360954,0.0013451232,0.000053177,0.000012323826],"category_scores_gemma":[0.00020563662,0.000065016335,0.00010182472,0.0000847104,0.00007674962,0.00024030978,0.00020148962,0.00014234931,0.000033428943],"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.000003620543,0.000049425966,0.0014594834,0.0000035097223,0.00001421037,0.000002613385,0.0001732449,0.0000052587807,0.00006817332,0.9911425,0.006021544,0.0010564127],"study_design_scores_gemma":[0.0003315016,0.000168291,0.013109566,0.000053547206,0.0000028291308,0.000004489263,0.000018987323,0.0062818644,0.0017567825,0.9771881,0.00097007386,0.00011392888],"about_ca_topic_score_codex":0.000104618026,"about_ca_topic_score_gemma":0.0000100676025,"teacher_disagreement_score":0.031894114,"about_ca_system_score_codex":0.00001819707,"about_ca_system_score_gemma":0.000023213976,"threshold_uncertainty_score":0.38232914},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022948889,0.000064094485,0.88276035,0.010550641,0.0032685087,0.0003017887,0.0000010410051,0.00019187339,0.07991283],"genre_scores_gemma":[0.9844171,0.0000023434854,0.004871483,0.0015772731,0.0003966748,0.000008631264,9.42736e-7,0.0000068434924,0.008718756],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894226,0.000061906416,0.00027073701,0.0002943602,0.00016957424,0.00026117815],"domain_scores_gemma":[0.9990498,0.00006421243,0.00015762581,0.0005941795,0.000073779804,0.000060399154],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045355203,0.00010743496,0.00018852949,0.0000551516,0.00044059727,0.0010197933,0.0007524072,0.000069183174,0.000119267446],"category_scores_gemma":[0.00001503749,0.000094683906,0.000060928734,0.00010908667,0.000042398242,0.0008055748,0.00023148619,0.000104170314,0.00085210655],"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.000023217712,0.00011194882,0.007225022,0.000023642768,0.000051565952,0.000097130585,0.00241218,0.013684494,0.00009598432,0.15428017,0.8047161,0.017278498],"study_design_scores_gemma":[0.00037969567,0.000061588005,0.0061974074,0.000053561944,0.0000015040844,0.000024843592,0.0000079364445,0.9516282,0.00003495564,0.008190494,0.033244416,0.0001753805],"about_ca_topic_score_codex":0.00039514064,"about_ca_topic_score_gemma":0.00015440634,"teacher_disagreement_score":0.96146816,"about_ca_system_score_codex":0.00003740077,"about_ca_system_score_gemma":0.000027049135,"threshold_uncertainty_score":0.99992585},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066208835,0.0003224914,0.058365393,0.000118382595,0.0007443985,0.00024756565,0.00001505336,0.00014798682,0.9399725],"genre_scores_gemma":[0.8952835,0.00002816012,0.0013515013,0.0008836037,0.0007328059,0.0000111913905,0.0000034333277,0.000023806211,0.10168198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986002,0.000037262565,0.00032334903,0.00055750617,0.0002722726,0.00020940008],"domain_scores_gemma":[0.99921775,0.000033522745,0.00017099809,0.00036710608,0.00011167825,0.00009891783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001430619,0.00026535764,0.0003265238,0.00007594828,0.00012877274,0.00022491481,0.00028416968,0.00028697102,0.0000052337114],"category_scores_gemma":[0.0000041503713,0.00025843462,0.00017247145,0.000027789969,0.00004481111,0.00012732261,0.000056256627,0.00021000399,0.00001706851],"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.000007718435,0.000002043712,0.000007746672,0.0000098286755,0.00003890306,0.000055625485,0.0002724131,0.000011473609,0.000011768476,0.9751334,0.0010409524,0.023408117],"study_design_scores_gemma":[0.00045800762,0.0002351406,0.00011910554,0.00045515815,0.00004202173,0.00041804893,0.000035613284,0.0016571679,0.00006720674,0.9695116,0.026380843,0.0006200862],"about_ca_topic_score_codex":0.00005121626,"about_ca_topic_score_gemma":0.00007487074,"teacher_disagreement_score":0.8952173,"about_ca_system_score_codex":0.00007485198,"about_ca_system_score_gemma":0.000041762938,"threshold_uncertainty_score":0.99998677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035579444,0.00010070418,0.98600477,0.00016949902,0.0041008317,0.00018521755,0.000027208715,0.000045920984,0.005807921],"genre_scores_gemma":[0.9981377,0.0000074479685,0.0014418889,0.000017566337,0.0001748226,0.0000075408916,0.000012716872,0.0000029296712,0.000197382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917156,0.00004004727,0.00027413506,0.00022930957,0.00015958922,0.00012534026],"domain_scores_gemma":[0.9981103,0.000024085242,0.00027478716,0.0014643644,0.00009043407,0.000036032467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040688043,0.00006376617,0.00013420335,0.000028065413,0.00017698859,0.00034793795,0.0014983711,0.000024640229,0.000044381653],"category_scores_gemma":[0.000009860125,0.000051084786,0.000025166819,0.000024750905,0.000022629221,0.0007216103,0.000415664,0.000035835325,0.000029489853],"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.0000025161762,0.00006711044,0.007449801,0.000119008284,0.00011785992,0.000008069283,0.0007140762,0.00102754,0.000263418,0.5770836,0.06242567,0.35072133],"study_design_scores_gemma":[0.00039419864,0.000087256645,0.0031034977,0.00003593698,0.0000053591416,0.000018418994,0.00027890044,0.9709073,0.00035114514,0.000060847546,0.024637293,0.00011988181],"about_ca_topic_score_codex":0.0010891568,"about_ca_topic_score_gemma":0.00033375967,"teacher_disagreement_score":0.99457973,"about_ca_system_score_codex":0.000020599005,"about_ca_system_score_gemma":0.00004116486,"threshold_uncertainty_score":0.33551735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16013446,0.000037142872,0.8337482,0.0000720178,0.00013072407,0.00010263027,0.0000019908455,0.00008985641,0.005682948],"genre_scores_gemma":[0.8848789,0.000003127641,0.1145154,0.00005040222,0.00014635352,0.000010078584,0.0000012420336,0.0000074456702,0.0003870657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990699,0.000054487282,0.00021455516,0.0002603954,0.0002057689,0.00019485524],"domain_scores_gemma":[0.999416,0.000067111476,0.000105555395,0.0002481954,0.00011557683,0.000047572983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014581224,0.00010725826,0.00017808519,0.000050641374,0.000114886374,0.000074093776,0.00024913112,0.00005332673,0.000086633765],"category_scores_gemma":[0.0000055776304,0.00008656721,0.00004984016,0.0002582994,0.000042053125,0.0003931595,0.00002824201,0.0001219078,0.0000369791],"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.00020789415,0.00022076118,0.00023556675,0.000023647186,0.00018781028,0.0000510944,0.0024908953,0.02181422,0.00064818707,0.010998232,0.0010933307,0.9620284],"study_design_scores_gemma":[0.00041222843,0.00035896065,0.0005047897,0.00008149787,0.000007974683,0.00014376432,0.00023687712,0.99221027,0.0019211683,0.00029927288,0.0036450017,0.00017818686],"about_ca_topic_score_codex":0.00031356973,"about_ca_topic_score_gemma":0.00000754749,"teacher_disagreement_score":0.97039604,"about_ca_system_score_codex":0.000038123275,"about_ca_system_score_gemma":0.00003651295,"threshold_uncertainty_score":0.35301083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005468336,0.000006198576,0.98142594,0.00077577616,0.0010321747,0.00008519,7.735004e-7,0.00014497581,0.015982129],"genre_scores_gemma":[0.87883407,0.0000019193471,0.11924352,0.00022382678,0.00009691329,0.000018363024,5.138116e-7,0.0000056135614,0.0015752927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930185,0.00004232279,0.00014773091,0.00024012994,0.00011859129,0.0001493747],"domain_scores_gemma":[0.9988489,0.000070400056,0.00011325229,0.0008265358,0.000086553366,0.00005436048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461444,0.000081246595,0.00010523508,0.000045540426,0.00041963183,0.0005969457,0.00079258194,0.000030640633,0.00010546368],"category_scores_gemma":[0.000112069276,0.00006655428,0.000060620976,0.000026371705,0.000020198479,0.00046578737,0.00009678572,0.000044911936,0.00009215237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009609972,0.00019214298,0.0009835226,0.000023165017,0.000035243265,0.000034145378,0.000104330364,0.93620414,0.00010719538,0.023110416,0.012117847,0.027078222],"study_design_scores_gemma":[0.00014356211,0.000014194749,0.00015715104,0.000019646322,0.0000019537902,0.000005956756,0.000003845082,0.99431723,0.0038191015,0.000020519134,0.0013982315,0.00009859896],"about_ca_topic_score_codex":0.00013136181,"about_ca_topic_score_gemma":0.000027682365,"teacher_disagreement_score":0.8782872,"about_ca_system_score_codex":0.000022690725,"about_ca_system_score_gemma":0.000022690347,"threshold_uncertainty_score":0.57563615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023033042,0.000005111017,0.95641065,0.00054673175,0.00035623592,0.00043423267,0.0000030436438,0.0001640173,0.039776668],"genre_scores_gemma":[0.9599599,0.0000023126347,0.026516102,0.00017188398,0.00043278307,0.00033413252,0.000004879116,0.000009266825,0.012568738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924207,0.000017429478,0.00015981492,0.00030537933,0.000093445014,0.00018186748],"domain_scores_gemma":[0.9984258,0.000045820198,0.000101655874,0.0012292564,0.00011546063,0.00008204098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002940484,0.00007631896,0.00010327619,0.00003492975,0.00060853316,0.0005915054,0.0009621301,0.000043640506,0.000025953377],"category_scores_gemma":[0.0000090188805,0.00006159139,0.000061948675,0.00003869745,0.000023547076,0.00023648707,0.00010853516,0.000030863543,0.00016554698],"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.000010124791,0.00022913133,0.0001293267,0.000027094728,0.000026858303,0.0000016342912,0.00080945157,0.002826228,0.0016968718,0.88650423,0.019310648,0.088428415],"study_design_scores_gemma":[0.00023789106,0.00008826618,0.0006447914,0.000010107171,0.0000029206255,0.000009516541,0.000016200094,0.93745387,0.00059127493,0.0013095649,0.059480436,0.0001551477],"about_ca_topic_score_codex":0.00009282451,"about_ca_topic_score_gemma":0.00002427374,"teacher_disagreement_score":0.9576566,"about_ca_system_score_codex":0.000020231357,"about_ca_system_score_gemma":0.000018492476,"threshold_uncertainty_score":0.57039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10505844,0.00046910025,0.78390354,0.00079905504,0.013029497,0.000075202806,2.6631992e-7,0.00007814933,0.096586764],"genre_scores_gemma":[0.9972488,0.000019415173,0.0008161555,0.00022356679,0.0008190061,1.3346813e-7,7.640398e-8,0.000012757318,0.00086003187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837536,0.00053529016,0.0005098082,0.000113471586,0.00029785768,0.00016820082],"domain_scores_gemma":[0.99850255,0.000080313286,0.0003391571,0.00027995842,0.00068162923,0.0001163874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017885797,0.0001002662,0.00020829476,0.00012922935,0.00011894088,0.0001790583,0.00089628086,0.000017411785,0.000017088909],"category_scores_gemma":[0.000102356826,0.0000776301,0.0001231973,0.00034364383,0.000045824276,0.00034271722,0.000100894365,0.00019214126,0.00015183988],"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.00023959413,0.00046812472,0.0017764381,0.000035198118,0.00026010367,0.0016026997,0.00551284,0.00011635121,0.0020200587,0.71016836,0.2398796,0.037920646],"study_design_scores_gemma":[0.008288798,0.0041817958,0.004991704,0.00029298678,0.000036044683,0.0034364348,0.0001820298,0.012441979,0.0017579399,0.012241415,0.95157266,0.00057622796],"about_ca_topic_score_codex":6.478482e-7,"about_ca_topic_score_gemma":2.2381614e-7,"teacher_disagreement_score":0.8921904,"about_ca_system_score_codex":0.00003459688,"about_ca_system_score_gemma":0.000037241734,"threshold_uncertainty_score":0.31656638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8540614,0.000008402578,0.14432587,0.00018390414,0.0011788442,0.00004393279,0.0000015559804,0.00001732083,0.00017878166],"genre_scores_gemma":[0.99842834,0.000013540838,0.00071772246,0.00006956742,0.00055996893,7.835461e-7,1.0898852e-7,0.000005123143,0.00020482132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991874,0.00006394501,0.00021617544,0.00014703567,0.00020742556,0.00017799047],"domain_scores_gemma":[0.999425,0.000040677252,0.00013798403,0.00013423695,0.00014809074,0.00011401411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023334607,0.00007712191,0.00014307036,0.00007135665,0.0001397281,0.00029619603,0.00028514824,0.000028906206,0.00000676473],"category_scores_gemma":[0.00001465203,0.000057688503,0.00005210878,0.00013598369,0.000066596636,0.0005235169,0.00012712467,0.000121457415,0.000021295093],"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.000114793525,0.00030309806,0.0014758996,0.000035433633,0.00024175856,0.000119317454,0.004811685,0.00035926796,0.91698253,0.03955731,0.006501271,0.029497646],"study_design_scores_gemma":[0.0027642266,0.003941514,0.012682411,0.00068296964,0.000043029962,0.0022500374,0.00073460647,0.49263445,0.47126535,0.0049168216,0.0068013906,0.0012831808],"about_ca_topic_score_codex":0.000029809094,"about_ca_topic_score_gemma":0.0000046120363,"teacher_disagreement_score":0.49227518,"about_ca_system_score_codex":0.000022234448,"about_ca_system_score_gemma":0.00002191859,"threshold_uncertainty_score":0.2856225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009368359,0.000038849375,0.9791973,0.0008249506,0.006221001,0.00037884468,0.0000028079971,0.0002647221,0.00370314],"genre_scores_gemma":[0.99271595,0.000007088142,0.0036139346,0.0012637874,0.0012126535,0.00018963662,0.0000017121403,0.0000133503745,0.0009818956],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985838,0.00006904029,0.00030501423,0.00040033564,0.00013291783,0.0005088768],"domain_scores_gemma":[0.99875015,0.00021973142,0.000115318384,0.0005495482,0.00027651645,0.00008872063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051633467,0.00014136336,0.00020097362,0.00010181134,0.0004392904,0.0006834579,0.0012910133,0.000091988186,0.000066714594],"category_scores_gemma":[0.00007097877,0.00012448104,0.00014032779,0.00032848262,0.000043683158,0.00094949326,0.00019664555,0.00009447081,0.000099463185],"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.00026429846,0.00032077232,0.00026694644,0.0001528788,0.00038413337,0.000019762341,0.006736041,0.001985435,0.0064096083,0.3312866,0.43764186,0.21453167],"study_design_scores_gemma":[0.0015461649,0.0010769849,0.00003741455,0.00014806638,0.00002268684,0.000050374467,0.00017873068,0.74972874,0.029254733,0.023715364,0.19360097,0.00063979236],"about_ca_topic_score_codex":0.00017563372,"about_ca_topic_score_gemma":0.0003831894,"teacher_disagreement_score":0.9833476,"about_ca_system_score_codex":0.000035560348,"about_ca_system_score_gemma":0.00003976636,"threshold_uncertainty_score":0.65906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44217002,0.00088681356,0.5561785,0.00008781435,0.00036070464,0.00009627046,5.0982965e-7,0.000016499347,0.00020282518],"genre_scores_gemma":[0.987684,0.00009844541,0.0118331695,0.00019382147,0.00017057874,0.000008584248,6.7844826e-7,0.0000055012247,0.000005208479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858004,0.00015248533,0.00043105285,0.0004410755,0.00015205774,0.00024330307],"domain_scores_gemma":[0.9987805,0.0004206591,0.0003237759,0.00016039549,0.00023747739,0.00007722995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005250817,0.00015396107,0.00022859736,0.000087903994,0.0002992766,0.00017726014,0.000186147,0.00007396328,0.0000017968059],"category_scores_gemma":[0.00016021715,0.000152912,0.000018503075,0.00035767953,0.00020302832,0.0013897128,0.0002323321,0.00018408906,4.9407697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058799563,0.00035967716,0.023648918,0.00016449636,0.000100896366,0.000100278034,0.24898669,0.026408246,0.00237703,0.07877268,0.00018399501,0.6183091],"study_design_scores_gemma":[0.00051704573,0.0003409561,0.0015028672,0.00022134143,0.000007430488,0.00016278443,0.0045515723,0.9918765,0.00014987642,0.00032751035,0.00016090617,0.00018121598],"about_ca_topic_score_codex":0.00020725385,"about_ca_topic_score_gemma":0.000039642273,"teacher_disagreement_score":0.9654682,"about_ca_system_score_codex":0.000018901537,"about_ca_system_score_gemma":0.000045744062,"threshold_uncertainty_score":0.62355703},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.950701e-8,0.00019527889,0.49383995,0.000014897479,0.00396604,0.00007868074,2.0186161e-7,0.00064584066,0.5012591],"genre_scores_gemma":[0.0023677438,0.00007001293,0.0031666267,0.0003048508,0.0012676963,0.000022107115,0.0000023935293,0.00017229185,0.99262625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990155,0.000060962902,0.00019641951,0.00040345796,0.00009888998,0.00022474973],"domain_scores_gemma":[0.9991036,0.000016062553,0.00015003259,0.00063873536,0.00002630944,0.00006526319],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013567107,0.0002038746,0.00023069844,0.00022020793,0.000032296954,0.0001073789,0.0006756799,0.00033297724,0.005816626],"category_scores_gemma":[0.0000040610134,0.00016710303,0.000111371504,0.00017405846,0.000015795484,0.000097921315,0.00015266631,0.00019112951,0.0011125352],"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":[5.4909515e-7,0.000009597822,0.0000041232806,0.0000057769116,0.000029315563,0.0000036163706,0.000023043249,0.000009465718,2.1057409e-7,0.091152705,0.90261436,0.006147222],"study_design_scores_gemma":[0.00007293868,0.00004030156,0.0000030819808,0.00011026468,0.0000036537483,0.000030598727,0.000006612223,0.035803746,0.0000037878615,0.00028660594,0.96340805,0.00023033329],"about_ca_topic_score_codex":0.0005315916,"about_ca_topic_score_gemma":0.00063099246,"teacher_disagreement_score":0.49136722,"about_ca_system_score_codex":0.000025435123,"about_ca_system_score_gemma":0.000013012258,"threshold_uncertainty_score":0.9996652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07355288,0.00009085909,0.89292246,0.0002658103,0.012346328,0.0020928462,0.0005000368,0.00030970635,0.017919097],"genre_scores_gemma":[0.96600443,0.000079556696,0.030206526,0.0005878789,0.0009984105,0.0003223894,0.0007926508,0.000065561006,0.0009426015],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959201,0.00009165516,0.0022680166,0.00048828445,0.0005923304,0.0006395786],"domain_scores_gemma":[0.9951815,0.0001338377,0.0018067342,0.001671071,0.0010302924,0.00017657058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011011777,0.0005636107,0.00086732185,0.0005531443,0.00023893362,0.0005853044,0.0021243047,0.00072318834,0.000052371226],"category_scores_gemma":[0.000081350765,0.0005159571,0.000645683,0.00032585592,0.00015171996,0.0010877845,0.00096875295,0.0006651497,0.0001073358],"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.00078834913,0.0022254956,0.009010551,0.021979732,0.0044860165,0.000024045075,0.1315372,0.009950743,0.000410476,0.25486776,0.4399827,0.12473693],"study_design_scores_gemma":[0.0039636805,0.0013436094,0.00084830436,0.0031409569,0.0001653938,0.0001854167,0.0016667729,0.79687536,0.0069315303,0.022657938,0.1595735,0.002647514],"about_ca_topic_score_codex":0.00006963131,"about_ca_topic_score_gemma":0.000050388346,"teacher_disagreement_score":0.8924515,"about_ca_system_score_codex":0.00013765268,"about_ca_system_score_gemma":0.00017139784,"threshold_uncertainty_score":0.9997292},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020009119,0.000048061775,0.97988975,0.00045536776,0.012334132,0.00044353303,0.000004405695,0.00021100082,0.00641366],"genre_scores_gemma":[0.9594378,0.000011003999,0.025639705,0.009751916,0.003618792,0.00004075113,0.00001606882,0.00007128495,0.0014127011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996069,0.000071914306,0.00054667256,0.0017188878,0.0009552448,0.0006382628],"domain_scores_gemma":[0.9972415,0.00034814497,0.00034882268,0.0015407001,0.00035184165,0.00016899494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010187466,0.0005623261,0.00044095324,0.0009483214,0.00043785005,0.00090566935,0.0015138563,0.00043531056,0.00013045347],"category_scores_gemma":[0.000048405494,0.00048206223,0.00022390319,0.00060123147,0.00045363724,0.00043961784,0.0002435055,0.0008675118,0.00020609141],"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.00033426422,0.0003131799,0.00003059237,0.00009197681,0.000049796072,0.00011595456,0.000696103,0.18374658,0.0005206987,0.048309464,0.002536323,0.76325506],"study_design_scores_gemma":[0.00037790675,0.0022887897,0.00003823111,0.00064485834,0.0000071189756,0.000018401668,1.3082898e-7,0.94528294,0.00051414315,0.042788386,0.0074376944,0.00060141593],"about_ca_topic_score_codex":0.000021360036,"about_ca_topic_score_gemma":0.0000776953,"teacher_disagreement_score":0.9592377,"about_ca_system_score_codex":0.00035773,"about_ca_system_score_gemma":0.00027132808,"threshold_uncertainty_score":0.99976313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005985406,0.0000332463,0.98692244,0.0022240477,0.0017955543,0.00038872985,0.000002287636,0.00014003634,0.002508234],"genre_scores_gemma":[0.9873884,0.0000033452088,0.010340827,0.00096823805,0.00042871916,0.000118514894,0.00002777096,0.000008783394,0.00071542745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913037,0.000105485604,0.00026300666,0.00022019829,0.00012070806,0.00016023843],"domain_scores_gemma":[0.9987694,0.00013348037,0.0001202435,0.0004995433,0.00044106014,0.000036279896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046319072,0.00010198964,0.00010701827,0.00008632953,0.0002249979,0.00022627058,0.0004038854,0.000089534245,0.00002202172],"category_scores_gemma":[0.000064807275,0.000083737104,0.00007393694,0.00018212892,0.000036981546,0.00043533187,0.000018830116,0.00008069648,0.000083229206],"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.00025736573,0.00046986286,0.0002160618,0.00011406935,0.000091352464,0.000001489327,0.017352777,0.0051875543,0.023120109,0.5454285,0.1591256,0.24863525],"study_design_scores_gemma":[0.00040191473,0.00025380467,0.00004863688,0.000114949005,0.0000037147024,0.0000041703347,0.000071155504,0.94438434,0.037375662,0.0049801255,0.012217235,0.0001443193],"about_ca_topic_score_codex":0.00007702119,"about_ca_topic_score_gemma":0.00022321062,"teacher_disagreement_score":0.981403,"about_ca_system_score_codex":0.000056662444,"about_ca_system_score_gemma":0.000033191413,"threshold_uncertainty_score":0.34147},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965064,0.000109662455,0.025792457,0.0007337204,0.0075297225,0.00038539077,0.0000028422926,0.000013937264,0.00036828252],"genre_scores_gemma":[0.9992307,0.000012108768,0.00035243898,0.000088415574,0.00028960273,0.0000055358337,5.1340317e-7,0.000014870978,0.000005855431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975255,0.00033119402,0.0010908056,0.00017019463,0.00066512654,0.00021719524],"domain_scores_gemma":[0.99561316,0.0020441853,0.0012545979,0.00036515252,0.0006467711,0.00007611574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644492,0.00022157183,0.0005661562,0.00012572264,0.00025914033,0.00026694965,0.00079955603,0.000112507005,0.000013792039],"category_scores_gemma":[0.00018062662,0.00012305712,0.00023054432,0.00038526117,0.00010785618,0.00018929578,0.000061814935,0.00037205548,0.0000016152817],"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.000036509926,0.00040303383,0.000024765792,0.000045081455,0.000109991306,0.0000014596002,0.0014674773,0.000120538556,0.005626396,0.9897985,0.001962066,0.00040421233],"study_design_scores_gemma":[0.00224095,0.0022331795,0.000122008714,0.00084917515,0.000053766136,0.000033226224,0.00038733968,0.06017605,0.022457544,0.9111002,0.00009588222,0.00025067935],"about_ca_topic_score_codex":0.000039100363,"about_ca_topic_score_gemma":5.9565247e-7,"teacher_disagreement_score":0.07869827,"about_ca_system_score_codex":0.0000332772,"about_ca_system_score_gemma":0.000047885413,"threshold_uncertainty_score":0.5018124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051971365,0.00019493308,0.94357353,0.00002819698,0.003189281,0.0003193949,0.0000022287786,0.00014981581,0.0005712342],"genre_scores_gemma":[0.9811067,0.0000011971875,0.016229777,0.00020933265,0.0015796801,0.000029449999,0.0000027901103,0.000012535112,0.0008285624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983852,0.00009237174,0.0004111724,0.0004545349,0.00018437677,0.00047237764],"domain_scores_gemma":[0.99872154,0.00010748766,0.0001426447,0.0005793093,0.000333459,0.000115556744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004760265,0.00016114481,0.00033144254,0.00012988847,0.00043363974,0.0005097666,0.00047766196,0.000102308506,0.00002139302],"category_scores_gemma":[0.00001315977,0.00013051699,0.0002626898,0.0008191398,0.000044611283,0.00019579839,0.000109630026,0.000051159903,0.000026050287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022064825,0.000041677707,0.0026041525,0.000026256019,0.0011829588,0.000017206215,0.00048480002,0.9469073,0.0001441419,0.043261256,0.004104142,0.0012040766],"study_design_scores_gemma":[0.00016611035,0.00010632131,0.00004192341,0.00001600219,0.00008742691,0.000069433576,0.000025312183,0.992411,0.000077614975,0.00007831004,0.0067379246,0.0001825873],"about_ca_topic_score_codex":0.00066267553,"about_ca_topic_score_gemma":0.000629601,"teacher_disagreement_score":0.9291353,"about_ca_system_score_codex":0.00008881189,"about_ca_system_score_gemma":0.00003207405,"threshold_uncertainty_score":0.5322328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005137313,0.00026279048,0.98996335,0.000064063854,0.0027933149,0.0012032317,0.00004105249,0.00023020667,0.00030469443],"genre_scores_gemma":[0.9865086,0.000047777874,0.012626108,0.000113764545,0.00014285053,0.0001639731,0.000005435065,0.000034222983,0.00035728747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974884,0.00028490883,0.00087585964,0.00062113383,0.0003243771,0.0004053564],"domain_scores_gemma":[0.99707943,0.00041216132,0.0004166479,0.0008503611,0.0010935998,0.00014782346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084615796,0.00036888596,0.0005946836,0.0003707804,0.000519351,0.00037163356,0.00087800436,0.0002797625,0.000016159373],"category_scores_gemma":[0.000010909736,0.00030733697,0.0001391498,0.00065690547,0.0001576312,0.0005116806,0.0000070360184,0.00031877338,0.0000101362075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000526617,0.0010842477,0.00006578599,0.001185464,0.0014814134,0.00001622539,0.015481568,0.455014,0.024981696,0.14170377,0.026785493,0.3316737],"study_design_scores_gemma":[0.0008651355,0.0017846513,0.000025937225,0.0006645521,0.000029323626,0.00013551628,0.00039871054,0.986974,0.0052986653,0.0008775549,0.0025717614,0.0003741652],"about_ca_topic_score_codex":0.00018712788,"about_ca_topic_score_gemma":0.00001581678,"teacher_disagreement_score":0.9813713,"about_ca_system_score_codex":0.00011853236,"about_ca_system_score_gemma":0.00016770372,"threshold_uncertainty_score":0.9999379},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8966175,0.0012177385,0.06477053,0.0012545404,0.019247942,0.0002752631,0.0000023899693,0.00030998368,0.016304163],"genre_scores_gemma":[0.99848384,0.0000144920705,0.0012878046,0.000111557994,0.000019362184,0.000007737048,5.4923095e-7,0.000008481851,0.000066178545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879813,0.000055578326,0.00031696775,0.00027564156,0.00028667998,0.00026699682],"domain_scores_gemma":[0.9989696,0.0001724753,0.00005997191,0.0004926562,0.00020338669,0.00010191978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031821258,0.000115526826,0.00022764935,0.000280312,0.00008797043,0.0000688589,0.0006193571,0.00008810491,0.000016948316],"category_scores_gemma":[0.0001488632,0.00010816987,0.00011783627,0.0013565647,0.00007011801,0.00030930722,0.000117387084,0.000139841,0.00007065902],"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.0000019891695,0.00012477889,0.00062530756,0.0000141854825,0.00001122893,0.000009218114,0.00018697459,0.000042739626,0.00021214575,0.99718094,0.0007448583,0.0008456304],"study_design_scores_gemma":[0.0011227061,0.00041821212,0.0027421683,0.00008421046,0.000009627896,0.00007484209,0.00006335602,0.0020497735,0.00472431,0.9862057,0.0022143614,0.00029075524],"about_ca_topic_score_codex":0.00008375756,"about_ca_topic_score_gemma":0.000003120401,"teacher_disagreement_score":0.10186639,"about_ca_system_score_codex":0.000055551947,"about_ca_system_score_gemma":0.000058693295,"threshold_uncertainty_score":0.44110394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014237583,0.000015589198,0.9824837,0.0012492952,0.0008752523,0.0006185965,0.0000127691665,0.00019741325,0.00030981316],"genre_scores_gemma":[0.9126739,9.708281e-7,0.0847545,0.0008755583,0.0011882199,0.00027825433,0.000013726492,0.0000072421976,0.00020765937],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991293,0.000021350488,0.00019280674,0.0003145941,0.00012170345,0.00022025782],"domain_scores_gemma":[0.9992461,0.000030648996,0.000062528154,0.00026908016,0.00032908592,0.000062514606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002472125,0.00011280446,0.00010621385,0.00003295271,0.00017028849,0.000120710676,0.00033583943,0.00009100383,0.000006934509],"category_scores_gemma":[0.000029623478,0.00008889247,0.00005518893,0.00022338913,0.000015047217,0.000297475,0.00005143147,0.000047128226,0.000022334543],"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.0007039444,0.0010111193,0.00089113036,0.00021811666,0.00020228955,0.000010364052,0.016060377,0.01238422,0.45497563,0.24597952,0.047222957,0.22034033],"study_design_scores_gemma":[0.0004118832,0.00066001096,0.00028486975,0.000049315175,0.0000043524487,0.00010577226,0.0000850612,0.782889,0.08619334,0.00014188694,0.1288343,0.00034021094],"about_ca_topic_score_codex":0.000049838785,"about_ca_topic_score_gemma":0.0001598651,"teacher_disagreement_score":0.8984363,"about_ca_system_score_codex":0.000048773625,"about_ca_system_score_gemma":0.000018891893,"threshold_uncertainty_score":0.36249298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58090353,0.000014136063,0.3874746,0.013248286,0.0011737125,0.00042395244,0.000008450557,0.00006985713,0.016683467],"genre_scores_gemma":[0.99334174,0.0000026305247,0.00468878,0.00076595036,0.0003194072,0.000053791715,0.0000042087536,0.0000073206475,0.0008161794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984187,0.00032740014,0.00022861382,0.00026988136,0.00048366864,0.00027175524],"domain_scores_gemma":[0.99865943,0.00017015543,0.000015547148,0.0005556268,0.0005263021,0.00007293991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781027,0.00007288215,0.00009865221,0.0003158008,0.0005765646,0.0002380459,0.0005686752,0.000035365792,0.00018883937],"category_scores_gemma":[0.00017087364,0.00006239822,0.000043887478,0.00078227994,0.00020149608,0.000389108,0.00009913093,0.0001747661,0.00037742427],"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.000018116727,0.00016901629,0.000138392,0.000011644297,0.000047801193,0.000009631578,0.0044686305,0.009510938,0.0979623,0.7409645,0.14051783,0.0061812373],"study_design_scores_gemma":[0.0016407379,0.002826733,0.0059226975,0.00034480263,0.000009333933,0.000071163384,0.0014710637,0.8613174,0.05089345,0.0024397208,0.07224687,0.0008160401],"about_ca_topic_score_codex":0.00028945124,"about_ca_topic_score_gemma":0.00046939548,"teacher_disagreement_score":0.85180646,"about_ca_system_score_codex":0.000063295505,"about_ca_system_score_gemma":0.0000791813,"threshold_uncertainty_score":0.4851151},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07398988,0.000023256858,0.8736231,0.00023355804,0.0007714455,0.00010010134,0.000002007491,0.00014684773,0.05110981],"genre_scores_gemma":[0.97312087,9.381119e-7,0.024902334,0.00011596654,0.00022312206,0.000007868292,2.1141528e-7,0.000007488234,0.0016211879],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907684,0.00006886121,0.00021145237,0.00024670747,0.00020596449,0.00019016962],"domain_scores_gemma":[0.99912906,0.00012771363,0.00011759685,0.00039539332,0.00018172513,0.000048497823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029211628,0.00009966102,0.00020021592,0.00009389639,0.00010726618,0.000096137876,0.00042047192,0.000051895415,0.000112381764],"category_scores_gemma":[0.000025423064,0.00006699811,0.00003692286,0.00031435053,0.00007767948,0.00029043222,0.00008320072,0.000055303266,0.000048784357],"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.00017827527,0.00041914935,0.009326008,0.00021091678,0.0005858557,0.000059730544,0.0056278678,0.00051469094,0.008387481,0.44548362,0.055987827,0.4732186],"study_design_scores_gemma":[0.0013229001,0.0015726803,0.02419135,0.0017577998,0.00006283186,0.0003610733,0.00068458467,0.1746211,0.7775187,0.0019788381,0.01451658,0.0014115844],"about_ca_topic_score_codex":0.00029031053,"about_ca_topic_score_gemma":0.00024007146,"teacher_disagreement_score":0.899131,"about_ca_system_score_codex":0.000019591444,"about_ca_system_score_gemma":0.00004349953,"threshold_uncertainty_score":0.27321035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6804181,0.00032551278,0.30604184,0.0002619373,0.001100391,0.0025250548,0.00030692486,0.00057486916,0.008445391],"genre_scores_gemma":[0.9713809,0.00012404493,0.027626282,0.00013795645,0.00012942577,0.00028868846,0.00009765576,0.00014999874,0.00006503058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924014,0.00040296855,0.0027627416,0.002275734,0.0011615815,0.0009955728],"domain_scores_gemma":[0.9906841,0.0022713682,0.0031176435,0.0026764206,0.0007675575,0.00048291945],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0016657496,0.0014643314,0.0034322233,0.0007345339,0.00028744762,0.00038022766,0.0024869496,0.0010847131,0.000065344306],"category_scores_gemma":[0.00067841436,0.0014255596,0.000937885,0.0012935903,0.0005544913,0.00038161423,0.0029123102,0.0015101427,0.000018858984],"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.00039205438,0.0010532081,0.000396918,0.0088212965,0.001816022,0.000079001155,0.018110175,0.0016527579,0.06987817,0.89442855,0.0011110457,0.0022608144],"study_design_scores_gemma":[0.0051408806,0.0012205167,0.0035525789,0.0028287398,0.0006499427,0.00015972994,0.0018132825,0.3100803,0.074194424,0.59586316,0.0002552603,0.0042411895],"about_ca_topic_score_codex":0.00014086593,"about_ca_topic_score_gemma":0.0001227782,"teacher_disagreement_score":0.30842754,"about_ca_system_score_codex":0.00012355203,"about_ca_system_score_gemma":0.0003987651,"threshold_uncertainty_score":0.99981064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007116858,0.000027951228,0.94004595,0.00033179045,0.0035499064,0.00030030092,9.966975e-7,0.0003009518,0.054730445],"genre_scores_gemma":[0.9103397,0.000005555007,0.037167303,0.0031599174,0.0018628915,0.00009037048,0.0000032913904,0.00002087411,0.0473501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988346,0.000028980789,0.00025023357,0.00039539393,0.000105527026,0.00038526143],"domain_scores_gemma":[0.99902546,0.00012366596,0.00007767781,0.0004945408,0.00019030727,0.00008833477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042439805,0.00013696848,0.00016865513,0.00006246049,0.00029778195,0.00019776476,0.0004798907,0.00010751527,0.000144631],"category_scores_gemma":[0.000025185,0.000107931744,0.000107061256,0.00020327292,0.000035814435,0.00021152425,0.00003817481,0.000099474186,0.000254652],"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.000047132893,0.00012032283,0.00017033001,0.000015355894,0.000049365255,0.0000020619668,0.0004633343,0.0036181058,0.00016035576,0.63130504,0.3190773,0.044971295],"study_design_scores_gemma":[0.00042371327,0.00036837332,0.000064343934,0.00003139542,0.0000018367506,0.000009458578,0.000029526218,0.91230357,0.0017728762,0.0014589693,0.083367236,0.00016869372],"about_ca_topic_score_codex":0.000057952137,"about_ca_topic_score_gemma":0.00010551945,"teacher_disagreement_score":0.90962803,"about_ca_system_score_codex":0.000037325022,"about_ca_system_score_gemma":0.000030978044,"threshold_uncertainty_score":0.4401329},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007088941,0.00008661857,0.98642987,0.00044344005,0.0034038487,0.00091716216,0.0012095538,0.00020579307,0.00021476338],"genre_scores_gemma":[0.9960146,0.000007832035,0.0025162736,0.00015998649,0.00064391753,0.00018844468,0.00015189598,0.00001758336,0.0002994518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753827,0.00021192046,0.0005459397,0.0008761119,0.00026532423,0.0005624355],"domain_scores_gemma":[0.9981547,0.00013159701,0.00013243889,0.0011987517,0.00017536561,0.00020713713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066329446,0.00029367264,0.00038844734,0.00007620599,0.0006808884,0.0004241073,0.0007732687,0.00017272093,0.000017888868],"category_scores_gemma":[0.000005815027,0.00023530932,0.00011106791,0.00032667644,0.000113464164,0.000417516,0.000022291082,0.00019880559,0.00003845758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023924487,0.001830929,0.0041335644,0.0009133784,0.0014731998,0.000034875236,0.0016405417,0.71102214,0.00065859675,0.008447141,0.2446009,0.022852296],"study_design_scores_gemma":[0.002232895,0.0006756337,0.0003195624,0.00021258951,0.000046446985,0.00018636895,0.00009275429,0.9344083,0.00011444826,0.00036085615,0.06081812,0.0005319894],"about_ca_topic_score_codex":0.00024384791,"about_ca_topic_score_gemma":0.00023852507,"teacher_disagreement_score":0.9889257,"about_ca_system_score_codex":0.00007955854,"about_ca_system_score_gemma":0.000039543105,"threshold_uncertainty_score":0.95956355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00625764,0.000014149276,0.93867856,0.000048131824,0.00041501503,0.00014900701,0.0000010946943,0.000086613116,0.054349788],"genre_scores_gemma":[0.5663538,0.000003524708,0.43323997,0.00003895613,0.00015468623,0.000007448867,9.632151e-7,0.000008977382,0.00019168791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991335,0.0000082861925,0.00033222037,0.00018050587,0.0001892855,0.00015617139],"domain_scores_gemma":[0.9991765,0.00004096986,0.00019968057,0.000445459,0.00007356277,0.00006383639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015551287,0.00010562246,0.00019770215,0.00007514656,0.00006671435,0.00005890939,0.00035966182,0.00005682812,0.000053072472],"category_scores_gemma":[0.000008127525,0.00008799268,0.00006390063,0.0002954271,0.00008017605,0.000101798934,0.000089342786,0.000057683395,0.00006955439],"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.0000026395348,0.000010949908,0.000006295983,0.000030570383,0.00001728438,2.782566e-7,0.0016505575,0.000004464436,0.0020282646,0.98128295,0.001555185,0.013410589],"study_design_scores_gemma":[0.0009812615,0.0002856263,0.000055592533,0.00021622232,0.000037838843,0.000153657,0.0018623901,0.09144967,0.043920077,0.85032254,0.0101441275,0.00057096215],"about_ca_topic_score_codex":0.000013133685,"about_ca_topic_score_gemma":0.0000043496907,"teacher_disagreement_score":0.56009614,"about_ca_system_score_codex":0.000010755676,"about_ca_system_score_gemma":0.000030323994,"threshold_uncertainty_score":0.35882372},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018395497,0.000008219713,0.9767438,0.000078866484,0.0005570022,0.0004536337,1.628957e-7,0.00010372038,0.0036590528],"genre_scores_gemma":[0.6022128,2.718984e-7,0.39760426,0.0000806829,0.00006826314,0.000017833918,1.1155758e-7,0.0000055314345,0.000010252154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744004,0.00013183705,0.00039043743,0.00085298,0.00053390214,0.00065083243],"domain_scores_gemma":[0.9983871,0.00022652818,0.00023308948,0.0008187951,0.00021833663,0.00011617427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032972645,0.00016246208,0.00026264283,0.00012612893,0.0005602724,0.0001848313,0.00095320964,0.00009464514,0.0000038015696],"category_scores_gemma":[0.00012409344,0.00013823387,0.000049891998,0.0010900352,0.0009569948,0.0003560884,0.00034209405,0.00021526136,0.000009409956],"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.00021514109,0.0004981836,0.00014731569,0.000057171703,0.000020463076,0.000007295665,0.004606983,0.28749043,0.05376264,0.6053584,0.00017250556,0.047663458],"study_design_scores_gemma":[0.00012718505,0.00016720008,0.000044950964,0.000019174218,0.0000036650918,0.00003954717,0.000050968374,0.97485924,0.00086003204,0.023631696,0.000050753224,0.00014559142],"about_ca_topic_score_codex":0.000022095395,"about_ca_topic_score_gemma":0.0000034828306,"teacher_disagreement_score":0.6873688,"about_ca_system_score_codex":0.00017366408,"about_ca_system_score_gemma":0.0002621219,"threshold_uncertainty_score":0.56370133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007175365,0.00000920823,0.98219323,0.00055367016,0.00047371315,0.00006498337,2.5461918e-7,0.00009929134,0.00943026],"genre_scores_gemma":[0.9750766,7.1780335e-7,0.023395488,0.0005362514,0.00012949445,0.00000954011,1.8351506e-7,0.0000025419308,0.0008491796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951816,0.000042546115,0.000106369516,0.00017117895,0.000068385976,0.00009337852],"domain_scores_gemma":[0.9995788,0.000087476605,0.000029996221,0.00018004801,0.000085234846,0.00003846843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018378253,0.000052783387,0.00006548007,0.000038271286,0.000098524404,0.00013271491,0.00012856917,0.0000335888,0.00008341448],"category_scores_gemma":[0.000029648807,0.000040886276,0.000017818245,0.00008054971,0.00002854957,0.00016970027,0.000022134336,0.00002457503,0.00010444593],"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.000076055505,0.0006336841,0.0040853443,0.00012269699,0.00014816252,0.000031335905,0.004976569,0.00063408964,0.052576777,0.49884838,0.07528912,0.36257777],"study_design_scores_gemma":[0.00014543421,0.00004815689,0.00074574066,0.000013302701,0.0000013752352,0.0000056642325,0.00002317518,0.96719277,0.025790596,0.000038726914,0.005921518,0.00007356146],"about_ca_topic_score_codex":0.000066378474,"about_ca_topic_score_gemma":0.000102461185,"teacher_disagreement_score":0.96790123,"about_ca_system_score_codex":0.000009182151,"about_ca_system_score_gemma":0.0000127323,"threshold_uncertainty_score":0.16672939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011718301,0.000010251157,0.97865814,0.0003813114,0.00069930643,0.0001995168,3.2712182e-7,0.00012555285,0.018753784],"genre_scores_gemma":[0.90963125,0.0000010808648,0.08538276,0.00057662174,0.00040243674,0.000016793501,2.7218442e-7,0.000004344901,0.0039844234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994072,0.000052415104,0.00012041933,0.00019272233,0.00006806967,0.00015920428],"domain_scores_gemma":[0.99938107,0.00013290581,0.000033853248,0.0001900496,0.00022586029,0.000036268262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029699333,0.000062145824,0.00008126371,0.00003813966,0.00012079312,0.00008825123,0.00019850783,0.000036840003,0.000023949025],"category_scores_gemma":[0.000023881312,0.000046997982,0.00004025245,0.00010787626,0.000024450546,0.00016727444,0.000040658833,0.000025133459,0.000116567455],"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.00002646878,0.00003849119,0.000050020783,0.000008183331,0.00003849413,0.0000047737913,0.002227156,0.00023304563,0.0012345251,0.8544948,0.11438061,0.027263444],"study_design_scores_gemma":[0.0003045473,0.00052610197,0.0002023399,0.000025981695,0.0000028088186,0.000030223624,0.00015982118,0.9509785,0.014837574,0.010223584,0.022521712,0.00018677115],"about_ca_topic_score_codex":0.000031887303,"about_ca_topic_score_gemma":0.000022557762,"teacher_disagreement_score":0.95074546,"about_ca_system_score_codex":0.0000142526915,"about_ca_system_score_gemma":0.000021170934,"threshold_uncertainty_score":0.19165221},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021040058,0.000010491849,0.9844509,0.0010857385,0.0018416268,0.00019796148,5.7791215e-7,0.00027885564,0.0100298645],"genre_scores_gemma":[0.8609704,0.0000014801383,0.13720334,0.0005880783,0.00036812248,0.000087963555,6.4376195e-7,0.000007260583,0.0007727599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991972,0.00006576678,0.00022728284,0.0002465473,0.00006506864,0.00019817686],"domain_scores_gemma":[0.9991156,0.00030981904,0.00006626936,0.0003152177,0.00015243609,0.00004066101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003193425,0.000085694504,0.0001436914,0.00008749685,0.0001368586,0.00011335606,0.0003947817,0.000066028595,0.0007032756],"category_scores_gemma":[0.00014537974,0.00006888609,0.000066826455,0.00014752251,0.000039635226,0.00025620908,0.00006980234,0.000028470702,0.00008742174],"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.000017367793,0.000087850145,0.00005458219,0.00006283865,0.00010252667,0.0000023956718,0.0015974934,0.0043732473,0.00015263598,0.5811569,0.045330845,0.36706132],"study_design_scores_gemma":[0.00009914275,0.00016494443,0.000008753274,0.000020618329,0.0000039213114,0.00002174615,0.00005860838,0.99153566,0.002377386,0.0011786423,0.004433536,0.00009706695],"about_ca_topic_score_codex":0.000027855423,"about_ca_topic_score_gemma":0.000046728368,"teacher_disagreement_score":0.9871624,"about_ca_system_score_codex":0.00003219666,"about_ca_system_score_gemma":0.00001971285,"threshold_uncertainty_score":0.7700375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58123446,0.0000011915845,0.4172172,0.000017440823,0.00020519781,0.00010730542,2.3330674e-7,0.000022558577,0.0011944228],"genre_scores_gemma":[0.99649745,2.1546867e-8,0.0033311576,0.00003496013,0.00007215051,0.0000143313455,1.6297898e-7,0.0000025021352,0.000047286645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925584,0.00007786763,0.00028703533,0.00014614822,0.0001495772,0.00008354493],"domain_scores_gemma":[0.9991815,0.000066457316,0.00014911073,0.00024672734,0.00033218562,0.00002401304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031995922,0.000049871313,0.0001122376,0.00006341896,0.000080242884,0.000027194379,0.00016733225,0.000022686188,0.000049324623],"category_scores_gemma":[0.000014850515,0.000040713323,0.00002291842,0.00030147456,0.000021897502,0.00013773932,0.000022548838,0.000026762782,0.0000039341676],"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.00021463618,0.01017395,0.10340872,0.00067749247,0.0006428471,0.0013867865,0.39104295,0.0658696,0.0051868274,0.40659255,0.0045793955,0.010224238],"study_design_scores_gemma":[0.001782197,0.0025367572,0.0015594877,0.00007843698,0.00001447095,0.00037997533,0.011151358,0.97375065,0.0061772945,0.0022421384,0.000095623414,0.00023161486],"about_ca_topic_score_codex":0.0007104325,"about_ca_topic_score_gemma":0.0005142897,"teacher_disagreement_score":0.907881,"about_ca_system_score_codex":0.000009352521,"about_ca_system_score_gemma":0.000039066406,"threshold_uncertainty_score":0.16602412},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57890755,0.0000043249624,0.39910394,0.000430269,0.00047134946,0.00012722304,3.8089718e-7,0.00018319699,0.02077175],"genre_scores_gemma":[0.99670076,2.9186702e-7,0.0015587592,0.0010464974,0.00041276854,0.0000083865825,3.5595806e-7,0.000008092812,0.00026406985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891114,0.00008647752,0.00015727499,0.00033652343,0.00025420726,0.0002543533],"domain_scores_gemma":[0.9990044,0.00010988343,0.000053681102,0.0006317043,0.00014020446,0.000060118648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054455746,0.00011969852,0.000101655416,0.00003221056,0.0003757027,0.00027897907,0.00057932595,0.000036213176,0.000043681946],"category_scores_gemma":[0.000014556196,0.00005810018,0.000032402615,0.0002370016,0.00005924165,0.00009927062,0.000062935185,0.00010766655,0.00008661126],"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.0000420842,0.00046577444,0.007460111,0.0000042727343,0.000063479776,0.00003194295,0.008680597,0.048840567,0.0016346168,0.9066555,0.00461825,0.021502813],"study_design_scores_gemma":[0.00008690906,0.00043605047,0.0017854905,0.000047271515,0.0000022456888,0.000041249114,0.00035724402,0.99513423,0.0010415855,0.000035820012,0.0009013088,0.00013056793],"about_ca_topic_score_codex":0.00011477957,"about_ca_topic_score_gemma":0.00008693052,"teacher_disagreement_score":0.9462937,"about_ca_system_score_codex":0.000027093014,"about_ca_system_score_gemma":0.000022027074,"threshold_uncertainty_score":0.2889639},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13418435,0.000022832299,0.8579945,0.0017556876,0.003965657,0.0004462971,0.0000060387692,0.00034232592,0.0012823391],"genre_scores_gemma":[0.94049656,0.0000014955359,0.053199623,0.0010642777,0.0040043695,0.00002812986,0.0000038480343,0.000015587491,0.0011861104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981401,0.000097064076,0.00036694013,0.00059080974,0.00023132864,0.0005737448],"domain_scores_gemma":[0.9985364,0.00018968372,0.00014030466,0.0007123367,0.00028103177,0.00014022233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067388534,0.00023151207,0.00033069236,0.00006176386,0.0003850522,0.00027089927,0.00076647836,0.00010743219,0.00006064784],"category_scores_gemma":[0.00004841677,0.00017978097,0.00013567995,0.00028697102,0.00012699682,0.00024313235,0.00017675833,0.00019595124,0.00006966857],"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.00011384349,0.00013055615,0.00073241396,0.00007214909,0.00016607197,0.000008342742,0.0013609328,0.0032072999,0.0012353542,0.8412534,0.12493752,0.026782122],"study_design_scores_gemma":[0.003066708,0.0023104239,0.0045005414,0.00025579927,0.000051369545,0.00034913313,0.0000896701,0.37158313,0.043304592,0.38044757,0.19200027,0.0020408023],"about_ca_topic_score_codex":0.0017509153,"about_ca_topic_score_gemma":0.0017556951,"teacher_disagreement_score":0.8063122,"about_ca_system_score_codex":0.00006582864,"about_ca_system_score_gemma":0.000055801473,"threshold_uncertainty_score":0.7331255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047886028,0.000051834475,0.9845026,0.00006954271,0.0004719855,0.0018694514,0.00001080955,0.0013393223,0.011205587],"genre_scores_gemma":[0.5729601,7.748363e-7,0.42603263,0.0001699893,0.00016074193,0.00040481234,0.0000294608,0.000020989659,0.0002205256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983003,0.000044550798,0.00038502883,0.00073905423,0.00017082329,0.00036021724],"domain_scores_gemma":[0.99861425,0.00017851246,0.00019218911,0.00065139437,0.0002817111,0.0000819168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030944642,0.00026509646,0.0003316863,0.00023273301,0.00011637579,0.00058209547,0.00084945647,0.00014822313,7.155174e-7],"category_scores_gemma":[0.000011908504,0.0002519923,0.00020695709,0.00043259992,0.000038967522,0.00085448753,0.00022551007,0.00015148282,0.00003498443],"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.000067297486,0.0012430815,0.0012854586,0.0005041619,0.00017456533,0.0000036754682,0.0024961336,0.0018609097,0.0021330665,0.050317764,0.01949611,0.9204178],"study_design_scores_gemma":[0.0003847005,0.0002250906,0.00007247584,0.00009907991,0.0000029466978,0.000018313152,0.00004251816,0.96215576,0.0018651583,0.0006962308,0.034081895,0.0003558164],"about_ca_topic_score_codex":0.000011823448,"about_ca_topic_score_gemma":0.0000012779461,"teacher_disagreement_score":0.96029484,"about_ca_system_score_codex":0.00014773331,"about_ca_system_score_gemma":0.000058129866,"threshold_uncertainty_score":0.9999932},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01136388,0.000031156218,0.97312474,0.00093605707,0.0013119373,0.00053384295,0.0000012643598,0.00015365012,0.012543486],"genre_scores_gemma":[0.9604291,7.889213e-7,0.02551341,0.0011791795,0.0003850866,0.000056770332,0.0000012589052,0.000012727065,0.012421731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885917,0.000036802594,0.00023837648,0.00037586066,0.00017447038,0.00031532056],"domain_scores_gemma":[0.99912596,0.00016978936,0.00007895919,0.000444829,0.00010968525,0.00007075249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023901032,0.00014592607,0.00024056906,0.000061806546,0.000089653266,0.00020633763,0.00040944546,0.000063518055,0.000058335823],"category_scores_gemma":[0.00000624136,0.0000945945,0.00008820526,0.00013342213,0.000009049288,0.0003683798,0.000034844557,0.000072679635,0.00020656864],"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.0008466091,0.00049478497,0.00881393,0.0005147992,0.0010250902,0.00006978868,0.0077240323,0.020164104,0.08854828,0.6431427,0.11932739,0.10932847],"study_design_scores_gemma":[0.0022506209,0.00062467734,0.00010649149,0.00010305132,0.000010345095,0.00004191114,0.000059735703,0.92256844,0.027530944,0.00041717346,0.045951232,0.00033538198],"about_ca_topic_score_codex":0.000028291903,"about_ca_topic_score_gemma":0.00029134037,"teacher_disagreement_score":0.94906515,"about_ca_system_score_codex":0.000034588236,"about_ca_system_score_gemma":0.000025180805,"threshold_uncertainty_score":0.38574517},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017526082,0.00008807698,0.42308885,0.0009921944,0.0035525889,0.0001931301,2.847816e-8,0.00012585432,0.57020664],"genre_scores_gemma":[0.845289,0.000020443249,0.002707069,0.000901764,0.00023628109,0.00001225988,2.0719513e-7,0.000004190588,0.15082876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999374,0.000043372667,0.000116298426,0.00014474295,0.000121166995,0.00020046381],"domain_scores_gemma":[0.99937016,0.0000656097,0.000029279225,0.00048369804,0.000025779387,0.00002548655],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003689672,0.000052481144,0.000052682255,0.00000872275,0.00015449284,0.00022345078,0.00058983953,0.000018278628,0.00007116228],"category_scores_gemma":[7.9572845e-7,0.00002966956,0.000036084413,0.00019060455,0.000007062909,0.00010429202,0.00017848982,0.00005044905,0.0011162779],"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":[9.972784e-7,0.0000026095638,0.0006903813,0.0000019394477,0.000013781237,0.0000012955325,0.000020742282,0.0019592196,5.834456e-7,0.9387096,0.045099426,0.013499409],"study_design_scores_gemma":[0.00009175438,0.000025008425,0.0012218911,0.000011061064,9.293037e-7,0.000005299682,0.00005108947,0.15275043,0.0000044688795,0.003943746,0.84182733,0.00006697252],"about_ca_topic_score_codex":0.0000130197395,"about_ca_topic_score_gemma":0.000027768034,"teacher_disagreement_score":0.9347659,"about_ca_system_score_codex":0.0000096843405,"about_ca_system_score_gemma":0.0000041711296,"threshold_uncertainty_score":0.99966145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017936803,0.00001735931,0.606989,0.00038629683,0.0013710357,0.00005345059,3.2937177e-8,0.00013497572,0.373111],"genre_scores_gemma":[0.96144074,5.1504423e-7,0.002319027,0.0005344763,0.000049899343,0.0000015052668,8.5677456e-8,0.000001336371,0.035652407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968404,0.000010961099,0.000060135284,0.00010736379,0.00005970577,0.00007777342],"domain_scores_gemma":[0.9996942,0.000015876854,0.0000118812795,0.00023899917,0.000019404291,0.000019629699],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008560588,0.000027675347,0.000041438027,0.000019853336,0.000014160023,0.00006649511,0.00021737673,0.000016062799,0.00026488368],"category_scores_gemma":[0.000001295161,0.000020407153,0.000023508997,0.00008474806,0.0000017835196,0.00015934132,0.00004536356,0.000025345165,0.0023915023],"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":[3.5793235e-7,0.0000051441148,0.0013029511,0.0000021003927,0.000002881421,8.029833e-7,0.0000883774,0.0000756912,0.00020104834,0.9788663,0.012906742,0.0065476224],"study_design_scores_gemma":[0.00026142056,0.000091934315,0.0019137618,0.000013829798,5.04944e-7,0.00003920134,0.00004806158,0.50147307,0.00077162095,0.004713884,0.49048087,0.00019183438],"about_ca_topic_score_codex":0.000013682912,"about_ca_topic_score_gemma":0.0000024643236,"teacher_disagreement_score":0.9741524,"about_ca_system_score_codex":0.0000062254194,"about_ca_system_score_gemma":0.0000052855344,"threshold_uncertainty_score":0.99838525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764188,0.00013852175,0.001225129,0.00009735074,0.0069842706,0.00018186927,0.0000019727863,0.00007145636,0.014880623],"genre_scores_gemma":[0.9995386,0.000004596293,0.0002267778,0.000024667392,0.000032420707,0.000007746868,4.881199e-7,0.0000075249336,0.0001572036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988314,0.00014467639,0.0003122319,0.0003069885,0.00021440981,0.00019029723],"domain_scores_gemma":[0.99855834,0.00014051594,0.00016041321,0.0006647196,0.00042814348,0.00004784228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063977,0.0001106047,0.00029654702,0.00010257663,0.000069460664,0.000022609316,0.0005084628,0.00005061305,0.000020319843],"category_scores_gemma":[0.00011540985,0.00009743078,0.00010042317,0.00052836037,0.00013844518,0.00025596606,0.00013434392,0.00007643737,0.000015273994],"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.000011598577,0.0001589995,0.009311656,0.000030760013,0.000042550928,0.0000012382629,0.0008985057,0.0000029660364,0.0035197565,0.9791837,0.0053903568,0.0014479433],"study_design_scores_gemma":[0.0020433462,0.0021924146,0.037487436,0.0002867515,0.000033383523,0.00004138108,0.00014010297,0.009481677,0.4623656,0.47287798,0.012295738,0.0007542131],"about_ca_topic_score_codex":0.00015036135,"about_ca_topic_score_gemma":0.000020011994,"teacher_disagreement_score":0.5063057,"about_ca_system_score_codex":0.0000188478,"about_ca_system_score_gemma":0.00004591344,"threshold_uncertainty_score":0.39731118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110454455,0.00006689922,0.86964923,0.000092842114,0.01907858,0.00016390572,9.021606e-7,0.000022666438,0.00047049188],"genre_scores_gemma":[0.9610576,0.000012772066,0.038550034,0.000033302473,0.00030647725,0.0000012455287,7.593701e-7,0.000010845738,0.000026945072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983628,0.00020279961,0.0006950584,0.00015956078,0.00041298932,0.00016678804],"domain_scores_gemma":[0.99797946,0.00017604308,0.0009566471,0.00025565596,0.0005310294,0.000101157624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078086264,0.00012767277,0.00042139608,0.00026022957,0.000059988943,0.00009876192,0.0004589045,0.000120244506,0.000019304855],"category_scores_gemma":[0.0001167594,0.00011567868,0.0002027965,0.00039554122,0.000023083876,0.00086641696,0.00006857924,0.00017836993,0.0000032994856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040771975,0.00083677477,0.005169816,0.00010416766,0.0004906152,0.000055438813,0.002330699,0.85079485,0.00635312,0.07274183,0.007911279,0.05280368],"study_design_scores_gemma":[0.002924831,0.0010337135,0.0002980131,0.00015081547,0.000023597497,0.00013206998,0.000050926712,0.98921,0.0025075562,0.0028073236,0.0006710297,0.00019013985],"about_ca_topic_score_codex":0.000011060199,"about_ca_topic_score_gemma":2.0006041e-7,"teacher_disagreement_score":0.85060316,"about_ca_system_score_codex":0.00007286706,"about_ca_system_score_gemma":0.0001303012,"threshold_uncertainty_score":0.47172397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029101226,0.00007659864,0.96511096,0.000032849992,0.0037237948,0.0017088405,0.000031804382,0.00015727115,0.000056652134],"genre_scores_gemma":[0.9956381,0.0000132132445,0.003537502,0.00013882139,0.00008503923,0.00029189247,0.000010302257,0.000031398016,0.0002537371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763477,0.00019313178,0.0007666991,0.0007111841,0.00036858273,0.00032565978],"domain_scores_gemma":[0.9981966,0.00046944025,0.00036560162,0.00064872456,0.00020190404,0.00011773432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067446154,0.00034702854,0.00050872896,0.0004465894,0.00021714979,0.00019825557,0.0003803856,0.00023134478,0.000015135141],"category_scores_gemma":[0.000003913042,0.0002897164,0.00018058627,0.0003753009,0.00003980441,0.0002991341,0.000002004645,0.00024238048,0.00004406907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010887461,0.0002511456,0.0000061519922,0.00011978191,0.00010323089,0.0000013485035,0.0002681622,0.9557025,0.0063090543,0.004192875,0.0003794389,0.03255745],"study_design_scores_gemma":[0.001185477,0.0035913705,0.000018864539,0.0003425369,0.000018122098,0.000040380426,0.00011074489,0.98748815,0.0061702956,0.00014013589,0.0005810743,0.00031282962],"about_ca_topic_score_codex":0.00012039955,"about_ca_topic_score_gemma":0.0000030689193,"teacher_disagreement_score":0.9665369,"about_ca_system_score_codex":0.00024129791,"about_ca_system_score_gemma":0.00010783898,"threshold_uncertainty_score":0.9999555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19534478,0.00020567088,0.8024333,0.00017453285,0.0016082922,0.000109160515,0.0000015843772,0.0000331619,0.000089536086],"genre_scores_gemma":[0.9788825,0.000015938153,0.020063477,0.00008395545,0.00091358786,7.015437e-7,0.0000064930296,0.000009227991,0.000024116258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777246,0.000444767,0.0006912658,0.0002877771,0.00042928004,0.0003744809],"domain_scores_gemma":[0.9976347,0.00076977676,0.00038853465,0.00029558613,0.0007281846,0.00018322465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024519723,0.00014923043,0.00032224169,0.00021650693,0.00028073712,0.0004683185,0.00049342227,0.00018145745,0.000015232812],"category_scores_gemma":[0.00017231026,0.00012626074,0.00010522559,0.00054084655,0.000031795204,0.0007957501,0.00020197222,0.0008064832,0.0000104697465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004286193,0.000052067826,0.0029957257,0.00001235344,0.000032420397,0.000012309199,0.00057627977,0.9680263,0.00001812791,0.008890839,0.00031462742,0.019026093],"study_design_scores_gemma":[0.00046533853,0.000452772,0.00485075,0.00024811132,0.0000049856303,0.00014190288,0.00037962478,0.9884006,0.0000039038564,0.003927017,0.000981045,0.00014397464],"about_ca_topic_score_codex":0.000019262958,"about_ca_topic_score_gemma":0.000004733872,"teacher_disagreement_score":0.78353775,"about_ca_system_score_codex":0.00009406353,"about_ca_system_score_gemma":0.00004918901,"threshold_uncertainty_score":0.5148763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5526726,0.00029217644,0.39717084,0.00025759434,0.04541809,0.00026495176,7.4304745e-7,0.00006300892,0.0038599994],"genre_scores_gemma":[0.99025613,0.000013243563,0.008551701,0.000031683045,0.0011187899,7.8233563e-7,1.7682343e-7,0.000018249126,0.000009243775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997092,0.0002445164,0.0015640592,0.00021662365,0.00059106905,0.00029171476],"domain_scores_gemma":[0.9959694,0.0009549151,0.001811418,0.0003879628,0.0007013165,0.00017497665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030655519,0.0002447111,0.00092894584,0.0002681328,0.00016182904,0.0002494583,0.00092389615,0.00015361115,0.00000366062],"category_scores_gemma":[0.00043489752,0.00020736828,0.00027169363,0.00037291835,0.00008099229,0.0003443809,0.0003184478,0.00035578906,0.0000019298232],"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.000027142927,0.00020568466,0.00007335805,0.00010932399,0.00007271125,0.0000036964645,0.0010034073,0.000045257482,0.0007056554,0.99443084,0.00042476744,0.0028981485],"study_design_scores_gemma":[0.003772163,0.0017856249,0.000065498825,0.0006939794,0.000052782252,0.00023363884,0.00021998832,0.06081892,0.0028973848,0.92650086,0.0026011232,0.00035805893],"about_ca_topic_score_codex":0.000012973059,"about_ca_topic_score_gemma":3.6581957e-7,"teacher_disagreement_score":0.43758354,"about_ca_system_score_codex":0.000044623714,"about_ca_system_score_gemma":0.00007743872,"threshold_uncertainty_score":0.8456233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024649707,0.00072857266,0.96390295,0.00075736624,0.00896489,0.000838263,0.0000028163088,0.00027846664,0.024502005],"genre_scores_gemma":[0.7238113,0.00038540232,0.2473166,0.005092043,0.012653282,0.000115180585,0.00005815216,0.0002475844,0.010320446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534583,0.00008195234,0.0008171582,0.0020953438,0.00078210596,0.00087763276],"domain_scores_gemma":[0.9964947,0.0004895807,0.00053540146,0.002004548,0.0003121671,0.00016359311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013950784,0.00064813806,0.0007222148,0.0007005731,0.0003598053,0.00084304117,0.0028904884,0.00056868297,0.00007932857],"category_scores_gemma":[0.000025508698,0.00059901405,0.0002499619,0.0007959919,0.00028709506,0.0005945795,0.00051010563,0.0013415866,0.00039379988],"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.000010507643,0.000014770346,0.000025081672,0.000038124737,0.000016476766,0.000012533975,0.0003733593,0.2825541,0.00015416484,0.06870253,0.0005514431,0.64754695],"study_design_scores_gemma":[0.00033328225,0.0002801601,0.000048012087,0.0008091078,0.0000074903237,0.0002659043,5.0769444e-7,0.67716175,0.00053282833,0.2171211,0.10235701,0.0010828435],"about_ca_topic_score_codex":0.000035630004,"about_ca_topic_score_gemma":0.00017298067,"teacher_disagreement_score":0.72378665,"about_ca_system_score_codex":0.0005306476,"about_ca_system_score_gemma":0.00034248538,"threshold_uncertainty_score":0.9996461},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6003806,0.000013100749,0.39563373,0.00030282652,0.0006158781,0.00020085195,8.5566637e-7,0.00012943808,0.0027227353],"genre_scores_gemma":[0.9960169,0.0000039111324,0.0020505365,0.00011439696,0.00020013262,0.000022250755,4.1822057e-7,0.0000036953677,0.0015877297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998667,0.0004000714,0.00023771322,0.00035316971,0.00012764099,0.00021440256],"domain_scores_gemma":[0.9993112,0.00014125495,0.000037635138,0.00033843334,0.000077769444,0.00009369076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013452052,0.00008449495,0.0001258954,0.00016480776,0.00011309372,0.00013374876,0.00018909988,0.00007642635,0.000015700136],"category_scores_gemma":[0.000087784385,0.00006836644,0.000015660438,0.00036084568,0.000032217024,0.00025539042,0.00015911328,0.00006531798,0.00014810867],"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.004144277,0.00026331388,0.0020555507,0.00006614896,0.000040368344,0.0001635,0.004314105,0.0012064676,0.7560843,0.18178284,0.021991305,0.027887773],"study_design_scores_gemma":[0.0003884183,0.000984091,0.0060768994,0.00007777696,0.0000017387613,0.00018910857,0.00023012441,0.98199373,0.0022226705,0.00016637615,0.0074407435,0.0002283196],"about_ca_topic_score_codex":0.0012228054,"about_ca_topic_score_gemma":0.0005132497,"teacher_disagreement_score":0.9807873,"about_ca_system_score_codex":0.000086257605,"about_ca_system_score_gemma":0.00001580839,"threshold_uncertainty_score":0.27879027},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5072301,0.0003412373,0.47374153,0.00067838846,0.006691787,0.002143176,0.00008709531,0.0003347651,0.008751932],"genre_scores_gemma":[0.99481434,0.000045323788,0.00054979057,0.0015406181,0.00043310912,0.00019126931,0.000022992273,0.000049221668,0.0023533488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615055,0.00014355643,0.0009892834,0.0011923544,0.0003700118,0.0011542701],"domain_scores_gemma":[0.9979242,0.00025465933,0.00018237373,0.0009507233,0.00034266335,0.0003453929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091890624,0.00050080795,0.0007901837,0.00031371752,0.00012265399,0.00037907923,0.0013044224,0.00029224588,0.000021870874],"category_scores_gemma":[0.00007289032,0.0004823577,0.00027014603,0.0006729565,0.000040866857,0.0006324537,0.00012188579,0.0004278417,0.0007601962],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006698739,0.002113054,0.0448417,0.0020124384,0.0009807346,0.0009387741,0.025071012,0.068389654,0.25229913,0.017005343,0.0929805,0.49269778],"study_design_scores_gemma":[0.02234654,0.0076400233,0.05033055,0.004712634,0.00016941021,0.0012010972,0.0007156229,0.40071127,0.08677418,0.029454764,0.38652617,0.009417756],"about_ca_topic_score_codex":0.000073423194,"about_ca_topic_score_gemma":0.0014854554,"teacher_disagreement_score":0.48758423,"about_ca_system_score_codex":0.00035961182,"about_ca_system_score_gemma":0.00013653803,"threshold_uncertainty_score":0.99976283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020568999,0.000011516573,0.6553452,0.00028267325,0.0012274233,0.000043882574,1.7811892e-8,0.00010995788,0.32241035],"genre_scores_gemma":[0.9763122,4.1503563e-7,0.0025345457,0.000500567,0.00004776957,0.0000013357653,5.8436832e-8,0.0000012074812,0.020601902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997157,0.000010034025,0.000054359796,0.00009496991,0.00005361672,0.00007131838],"domain_scores_gemma":[0.9997366,0.000013984813,0.000010697992,0.00020339525,0.000017389164,0.00001791226],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000073524585,0.000024931025,0.00003717916,0.000017404887,0.000013816085,0.00005169236,0.00020721204,0.000014646154,0.00024025474],"category_scores_gemma":[0.0000011600786,0.000018347653,0.000020701968,0.00007297675,0.0000016430674,0.00014090419,0.0000411275,0.00002270662,0.0023784703],"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":[3.3515587e-7,0.000004869493,0.0012976235,0.0000016816713,0.0000028886561,8.492653e-7,0.000085575906,0.00012700238,0.0001782945,0.9827977,0.010350611,0.0051525775],"study_design_scores_gemma":[0.00023653092,0.000084242616,0.0019162556,0.000010808454,4.577024e-7,0.000039919963,0.0000464181,0.6461745,0.0008930749,0.0042668665,0.34616032,0.0001706125],"about_ca_topic_score_codex":0.000012139005,"about_ca_topic_score_gemma":0.0000039912984,"teacher_disagreement_score":0.9785308,"about_ca_system_score_codex":0.0000057812254,"about_ca_system_score_gemma":0.000004727466,"threshold_uncertainty_score":0.9983983},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01136388,0.000031156218,0.97312474,0.00093605707,0.0013119373,0.00053384295,0.0000012643598,0.00015365012,0.012543486],"genre_scores_gemma":[0.9604291,7.889213e-7,0.02551341,0.0011791795,0.0003850866,0.000056770332,0.0000012589052,0.000012727065,0.012421731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885917,0.000036802594,0.00023837648,0.00037586066,0.00017447038,0.00031532056],"domain_scores_gemma":[0.99912596,0.00016978936,0.00007895919,0.000444829,0.00010968525,0.00007075249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023901032,0.00014592607,0.00024056906,0.000061806546,0.000089653266,0.00020633763,0.00040944546,0.000063518055,0.000058335823],"category_scores_gemma":[0.00000624136,0.0000945945,0.00008820526,0.00013342213,0.000009049288,0.0003683798,0.000034844557,0.000072679635,0.00020656864],"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.0008466091,0.00049478497,0.00881393,0.0005147992,0.0010250902,0.00006978868,0.0077240323,0.020164104,0.08854828,0.6431427,0.11932739,0.10932847],"study_design_scores_gemma":[0.0022506209,0.00062467734,0.00010649149,0.00010305132,0.000010345095,0.00004191114,0.000059735703,0.92256844,0.027530944,0.00041717346,0.045951232,0.00033538198],"about_ca_topic_score_codex":0.000028291903,"about_ca_topic_score_gemma":0.00029134037,"teacher_disagreement_score":0.94906515,"about_ca_system_score_codex":0.000034588236,"about_ca_system_score_gemma":0.000025180805,"threshold_uncertainty_score":0.38574517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05666396,0.00007331012,0.91917497,0.0002548311,0.0008036532,0.00034251204,0.0000022492434,0.00006832998,0.022616198],"genre_scores_gemma":[0.9819559,0.0000044790577,0.016029218,0.00014704406,0.000037385114,0.000009964341,0.0000030674942,0.0000043118016,0.0018086176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939466,0.00004496098,0.00020655949,0.00014203714,0.000104552644,0.00010725876],"domain_scores_gemma":[0.9990159,0.00013444322,0.00011232972,0.00059502956,0.00012067934,0.000021616544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023112148,0.00006241618,0.00013398942,0.00004319514,0.000043300715,0.000060298502,0.0005610014,0.000048147733,0.000041845393],"category_scores_gemma":[0.000009089295,0.000049542166,0.00007016637,0.000099214594,0.000009841271,0.00024962088,0.00009132198,0.000044583616,0.00001485997],"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.000009904778,0.000020188176,0.00038295332,0.000030066121,0.000026286503,6.445316e-8,0.00053821225,0.0015450844,0.0038205686,0.97107327,0.009866671,0.012686728],"study_design_scores_gemma":[0.0011130262,0.00036472786,0.0038056232,0.000069232425,0.0000066170555,0.00001586811,0.00041843325,0.9312561,0.021615686,0.012331551,0.028696407,0.00030671436],"about_ca_topic_score_codex":0.00006638422,"about_ca_topic_score_gemma":0.000025622629,"teacher_disagreement_score":0.9587417,"about_ca_system_score_codex":0.000014590939,"about_ca_system_score_gemma":0.00001685928,"threshold_uncertainty_score":0.2020271},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08070355,0.000029773315,0.90992785,0.000040817682,0.0016371816,0.00084046624,0.0000012874868,0.00017488176,0.006644192],"genre_scores_gemma":[0.9799534,0.000002586841,0.018763049,0.0004904643,0.00036561632,0.00012007014,0.0000019951558,0.0000149344805,0.0002878724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987936,0.00006369886,0.00018740608,0.0004424611,0.00019219007,0.00032062628],"domain_scores_gemma":[0.9991652,0.00011689829,0.00014624395,0.0004107584,0.00010569736,0.00005523459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031943675,0.00015179743,0.00020132404,0.0000691111,0.00012896088,0.00034831912,0.0006499283,0.00007712077,0.000009507546],"category_scores_gemma":[0.000002383781,0.00011600456,0.000063541374,0.00024631343,0.000012896225,0.0005684885,0.00005526016,0.0001274756,0.000055810673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012479322,0.0009548733,0.044720314,0.0010721233,0.001033888,0.000028916229,0.00785381,0.5669943,0.00026989548,0.3165876,0.048151717,0.011084627],"study_design_scores_gemma":[0.0010441118,0.00047862844,0.002671759,0.00021544042,0.0000071914187,0.00002728594,0.000049178656,0.99095565,0.00024060433,0.000423557,0.003513726,0.00037287903],"about_ca_topic_score_codex":0.0000092646305,"about_ca_topic_score_gemma":0.0000044607564,"teacher_disagreement_score":0.89924985,"about_ca_system_score_codex":0.000055620876,"about_ca_system_score_gemma":0.00002984855,"threshold_uncertainty_score":0.47305286},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013416895,0.00000377159,0.87808096,0.00084212294,0.0006145385,0.000040339495,2.8849638e-7,0.00013053635,0.11894574],"genre_scores_gemma":[0.98850304,4.5447115e-7,0.007910998,0.0011807448,0.000295283,0.000006220534,4.973825e-7,0.0000017177571,0.0021010574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996355,0.000014778853,0.00010357699,0.00008031226,0.00008639489,0.00007942801],"domain_scores_gemma":[0.9997409,0.000014230923,0.000013312193,0.00013224359,0.000073374315,0.000025926774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009946887,0.000032603617,0.000033127737,0.000033314496,0.00012272505,0.00009539538,0.00017029123,0.000018902329,0.00022538313],"category_scores_gemma":[0.0000023655248,0.000025312462,0.000023947143,0.00012487665,0.000015441485,0.00040723657,0.0000123443315,0.000024045668,0.00036013062],"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":[5.3777495e-7,0.000010482657,0.00004440483,8.51629e-7,0.000004584806,2.3300737e-7,0.00065391883,0.000051918796,0.000084856925,0.93729895,0.058343187,0.0035060605],"study_design_scores_gemma":[0.00026194795,0.00010158017,0.00090853125,0.0000078379535,0.0000013459803,0.000051256964,0.00005364063,0.5904759,0.0020941405,0.006845335,0.3990425,0.00015598956],"about_ca_topic_score_codex":0.000008608351,"about_ca_topic_score_gemma":0.000037272603,"teacher_disagreement_score":0.98716134,"about_ca_system_score_codex":0.000008008418,"about_ca_system_score_gemma":0.000015929707,"threshold_uncertainty_score":0.46288708},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8200601,0.00020417101,0.1566257,0.0021771777,0.0020930031,0.00048231278,0.000014130945,0.00025644986,0.018086951],"genre_scores_gemma":[0.9957156,0.000007755502,0.0020600501,0.00016634336,0.00006524411,0.000030712083,0.000005313514,0.0000066210223,0.0019423303],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990787,0.00005963594,0.00028653085,0.00020938889,0.00014356234,0.00022221752],"domain_scores_gemma":[0.9992383,0.00007979481,0.000078406694,0.00039200662,0.00012366609,0.00008782074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010050864,0.00010756967,0.00017237842,0.000055689707,0.00008597119,0.000108678745,0.00049290265,0.00006887059,0.00025849088],"category_scores_gemma":[0.000006957001,0.00009484725,0.000083230094,0.0001925949,0.000040758376,0.00040834883,0.00008195503,0.000105434105,0.0003075618],"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.000002473628,0.00034068868,0.0050181183,0.000038891194,0.000078467005,0.0000056370504,0.0007814818,0.0002609059,0.036738686,0.08598468,0.85675865,0.01399131],"study_design_scores_gemma":[0.004906821,0.003125166,0.10437044,0.0009370457,0.000117451185,0.00083940855,0.001602104,0.33625874,0.15765163,0.042978004,0.34322608,0.0039871274],"about_ca_topic_score_codex":0.00029949917,"about_ca_topic_score_gemma":0.000009006445,"teacher_disagreement_score":0.5135326,"about_ca_system_score_codex":0.000019820884,"about_ca_system_score_gemma":0.000017365956,"threshold_uncertainty_score":0.39531872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32826248,0.00016861358,0.66714007,0.0002335312,0.0008335278,0.00015443846,4.6284214e-7,0.000007671531,0.003199205],"genre_scores_gemma":[0.96044266,0.000040477145,0.038439207,0.000009966409,0.00030625885,0.0000013118387,2.1660207e-7,0.000009845303,0.00075008057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973755,0.0002279476,0.0007161838,0.000120197896,0.0012939976,0.00026621402],"domain_scores_gemma":[0.9973347,0.00087220717,0.0004913164,0.00034130033,0.0008704232,0.00009000913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00548744,0.00008087201,0.00029222143,0.0003097662,0.00010013614,0.00013167645,0.0008048366,0.0000826957,0.00013702801],"category_scores_gemma":[0.00009531041,0.00006056073,0.00013782644,0.00031963157,0.00002919586,0.00046999045,0.00027572282,0.0006827067,0.00003558778],"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.000116792544,0.0010788915,0.0014342593,0.00093353336,0.00032598322,0.00006306445,0.008222654,0.18152536,0.00682518,0.7800476,0.011062621,0.008364086],"study_design_scores_gemma":[0.00038263528,0.0003743385,0.00034245217,0.0007020233,0.0000040351097,0.00025375118,0.0011240187,0.97522116,0.00028490758,0.019858148,0.0013608275,0.000091723385],"about_ca_topic_score_codex":0.000015025879,"about_ca_topic_score_gemma":0.0000029977791,"teacher_disagreement_score":0.79369575,"about_ca_system_score_codex":0.00009922731,"about_ca_system_score_gemma":0.000121938334,"threshold_uncertainty_score":0.2966059},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811924,0.000076702454,0.0028910073,0.0005498268,0.012540966,0.00017449062,0.0000018776434,0.00009652757,0.002476169],"genre_scores_gemma":[0.9993388,0.000009450341,0.00038583673,0.00007959222,0.000018113518,0.000019629655,7.108645e-7,0.000007208412,0.00014068112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884397,0.00015845153,0.000296753,0.0002302,0.00022305627,0.00024754854],"domain_scores_gemma":[0.9984403,0.00036063555,0.0001736187,0.00076475635,0.00019064474,0.00007003805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078893633,0.00011227462,0.00019527438,0.00004882871,0.0003076987,0.00013233892,0.00081639236,0.00006764025,0.000011027285],"category_scores_gemma":[0.000076313125,0.0000788247,0.00011695725,0.00034545088,0.00011162115,0.00018747876,0.00015043908,0.00022503058,0.000023154473],"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.0000053294502,0.000029564204,0.0015964285,0.0000031004324,0.000020422976,0.0000012936331,0.00012293362,0.000009665198,0.0067747505,0.9880568,0.0024431003,0.00093662005],"study_design_scores_gemma":[0.000981179,0.00014106461,0.006853165,0.00001552916,0.000006972952,0.000026889515,0.000022890832,0.04403117,0.0056362306,0.8900211,0.052022453,0.00024135406],"about_ca_topic_score_codex":0.00013311602,"about_ca_topic_score_gemma":0.00015276027,"teacher_disagreement_score":0.09803569,"about_ca_system_score_codex":0.000009859631,"about_ca_system_score_gemma":0.000031874733,"threshold_uncertainty_score":0.32143778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98418343,0.00025669625,0.005784718,0.00086763257,0.004101281,0.00025912156,0.0000011202037,0.00010325204,0.00444272],"genre_scores_gemma":[0.99871236,0.000005026742,0.0008052823,0.000060122315,0.000022720396,0.000028113307,3.1433348e-7,0.000009277654,0.00035680868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986703,0.00024491767,0.00025003776,0.0002600503,0.0003219225,0.000252805],"domain_scores_gemma":[0.9983688,0.00042487634,0.00017916094,0.0005943925,0.00032001678,0.00011278226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157972,0.00013257442,0.00022901935,0.000036051253,0.00015772617,0.000116473966,0.0006883951,0.000057937,0.0000026326152],"category_scores_gemma":[0.00013006617,0.000083230254,0.00007921163,0.00041645957,0.00009318824,0.00023561849,0.00013386688,0.00011744831,0.000010289938],"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.000087795546,0.00008203863,0.0027143776,0.0000064367264,0.00006705373,0.000009387813,0.0010557286,0.00009202271,0.0001470317,0.98345965,0.011397123,0.00088133186],"study_design_scores_gemma":[0.008462918,0.0027653687,0.009352755,0.00013321039,0.00004246012,0.00016885405,0.00082790985,0.03622658,0.0056261243,0.90033466,0.03519148,0.0008676607],"about_ca_topic_score_codex":0.0001632394,"about_ca_topic_score_gemma":0.000059511312,"teacher_disagreement_score":0.083124995,"about_ca_system_score_codex":0.000041323314,"about_ca_system_score_gemma":0.000104691746,"threshold_uncertainty_score":0.33940312},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22937514,0.000056061297,0.42933387,0.00024543237,0.0026180914,0.00020243031,2.4873052e-7,0.00044759965,0.33772114],"genre_scores_gemma":[0.99243397,0.0000059856425,0.0061041783,0.0005791512,0.00004466998,0.000004781044,6.863167e-8,0.0000026865832,0.0008245193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940395,0.000033530137,0.00011722392,0.00022656063,0.00007457254,0.00014416105],"domain_scores_gemma":[0.9995499,0.0000395831,0.000027913835,0.000303463,0.000028224307,0.0000508795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029514337,0.000063976004,0.00008277932,0.000020278863,0.000070167254,0.00004593328,0.0001833479,0.00003481973,0.000042841013],"category_scores_gemma":[0.000007990144,0.000047372137,0.000030197458,0.0001326818,0.000019012727,0.00015931897,0.00007745628,0.000060606068,0.000029455354],"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.000007833416,0.000020086425,0.0062737064,0.0000041101075,0.0000054356933,0.0000025451116,0.00040631663,0.00017517406,0.0000033659735,0.9785588,0.010411933,0.004130731],"study_design_scores_gemma":[0.0008603804,0.0015897889,0.113395125,0.00013944194,0.000008501877,0.00009091547,0.00012449105,0.1939395,0.00076540996,0.6034478,0.08468771,0.00095095043],"about_ca_topic_score_codex":0.00017245788,"about_ca_topic_score_gemma":0.00002686728,"teacher_disagreement_score":0.76305884,"about_ca_system_score_codex":0.000008894016,"about_ca_system_score_gemma":0.0000051466372,"threshold_uncertainty_score":0.19317797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960879,0.0001560486,0.0019688585,0.00018017636,0.00095678883,0.00007340626,0.0000012946097,0.0000026993318,0.0005728284],"genre_scores_gemma":[0.9995663,0.000026428761,0.0001524088,0.00007196226,0.00008789065,7.295399e-7,1.9369264e-8,0.000005125165,0.00008912662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987501,0.0002904233,0.0004925626,0.000104664854,0.0002242491,0.00013803037],"domain_scores_gemma":[0.99831295,0.00029572798,0.0007781199,0.00031390926,0.00025289308,0.000046384917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015500525,0.000088149805,0.00025855374,0.00016778917,0.000108954984,0.000029556617,0.00064387004,0.000063346735,0.000010224662],"category_scores_gemma":[0.00013046546,0.00005452896,0.00016695051,0.00032687676,0.00020637586,0.00022558386,0.00018334607,0.00017678573,5.795554e-7],"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.0004957575,0.00017551662,0.44404268,0.000071886796,0.00018801511,0.000026733764,0.0056744227,0.0001356567,0.011280025,0.5341238,0.000690139,0.0030954052],"study_design_scores_gemma":[0.0014656995,0.00093850313,0.81270146,0.00050195545,0.000022152022,0.0003837398,0.0005381429,0.0012944421,0.0036005466,0.17827581,0.000120590616,0.00015696534],"about_ca_topic_score_codex":0.00004604099,"about_ca_topic_score_gemma":0.00046169484,"teacher_disagreement_score":0.36865878,"about_ca_system_score_codex":0.00001635743,"about_ca_system_score_gemma":0.000034411765,"threshold_uncertainty_score":0.22236264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09383078,0.000026794818,0.84186465,0.0010353914,0.00026843435,0.00017172813,0.0000016420734,0.000090006666,0.06271057],"genre_scores_gemma":[0.952751,0.0000018163677,0.046864375,0.00012489189,0.00009151885,0.00002118392,6.3265577e-7,0.000010060051,0.000134537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877316,0.00007505884,0.00039283987,0.00026797404,0.00026272703,0.00022825312],"domain_scores_gemma":[0.99827504,0.00017952755,0.0003772345,0.0009535642,0.000106284024,0.000108338616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003001441,0.00013425507,0.00037061473,0.000055898126,0.000244283,0.0002674504,0.0009766284,0.000039838153,0.000030559306],"category_scores_gemma":[0.00012876606,0.000109320594,0.00012688029,0.00009185716,0.00030418445,0.0003976214,0.00024463263,0.00010293195,0.00011245692],"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.000025335114,0.00026489786,0.0005733955,0.000086342145,0.0000844585,0.000019716572,0.0034743822,0.00024059688,0.0011801667,0.96886986,0.0012409383,0.023939928],"study_design_scores_gemma":[0.00046833284,0.000846159,0.005107359,0.00028440062,0.000022657221,0.00002784455,0.00041138136,0.69089043,0.0017505905,0.298504,0.0012428269,0.0004440141],"about_ca_topic_score_codex":0.00051399163,"about_ca_topic_score_gemma":0.000036086014,"teacher_disagreement_score":0.8589202,"about_ca_system_score_codex":0.000027325023,"about_ca_system_score_gemma":0.000024116993,"threshold_uncertainty_score":0.44579646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874173,0.00024146248,0.0067001604,0.00017811055,0.0022527673,0.00015433693,0.0000018695323,0.00009828629,0.0029557259],"genre_scores_gemma":[0.9983708,0.000019088753,0.0012475419,0.00013013871,0.000035658664,0.000011773845,8.31736e-7,0.000009921662,0.00017420406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988168,0.00006865531,0.00025748913,0.00036304485,0.0002440032,0.00025004626],"domain_scores_gemma":[0.99893904,0.00008520719,0.00012823688,0.00046784015,0.00029432436,0.000085378764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021856373,0.00015483978,0.00027431428,0.000053341162,0.00014875155,0.0000974431,0.0004506705,0.00007491585,0.00000823579],"category_scores_gemma":[0.000025563952,0.00011948696,0.000035034853,0.0003114102,0.00017353465,0.00042630592,0.000112933274,0.00010561926,0.00001789413],"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.0001655117,0.00029039333,0.037242483,0.00014715263,0.00015579269,0.000023143857,0.0060164127,0.00015360783,0.0063364785,0.9281673,0.0070046578,0.014297095],"study_design_scores_gemma":[0.014517845,0.008028018,0.14981042,0.0019360133,0.00012186592,0.0004987408,0.0016765479,0.4852249,0.10965837,0.14547375,0.07978379,0.0032697506],"about_ca_topic_score_codex":0.00008843176,"about_ca_topic_score_gemma":0.000031310385,"teacher_disagreement_score":0.7826935,"about_ca_system_score_codex":0.000021815527,"about_ca_system_score_gemma":0.000033770586,"threshold_uncertainty_score":0.4872537},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53273976,0.0006099078,0.17538786,0.0000071766995,0.018823355,0.0015591319,0.0000838471,0.0012758524,0.2695131],"genre_scores_gemma":[0.42370674,0.000057621855,0.000052521144,0.000008770627,0.00012304315,7.909419e-8,0.00010472024,0.0000268075,0.5759197],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975031,0.00016691869,0.00043082875,0.0009684613,0.00046731558,0.00046338764],"domain_scores_gemma":[0.99729013,0.00017558719,0.0008356929,0.0008536478,0.0006189262,0.00022601154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000061297915,0.0005099824,0.0006912658,0.0006962287,0.00033559193,0.00028448904,0.0018022866,0.0007001885,0.0000043644823],"category_scores_gemma":[0.000019821313,0.00064874714,0.00059399486,0.0009166946,0.000056124463,0.0034137017,0.00042367107,0.00056865555,0.000047806214],"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.0071354997,0.0029924237,0.063852146,0.0037935125,0.0060153757,0.0019301078,0.0018537753,0.19756679,0.039068457,0.05628288,0.60466653,0.014842503],"study_design_scores_gemma":[0.010002682,0.0041952115,0.01446783,0.007216789,0.0014350899,0.0009297388,0.1455614,0.0297105,0.008200787,0.0006730961,0.7675108,0.010096081],"about_ca_topic_score_codex":0.00018223305,"about_ca_topic_score_gemma":0.0003222454,"teacher_disagreement_score":0.3064066,"about_ca_system_score_codex":0.0006361483,"about_ca_system_score_gemma":0.0002751317,"threshold_uncertainty_score":0.99959636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2883629,0.0046301996,0.6876867,0.0030376043,0.01548206,0.00035882342,0.00002970796,0.000025705094,0.0003863201],"genre_scores_gemma":[0.99650407,0.00046840942,0.0001668268,0.00001776624,0.0027318166,0.0000059516638,0.000012815141,0.0000054075686,0.00008694781],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818635,0.00016250239,0.0008684678,0.00021052637,0.0004235033,0.00014864258],"domain_scores_gemma":[0.9982136,0.000121768026,0.0006769538,0.0001810229,0.0006920298,0.00011461617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006432921,0.00014314022,0.00034116118,0.00012677441,0.000036065547,0.0001371924,0.0004418445,0.000091308364,0.000040008923],"category_scores_gemma":[0.00001646601,0.000112168105,0.0001302307,0.00012645614,0.000032308257,0.00047569085,0.00014232821,0.00016062996,0.0000036293402],"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.0012514746,0.0011509995,0.3765814,0.0005533405,0.0033131067,0.00014326429,0.0034157266,0.3126274,0.00085134065,0.13072136,0.13606393,0.033326656],"study_design_scores_gemma":[0.0029829047,0.00083197467,0.035335068,0.0005096305,0.00004686943,0.001035223,0.002264918,0.6476279,0.000050794264,0.00080096425,0.30806142,0.00045231517],"about_ca_topic_score_codex":0.00008597015,"about_ca_topic_score_gemma":0.000005294541,"teacher_disagreement_score":0.70814115,"about_ca_system_score_codex":0.000056183857,"about_ca_system_score_gemma":0.000022867374,"threshold_uncertainty_score":0.45740825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073224714,0.00047016982,0.9755236,0.00045681302,0.008836134,0.0005237408,0.0000037185875,0.00016437515,0.013289206],"genre_scores_gemma":[0.9196029,0.00014444716,0.073965915,0.0024707196,0.0015269383,0.000024658973,0.000008455582,0.000091829555,0.0021641839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569404,0.00006876085,0.0008242476,0.0017919807,0.00077731884,0.0008436384],"domain_scores_gemma":[0.99742526,0.00042023876,0.00034872215,0.0014868978,0.0001696673,0.00014921911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012695928,0.00057576847,0.000737938,0.0015150493,0.00018263134,0.00072205305,0.003259007,0.00043806565,0.00003985378],"category_scores_gemma":[0.00004393786,0.0005367005,0.00020350752,0.0007676684,0.00029524168,0.0007144586,0.00081720867,0.0010920214,0.00013851144],"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.000020210646,0.000071407674,0.0013130348,0.00018090935,0.000038163475,0.00031412646,0.0030199597,0.09390925,0.00058645295,0.1465466,0.00013001094,0.7538699],"study_design_scores_gemma":[0.00050405134,0.0001984276,0.0010883317,0.0016512027,0.00000438949,0.00018238208,6.743459e-7,0.8994063,0.00029041793,0.08970384,0.005795283,0.0011746966],"about_ca_topic_score_codex":0.00010687145,"about_ca_topic_score_gemma":0.0009397132,"teacher_disagreement_score":0.9188706,"about_ca_system_score_codex":0.00036280547,"about_ca_system_score_gemma":0.00042966142,"threshold_uncertainty_score":0.9997085},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122713335,0.0001522944,0.8717832,0.00010879285,0.0023408215,0.0004485363,0.000049441867,0.00014126401,0.0022622887],"genre_scores_gemma":[0.9989037,0.000027340911,0.00035146024,0.000047918962,0.00005075584,0.000042416475,0.000008966388,0.000009339248,0.0005581144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817675,0.00016597213,0.00055693794,0.00051609904,0.00021283154,0.00037138874],"domain_scores_gemma":[0.9991766,0.00007557187,0.00016019844,0.00038758636,0.0000855776,0.00011446032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041377777,0.00022192307,0.00035799135,0.00012883623,0.00020277973,0.0003821572,0.0002548984,0.00017410863,0.000026582054],"category_scores_gemma":[0.0000033621295,0.00021294705,0.00008733521,0.0005525406,0.00001969887,0.00068174285,0.0000021955912,0.00022053052,0.00007908967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050710027,0.00007909849,0.0011307542,0.00008166936,0.000035130197,0.0000072937837,0.00015792174,0.9915562,0.001069358,0.0039313924,0.00015116172,0.0017492669],"study_design_scores_gemma":[0.0010481265,0.00015644926,0.0008395916,0.00036708757,0.000010037045,0.00021124541,0.00037769755,0.9946342,0.00017848966,0.00011638684,0.0016865166,0.00037416248],"about_ca_topic_score_codex":0.001161154,"about_ca_topic_score_gemma":0.00011119305,"teacher_disagreement_score":0.87619036,"about_ca_system_score_codex":0.00024811132,"about_ca_system_score_gemma":0.000059362632,"threshold_uncertainty_score":0.8683729},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48361373,0.00009658457,0.49710795,0.00017481795,0.017042207,0.00074234395,0.0000070391975,0.00039009153,0.0008252194],"genre_scores_gemma":[0.9951897,0.000003995835,0.0016093886,0.00027079147,0.002586209,0.000053273994,0.0000038237617,0.000029200968,0.0002536151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997527,0.00016238542,0.00057596905,0.00074030046,0.00038248632,0.0006118504],"domain_scores_gemma":[0.9980839,0.0003246307,0.0004058628,0.0007892136,0.00027667233,0.000119744596],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000885799,0.00028132094,0.0005078739,0.00014708412,0.00029051863,0.001433397,0.0019598652,0.00011676554,0.000008688639],"category_scores_gemma":[0.000011082462,0.00025359064,0.00015276705,0.00040758023,0.000031628242,0.0016664932,0.00029989774,0.00021859065,0.00008700291],"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.00038229665,0.00047961835,0.077573754,0.0066105076,0.0013124197,0.00017127885,0.0043274434,0.1099753,0.0064077685,0.6514613,0.03513068,0.10616762],"study_design_scores_gemma":[0.002383755,0.00031472355,0.002898421,0.0017778246,0.000055238066,0.00017589564,0.00023998463,0.9593195,0.013089421,0.0027093892,0.015676647,0.0013592308],"about_ca_topic_score_codex":0.0014123273,"about_ca_topic_score_gemma":0.00024515935,"teacher_disagreement_score":0.8493442,"about_ca_system_score_codex":0.00019050315,"about_ca_system_score_gemma":0.00005564382,"threshold_uncertainty_score":0.99999166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871451,0.00009999549,0.0052736383,0.0012071002,0.00024309594,0.00041571693,0.0000019490378,0.000071312636,0.005542047],"genre_scores_gemma":[0.9959754,0.00001915266,0.00219854,0.00046483797,0.000036905876,0.000035496734,0.000002330902,0.0000058579362,0.0012615229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994042,0.00006666279,0.00012883938,0.00017988976,0.00008711266,0.00013331548],"domain_scores_gemma":[0.9992282,0.00018490433,0.000060554044,0.00043222427,0.00006297738,0.00003115939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021250815,0.000064365566,0.0001504596,0.00005143912,0.00007040454,0.00005368945,0.00027366047,0.00006117533,0.000030316072],"category_scores_gemma":[0.00002503764,0.000057103316,0.000027128439,0.00007164893,0.000017020724,0.00011707342,0.00007157358,0.00008477988,0.00008448286],"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.0004035968,0.006512401,0.045848094,0.0009968962,0.0011464572,0.000009222911,0.01959652,0.0002633053,0.03877222,0.8578449,0.010063706,0.01854271],"study_design_scores_gemma":[0.008414344,0.007909766,0.035813067,0.0038550564,0.000102673424,0.000067818015,0.00058134395,0.79291946,0.09556991,0.045925003,0.006652878,0.0021887056],"about_ca_topic_score_codex":0.000011113389,"about_ca_topic_score_gemma":0.000011809557,"teacher_disagreement_score":0.81191987,"about_ca_system_score_codex":0.00001690931,"about_ca_system_score_gemma":0.000011486361,"threshold_uncertainty_score":0.23286057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93470246,0.000101057856,0.008044758,0.00008111128,0.0006882596,0.02157766,0.000038387763,0.00012223248,0.0346441],"genre_scores_gemma":[0.98550665,0.000015852876,0.00064057996,0.000017834562,0.00006339521,0.003170324,0.00015752311,0.000023757762,0.010404105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877137,0.00009844343,0.00044859073,0.00025326505,0.00025018622,0.0001781239],"domain_scores_gemma":[0.9980972,0.00013406365,0.00060373644,0.00085868814,0.00026558302,0.000040738334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033081102,0.00020078874,0.00039816837,0.00016597117,0.000080512196,0.000047125923,0.000831498,0.00020088057,0.00006722465],"category_scores_gemma":[0.000020691303,0.0001728119,0.0002451316,0.00019147605,0.000019749608,0.0001957567,0.000029007031,0.00018038617,0.000009522952],"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.019375678,0.0025998186,0.0010085831,0.006431511,0.0018312703,0.0000037198934,0.21706869,0.24716514,0.016689967,0.017617049,0.13409847,0.3361101],"study_design_scores_gemma":[0.006298132,0.014836145,0.02769839,0.0128811365,0.000107053595,0.000018874369,0.005546617,0.8777907,0.04287277,0.0002258646,0.009720656,0.0020036965],"about_ca_topic_score_codex":0.00018287805,"about_ca_topic_score_gemma":0.00006149989,"teacher_disagreement_score":0.63062555,"about_ca_system_score_codex":0.00009627055,"about_ca_system_score_gemma":0.00019985842,"threshold_uncertainty_score":0.7047065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061592802,0.0000629746,0.6928295,0.00033483983,0.00839692,0.00039165898,4.7071214e-7,0.000514059,0.23587675],"genre_scores_gemma":[0.9635761,0.00000857136,0.002646857,0.00053731864,0.00030731768,0.000017393138,0.0000017235184,0.000011137259,0.03289363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862444,0.0000880086,0.00033174935,0.00043803983,0.00014471651,0.00037306055],"domain_scores_gemma":[0.99906147,0.000087543776,0.00010069115,0.0005766251,0.000095159536,0.000078511344],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004367142,0.00014450008,0.00020317842,0.0000695006,0.000104304105,0.00024178629,0.0004863255,0.00009637415,0.0010891344],"category_scores_gemma":[0.000012010341,0.00012204654,0.00010486723,0.0003349114,0.000009656426,0.0006659824,0.00006829333,0.00016110597,0.0022590156],"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.000046062072,0.00017730179,0.0054735253,0.000109857116,0.00012332208,0.00003189018,0.0014980211,0.02237701,0.0049368045,0.810266,0.086451896,0.06850832],"study_design_scores_gemma":[0.00083308504,0.00035554668,0.0010072468,0.00021846633,0.000004008411,0.00012356661,0.00019175667,0.896247,0.0027175609,0.004084906,0.09364218,0.0005746542],"about_ca_topic_score_codex":0.00018181493,"about_ca_topic_score_gemma":0.000121068435,"teacher_disagreement_score":0.90198326,"about_ca_system_score_codex":0.00005922038,"about_ca_system_score_gemma":0.000022967773,"threshold_uncertainty_score":0.999824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42793414,0.000026815214,0.566532,0.0008244744,0.003291872,0.00017508148,6.1316706e-7,0.00004262484,0.0011723399],"genre_scores_gemma":[0.9844486,0.0000011021947,0.012676016,0.0013368498,0.00065761525,0.0000025177994,5.294498e-7,0.000017940938,0.0008588441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833655,0.00016637972,0.0005137338,0.0002824035,0.00036458057,0.00033634107],"domain_scores_gemma":[0.99834853,0.0003947805,0.00053824094,0.0004015062,0.00021992269,0.0000969898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808129,0.00017787708,0.0002717039,0.00014426869,0.00016472372,0.00048301832,0.0015303926,0.00005936037,0.000044395856],"category_scores_gemma":[0.00006921192,0.000115107105,0.00023607434,0.00010102604,0.000033453318,0.00046346473,0.00010546075,0.0006868812,0.000023224246],"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.0008397139,0.0007758449,0.0039183246,0.0004545198,0.0014161018,0.00016575491,0.08526312,0.13532029,0.07918744,0.34599024,0.11075808,0.23591058],"study_design_scores_gemma":[0.00043579502,0.00073438225,0.000047581812,0.0005922133,0.0000052454025,0.00085502415,0.0001639338,0.97365457,0.012492735,0.0026001234,0.00822595,0.00019243943],"about_ca_topic_score_codex":0.00003212804,"about_ca_topic_score_gemma":0.0000019898846,"teacher_disagreement_score":0.83833426,"about_ca_system_score_codex":0.000060144826,"about_ca_system_score_gemma":0.0000440298,"threshold_uncertainty_score":0.46939316},"labels":[],"label_agreement":null},{"id":"W2995422874","doi":"10.1142/s0219265919500063","title":"Approximation Algorithm for the Broadcast Time in <i>k</i>-Path Graph","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Time complexity; Graph; Path (computing); Broadcasting (networking); Tree (set theory); Algorithm; Approximation algorithm; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network","score_opus":0.007086389217122757,"score_gpt":0.21600671412726893,"score_spread":0.20892032491014617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995422874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005771052,0.0005533707,0.9859268,0.00055855315,0.006276036,0.00043761145,8.030205e-7,0.000030876585,0.00044487295],"genre_scores_gemma":[0.98218536,0.00019424724,0.014027975,0.00070118695,0.0018226828,0.000039677212,0.0000020117818,0.000027906415,0.0009989496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982607,0.0001631654,0.00082932063,0.0002227416,0.0002451356,0.00027898216],"domain_scores_gemma":[0.9980035,0.0005969144,0.00063748314,0.00031668282,0.00038476684,0.00006069644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018972172,0.00016371933,0.0003291722,0.0002771125,0.000102513884,0.00024214537,0.0006714594,0.00013279326,0.00004599656],"category_scores_gemma":[0.000043696593,0.0001109127,0.00030608213,0.00053755776,0.000021546173,0.00084908295,0.000064881635,0.00042617464,0.00002491724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018780427,0.00024308884,0.00064067164,0.000038362876,0.00026894122,0.000015368667,0.0014838567,0.3005802,0.00056423905,0.00914678,0.033401918,0.65342873],"study_design_scores_gemma":[0.00085860834,0.00041250922,0.00018484265,0.00018350246,0.000010255457,0.00035154866,0.00021206653,0.98766977,0.00007428192,0.0008431754,0.009066162,0.00013325678],"about_ca_topic_score_codex":0.000015809537,"about_ca_topic_score_gemma":0.000013356251,"teacher_disagreement_score":0.9764143,"about_ca_system_score_codex":0.000121771875,"about_ca_system_score_gemma":0.000037704136,"threshold_uncertainty_score":0.45228887},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7267629,0.000011653777,0.24207824,0.0011637952,0.0002518831,0.00031486052,6.353373e-7,0.000057784015,0.02935828],"genre_scores_gemma":[0.9982047,0.0000012505456,0.0012840785,0.00033741604,0.00001691825,0.0000038130665,0.0000020966859,0.0000043831033,0.00014535827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990236,0.00023194078,0.0002596408,0.00016271912,0.00016492924,0.00015715136],"domain_scores_gemma":[0.998796,0.00031495292,0.00013008105,0.00068288064,0.000053192092,0.000022917995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007127676,0.00008514852,0.00013440015,0.00010457797,0.00007578248,0.000080737926,0.00049678533,0.000037927042,0.00011537634],"category_scores_gemma":[0.000016749522,0.00005424461,0.00010376829,0.0003140169,0.00001956798,0.0001095005,0.000056936573,0.00015357693,0.00009147948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002497834,0.00013033742,0.07790749,0.000006138276,0.000014248729,6.5752045e-7,0.0004749259,0.8206193,0.000063116626,0.096759945,0.0022172977,0.001781571],"study_design_scores_gemma":[0.00023880204,0.00021971481,0.06263714,0.00012554634,5.7204574e-7,0.000001099875,0.000057868794,0.9354999,0.00002972656,0.0010560526,0.00006621299,0.0000673493],"about_ca_topic_score_codex":0.0005327593,"about_ca_topic_score_gemma":0.000053794338,"teacher_disagreement_score":0.27144182,"about_ca_system_score_codex":0.000052903993,"about_ca_system_score_gemma":0.000023095477,"threshold_uncertainty_score":0.2212031},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3336754,0.000043933847,0.6648273,0.000044685923,0.0006352782,0.00042594076,0.000010716005,0.00010180498,0.00023497484],"genre_scores_gemma":[0.99645066,0.00001486303,0.0025140385,0.00014425046,0.00016422533,0.000004304361,0.00001115014,0.000020498277,0.00067600474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810266,0.00012923309,0.00032527864,0.0009423041,0.00006810643,0.0004324208],"domain_scores_gemma":[0.9986231,0.00019454859,0.0002851249,0.00062177423,0.00015224537,0.00012322381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037147294,0.00030024775,0.0004108066,0.00027212707,0.00016548761,0.00024911453,0.0007997739,0.00030295306,0.00000810137],"category_scores_gemma":[0.000036202902,0.00034916704,0.00017407406,0.00026356438,0.000054211727,0.00018943803,0.0008140839,0.00036842062,0.000031540865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024420324,0.00009071042,0.0058460846,0.00031591,0.00009508325,0.00028100438,0.0005971759,0.956575,0.00011184823,0.03434533,0.0005984665,0.0011189857],"study_design_scores_gemma":[0.0004721669,0.000055877972,0.00023302824,0.00022814189,0.0000147060355,0.000010395504,0.000034938475,0.9933759,0.00002906204,0.0044505256,0.0007179844,0.00037725194],"about_ca_topic_score_codex":0.00028558625,"about_ca_topic_score_gemma":0.000047321937,"teacher_disagreement_score":0.6627753,"about_ca_system_score_codex":0.00020169947,"about_ca_system_score_gemma":0.00009319078,"threshold_uncertainty_score":0.99989605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030787079,0.00018310046,0.94829965,0.010372381,0.001625712,0.00030939383,0.0000018798096,0.00015331889,0.008267513],"genre_scores_gemma":[0.86577296,0.000033781842,0.1293697,0.002047066,0.001611505,0.000016848238,0.0000019407414,0.000025440993,0.0011207417],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981806,0.00017872118,0.00027190757,0.0006570329,0.00026911488,0.0004425704],"domain_scores_gemma":[0.99661493,0.00027848396,0.00017236531,0.0026712455,0.000068570385,0.00019440734],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034701155,0.00025365333,0.0002965678,0.00010047568,0.00063777616,0.0012063371,0.0031300753,0.00010391309,0.00003203369],"category_scores_gemma":[0.00007282852,0.00019661825,0.00011221812,0.00007406547,0.00012961292,0.00033594394,0.0022052762,0.00037585327,0.0001326161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016083432,0.000036902395,0.0035638884,0.00004205685,0.00006911091,0.000071709386,0.0023168884,0.0007768629,0.00026349854,0.010563137,0.019200968,0.9630789],"study_design_scores_gemma":[0.0023768537,0.0008802952,0.044878468,0.0004055042,0.000015825264,0.0008420486,0.0000372129,0.24967742,0.00054141966,0.06505961,0.63384455,0.0014407614],"about_ca_topic_score_codex":0.00017768152,"about_ca_topic_score_gemma":0.0001848637,"teacher_disagreement_score":0.96163815,"about_ca_system_score_codex":0.00002000622,"about_ca_system_score_gemma":0.0000348729,"threshold_uncertainty_score":0.9998305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3896498,0.0024729683,0.5900436,0.0046647647,0.0035800664,0.00023700455,3.096227e-7,0.000023255503,0.009328235],"genre_scores_gemma":[0.9993997,0.00011981185,0.00001088288,0.00015302471,0.000077970435,0.0000018555935,1.6591127e-8,0.000006749786,0.00022998083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982379,0.0005861022,0.00036157685,0.00009610029,0.00038093544,0.0003373882],"domain_scores_gemma":[0.9978416,0.00091650645,0.00049440813,0.0004367859,0.00027465337,0.00003606606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003330424,0.000110028064,0.00022556787,0.00006817343,0.0001726671,0.00005398501,0.0009683084,0.000047544934,0.0000069855496],"category_scores_gemma":[0.00028792236,0.00005553161,0.00016219291,0.00045623299,0.000043969747,0.00014097635,0.000037244306,0.00064448116,0.000005005463],"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.000010638774,0.00006951924,0.000045888482,0.000002771491,0.000039429153,0.0000020214925,0.0004058392,0.0002645026,0.00013407803,0.9975844,0.00104578,0.00039512865],"study_design_scores_gemma":[0.0006725914,0.001520547,0.00024369502,0.00006570959,0.000025450447,0.00044402492,0.00016573654,0.0035017456,0.013196499,0.9581319,0.021879924,0.00015216049],"about_ca_topic_score_codex":0.0000076188585,"about_ca_topic_score_gemma":0.0000069419034,"teacher_disagreement_score":0.6097499,"about_ca_system_score_codex":0.00018070028,"about_ca_system_score_gemma":0.00032094447,"threshold_uncertainty_score":0.27999857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4893375,0.000019789784,0.50822735,0.0013267788,0.00054932217,0.00030418704,0.000011908397,0.00019329316,0.000029880963],"genre_scores_gemma":[0.9925484,0.00002004823,0.0018037634,0.0018942992,0.0002460713,0.000007538203,0.00001298458,0.000032194042,0.00343472],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977099,0.00028970343,0.00038605856,0.0007518278,0.00034311612,0.0005194039],"domain_scores_gemma":[0.9985226,0.00019756271,0.00023800659,0.00046581484,0.00028888212,0.00028715687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044167248,0.0003325275,0.00036369925,0.0002017161,0.00032007098,0.00071566924,0.0015411155,0.00014252233,0.000015309632],"category_scores_gemma":[0.00003735415,0.00035599258,0.00011649726,0.0004405257,0.000074158765,0.003410793,0.00045471467,0.0003644803,0.0002027423],"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.0030977598,0.0005087743,0.82250154,0.0010933789,0.0013575552,0.00056200527,0.020634469,0.09735059,0.032799594,0.011845292,0.0007650852,0.0074839345],"study_design_scores_gemma":[0.013017427,0.007712125,0.50120395,0.0014526544,0.00031370658,0.00038180698,0.0010072524,0.01782448,0.36817664,0.002411297,0.08035814,0.006140518],"about_ca_topic_score_codex":0.0000020021548,"about_ca_topic_score_gemma":0.00005971892,"teacher_disagreement_score":0.5064236,"about_ca_system_score_codex":0.00014186293,"about_ca_system_score_gemma":0.00011475625,"threshold_uncertainty_score":0.9998892},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017498279,0.0005426386,0.9635404,0.010903178,0.0022124685,0.0003718547,0.0000147216515,0.0010377831,0.003878709],"genre_scores_gemma":[0.99441075,0.00010211908,0.0005402581,0.00006526526,0.000047087393,0.00031951396,2.3441872e-7,0.000016642785,0.0044981083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982695,0.0001452425,0.00045899884,0.0005978937,0.00013151871,0.0003968689],"domain_scores_gemma":[0.9977349,0.00073224807,0.0001316503,0.0012021144,0.000108437875,0.00009061962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049650815,0.00023942674,0.0003924991,0.00079259527,0.00033189272,0.00012102857,0.00091787294,0.00036078316,0.000114279996],"category_scores_gemma":[0.00015152483,0.00016068426,0.0001011853,0.0006329471,0.00012409136,0.00036105362,0.000012398786,0.00022780609,0.00020245601],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039033293,0.000102003585,0.00020742985,0.000059453163,0.00023339965,0.00003112847,0.00014585754,0.00010213883,0.00653093,0.16948523,0.0011634035,0.8219],"study_design_scores_gemma":[0.009128482,0.0053407867,0.00066550594,0.009095673,0.00031623145,0.010224175,0.0041781208,0.065919995,0.36616328,0.13252468,0.38998693,0.006456132],"about_ca_topic_score_codex":0.00004669147,"about_ca_topic_score_gemma":0.0000621496,"teacher_disagreement_score":0.9769125,"about_ca_system_score_codex":0.0000651188,"about_ca_system_score_gemma":0.000030526902,"threshold_uncertainty_score":0.6552514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04037805,0.00003751951,0.954137,0.00006651604,0.00008102738,0.0004047159,8.069716e-7,0.000057058478,0.004837289],"genre_scores_gemma":[0.46951026,0.0000075317657,0.529707,0.00002057393,0.000034888377,0.000023891578,0.0000018297414,0.0000034782474,0.00069052563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932677,0.0000126946115,0.00021641704,0.00024694344,0.00008056707,0.00011662155],"domain_scores_gemma":[0.99944156,0.00009522925,0.00012286162,0.00022680726,0.000086542976,0.00002699227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692612,0.00006645952,0.00014332705,0.00006887734,0.000041515057,0.000060540107,0.00020092569,0.00004752101,0.0000035900375],"category_scores_gemma":[0.000008449712,0.00005488041,0.000040234037,0.00013915716,0.000008338752,0.00022135132,0.000062904146,0.000028895336,0.00000684677],"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.000064956985,0.00032777732,0.004786729,0.000999791,0.0001516282,1.9653143e-7,0.0042974814,0.07792098,0.39374208,0.49713507,0.0008689377,0.019704387],"study_design_scores_gemma":[0.0003574978,0.00003328294,0.00037616576,0.000022058666,0.0000016543964,0.000006282905,0.00013049721,0.99838096,0.00028082993,0.00010823602,0.00022750927,0.00007503019],"about_ca_topic_score_codex":0.00008128158,"about_ca_topic_score_gemma":9.827905e-7,"teacher_disagreement_score":0.92046,"about_ca_system_score_codex":0.000009909938,"about_ca_system_score_gemma":0.000010721519,"threshold_uncertainty_score":0.22379582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038547248,0.00011605006,0.884133,0.016632836,0.0005361293,0.00022525809,1.4810622e-7,0.00019442104,0.05961493],"genre_scores_gemma":[0.9960174,0.0000012813397,0.0016945739,0.001479854,0.000071213166,0.0000054884185,9.057237e-8,0.0000032737844,0.0007268258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939734,0.000032110478,0.00015652677,0.00014508735,0.00014481468,0.00012412162],"domain_scores_gemma":[0.99957526,0.000044430406,0.000056147142,0.00022168907,0.000056832214,0.000045637928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021204624,0.000054778684,0.00008823846,0.000010899426,0.00006258113,0.00012783449,0.00049882,0.000023862292,0.00006655826],"category_scores_gemma":[0.00003055597,0.000031038428,0.000056115692,0.0002307384,0.000016914673,0.00017982374,0.00011710828,0.00007148034,0.00008113837],"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.00001970993,0.000068771136,0.0012067507,0.000041462878,0.00009487964,0.000010410068,0.019850284,0.004036497,0.0023295558,0.9028517,0.033447098,0.036042854],"study_design_scores_gemma":[0.000484932,0.0007832648,0.00029149404,0.000068568515,0.000009460387,0.000059089485,0.0030182025,0.6691904,0.019235538,0.0068035526,0.29968274,0.00037275243],"about_ca_topic_score_codex":0.00010293681,"about_ca_topic_score_gemma":0.000009605292,"teacher_disagreement_score":0.9574702,"about_ca_system_score_codex":0.000005499801,"about_ca_system_score_gemma":0.000023043982,"threshold_uncertainty_score":0.12657104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15086055,0.000049144997,0.82289904,0.00033301057,0.00011622929,0.0002906386,0.000003485879,0.000120109915,0.025327787],"genre_scores_gemma":[0.97065836,0.0000065605905,0.029154928,0.00011891572,0.000024519688,0.000015498701,9.3378105e-7,0.000009351776,0.0000109204875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991118,0.000010306919,0.00036918448,0.00018554577,0.0001672086,0.0001559639],"domain_scores_gemma":[0.9994715,0.00006532846,0.00013228324,0.00025976673,0.000016464477,0.00005468702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013902945,0.000106433945,0.0002554278,0.000056242534,0.000027019638,0.00004777918,0.00042035864,0.000043827535,0.000006951698],"category_scores_gemma":[0.000013552857,0.0000923216,0.000060549304,0.0003109605,0.000025665393,0.00009446118,0.00011991292,0.0000824942,0.000014511946],"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.000004720344,0.000033658278,0.00017338754,0.00016795457,0.000016999442,0.0000039882734,0.008986185,0.0018443828,0.0075462344,0.9796449,0.00019381309,0.0013837873],"study_design_scores_gemma":[0.0010502486,0.00013441234,0.0015315437,0.00029244623,0.000014890687,0.000011003318,0.0033778755,0.8829337,0.015249011,0.093731225,0.0010849731,0.000588667],"about_ca_topic_score_codex":0.0000087925,"about_ca_topic_score_gemma":0.000029407232,"teacher_disagreement_score":0.88591367,"about_ca_system_score_codex":0.000010490207,"about_ca_system_score_gemma":0.000011600701,"threshold_uncertainty_score":0.37647656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097339325,0.0008195062,0.8022959,0.07741996,0.01749304,0.00079219515,0.000022832723,0.000481654,0.0033355544],"genre_scores_gemma":[0.9710823,0.000027613358,0.0037986503,0.0058047627,0.018825877,0.000015928641,0.000022442726,0.000017528704,0.0004048486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861974,0.000081666876,0.00036598224,0.00043810235,0.00016495035,0.00032956395],"domain_scores_gemma":[0.9991016,0.00010130524,0.00020167869,0.00040522026,0.00010473554,0.000085484855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041545433,0.00018109185,0.00022274618,0.000026440508,0.00019718961,0.00038977037,0.001286075,0.00008085437,0.00003752494],"category_scores_gemma":[0.000023309387,0.000121590194,0.00009810176,0.00021955211,0.000017663839,0.00039151873,0.00014847094,0.00029478178,0.000064199245],"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.00013607688,0.000021018315,0.0015760293,0.00045138338,0.00021953149,0.000016245524,0.013528121,0.002427434,0.00041231042,0.1253753,0.5333246,0.32251194],"study_design_scores_gemma":[0.00027820838,0.00009542058,0.00041317882,0.0001248045,0.000005982881,0.00003033711,0.0006259391,0.40065944,0.0006483418,0.00002417694,0.5969216,0.00017258269],"about_ca_topic_score_codex":0.000017626147,"about_ca_topic_score_gemma":0.000003974537,"teacher_disagreement_score":0.873743,"about_ca_system_score_codex":0.000033657758,"about_ca_system_score_gemma":0.000018992492,"threshold_uncertainty_score":0.49583042},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065849535,0.0009940512,0.96708965,0.016754784,0.0012600276,0.00034032634,0.0000059948416,0.0010875411,0.0058826883],"genre_scores_gemma":[0.9973142,0.00008832668,0.00081602513,0.0005952383,0.000056871777,0.00009004542,6.208474e-7,0.000010930468,0.0010277275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987328,0.000069970505,0.00033038622,0.00048171773,0.00011395116,0.0002711667],"domain_scores_gemma":[0.99896234,0.00010173869,0.000086243286,0.0006607613,0.00007050421,0.000118436554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019327828,0.00016707121,0.00028604938,0.0003001918,0.00029454986,0.00014889993,0.0007240257,0.00027253098,0.00004222211],"category_scores_gemma":[0.000030967683,0.00014992626,0.000060938717,0.00083980075,0.000063682186,0.00024845498,0.000008662431,0.00037389202,0.0001759677],"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.00007475393,0.00018224126,0.00053738576,0.0002864931,0.0003990013,0.00010111048,0.0018088354,0.006169759,0.0043081827,0.57918257,0.0061601787,0.40078947],"study_design_scores_gemma":[0.003070278,0.0028788236,0.00017471427,0.0005349427,0.00007311343,0.0020127175,0.00420223,0.50662607,0.019626033,0.01965733,0.43917593,0.0019678012],"about_ca_topic_score_codex":0.000025491125,"about_ca_topic_score_gemma":0.0000045752513,"teacher_disagreement_score":0.9907293,"about_ca_system_score_codex":0.000021298829,"about_ca_system_score_gemma":0.000023760846,"threshold_uncertainty_score":0.61138153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004694821,0.0001759858,0.97709656,0.0064306455,0.0009899596,0.00025186024,6.243268e-7,0.0003077178,0.014277186],"genre_scores_gemma":[0.89964527,0.0000054120333,0.080030896,0.015770549,0.002027668,0.00003987866,0.000004086612,0.000020057578,0.0024561542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989492,0.000042884083,0.0002410078,0.00036212287,0.00012683388,0.0002779178],"domain_scores_gemma":[0.9993641,0.0000851696,0.000053961587,0.0002791062,0.000068639834,0.00014902196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020108421,0.00011699413,0.00016907793,0.000023184824,0.000117468924,0.00016967706,0.00054677285,0.00007934372,0.000031849886],"category_scores_gemma":[0.000020380361,0.00009921672,0.00013690398,0.0002350821,0.000014554976,0.00024925993,0.000105759136,0.00010252249,0.000035881658],"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.000030149762,0.000025281519,0.000047293794,0.000029351979,0.00005129475,0.000042148833,0.0004629628,0.010515156,0.00011791963,0.7531606,0.21674785,0.018769972],"study_design_scores_gemma":[0.00021459741,0.00009732201,0.000017196337,0.000008128945,0.0000022907204,0.00004099374,0.000024479621,0.8312181,0.00010230587,0.0015581956,0.16659084,0.00012554268],"about_ca_topic_score_codex":0.000006871011,"about_ca_topic_score_gemma":0.0000047966873,"teacher_disagreement_score":0.8991758,"about_ca_system_score_codex":0.000015153653,"about_ca_system_score_gemma":0.000026782043,"threshold_uncertainty_score":0.40459403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123956844,0.00041052766,0.86187243,0.0017514116,0.007324226,0.0023891171,0.0002517406,0.0007372632,0.0013064094],"genre_scores_gemma":[0.99377835,0.0000033709696,0.00049295486,0.0030945698,0.001997274,0.0004283381,0.0000157617,0.00004711156,0.00014226527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957786,0.00027243435,0.0010149117,0.0013518078,0.0006665868,0.0009156492],"domain_scores_gemma":[0.9976247,0.00048575847,0.00033338324,0.00052319514,0.00045447258,0.00057850516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008517418,0.0005145223,0.00072941225,0.000093317685,0.00044799602,0.0009475758,0.0013920867,0.00016444702,0.000015764484],"category_scores_gemma":[0.00013164192,0.0004812334,0.00043963114,0.00059689773,0.000040319905,0.0006116336,0.000109257904,0.00027908766,0.00044366432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010123095,0.001188458,0.009905949,0.005111761,0.0027865386,0.00051155285,0.05893118,0.55992997,0.023675818,0.117953174,0.055411577,0.16358171],"study_design_scores_gemma":[0.0028438452,0.0014829522,0.0011421408,0.0012996352,0.000041123876,0.00032484712,0.0012819311,0.8765015,0.0034058348,0.00023771114,0.109931715,0.0015067802],"about_ca_topic_score_codex":0.00028175258,"about_ca_topic_score_gemma":0.00019902068,"teacher_disagreement_score":0.8698215,"about_ca_system_score_codex":0.00028430886,"about_ca_system_score_gemma":0.00009441842,"threshold_uncertainty_score":0.9997639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012022345,0.0006028169,0.9672743,0.0036604588,0.015743764,0.00033415263,0.0000049896844,0.000045043536,0.00031212164],"genre_scores_gemma":[0.95414704,0.00006339722,0.03687614,0.0012431997,0.0075010695,0.000014980055,8.012281e-7,0.00003242919,0.00012091935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957193,0.00092783716,0.0016813091,0.0002586192,0.0011617751,0.00025115593],"domain_scores_gemma":[0.9945814,0.0016676825,0.0016486127,0.0006869862,0.0012743113,0.00014100212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026036224,0.00025648176,0.00056801684,0.00008886518,0.00017381551,0.0005676452,0.004801158,0.00008992314,0.0000089742],"category_scores_gemma":[0.00011768317,0.00014138359,0.00053770107,0.0002788209,0.00014833159,0.0003843525,0.00083963166,0.00036698862,0.000016243785],"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.00009648272,0.00035869644,0.00021985253,0.00022003113,0.0012016227,0.000057096455,0.011277779,0.025455605,0.0003209273,0.8922339,0.04290264,0.025655335],"study_design_scores_gemma":[0.0011779688,0.0003207484,0.0002314261,0.0006451818,0.000039803625,0.0010865779,0.0001815739,0.9384636,0.00046474082,0.016646959,0.040444065,0.00029734455],"about_ca_topic_score_codex":0.0000061307887,"about_ca_topic_score_gemma":0.0000015566259,"teacher_disagreement_score":0.9421247,"about_ca_system_score_codex":0.0000846448,"about_ca_system_score_gemma":0.00011285569,"threshold_uncertainty_score":0.8921826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5444023,0.000012511128,0.4328213,0.0038053894,0.0006831263,0.00015108367,0.0000010486551,0.00012488011,0.017998323],"genre_scores_gemma":[0.998777,0.0000039716283,0.00022278192,0.0005607783,0.0002943359,0.000008839692,2.1939738e-7,0.000004545568,0.00012757465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991989,0.00006261484,0.00020216053,0.00020421908,0.00017160359,0.00016047973],"domain_scores_gemma":[0.9993641,0.00010415847,0.00006337046,0.0003499323,0.000050905503,0.00006756035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016610317,0.00009612404,0.00014514328,0.000025410094,0.000071637136,0.00009307236,0.00056324445,0.000021184567,0.00002960483],"category_scores_gemma":[0.000019663132,0.000051540763,0.00014664447,0.00022286006,0.000012904329,0.0002872639,0.0001127503,0.00012817817,0.0000720866],"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.00031138843,0.00053013884,0.01579679,0.00012662097,0.0006254359,0.00007095258,0.04524599,0.07593104,0.018205209,0.27620432,0.15855658,0.40839553],"study_design_scores_gemma":[0.0006978696,0.001793202,0.030687435,0.000074280826,0.000008102133,0.000024254417,0.00057149015,0.9345807,0.026758676,0.0010124038,0.003368192,0.0004234063],"about_ca_topic_score_codex":0.00045030034,"about_ca_topic_score_gemma":0.00003182039,"teacher_disagreement_score":0.8586497,"about_ca_system_score_codex":0.000027489776,"about_ca_system_score_gemma":0.000015371199,"threshold_uncertainty_score":0.21017714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70949066,0.000005609708,0.2608901,0.00021887943,0.0023189008,0.000114468356,3.0740358e-7,0.00017924386,0.02678186],"genre_scores_gemma":[0.9908526,0.0000028909271,0.0024848063,0.0005812761,0.00009875452,0.00000984264,7.64337e-7,0.000004058332,0.005965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931544,0.000023374685,0.00013973836,0.0002142599,0.00014028035,0.00016692329],"domain_scores_gemma":[0.99953145,0.000039936276,0.000040151124,0.0003098472,0.00004353518,0.00003510415],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015284833,0.000072389754,0.00008828089,0.000057416186,0.00008381473,0.00009788407,0.0002536919,0.00003422848,0.00018710551],"category_scores_gemma":[0.0000030571382,0.000056329824,0.000036348727,0.00012035906,0.00000675113,0.00030733325,0.00004333425,0.000078851204,0.0013988946],"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.000011719448,0.0000654433,0.0075375317,0.000024269728,0.000021405782,0.0000040058185,0.00044726036,0.03754161,0.00041704252,0.9175223,0.00885984,0.027547572],"study_design_scores_gemma":[0.00041082854,0.00026335826,0.016533528,0.00008987003,0.0000010114949,0.000018059141,0.000028506292,0.9711339,0.0036906367,0.0007879649,0.0068214056,0.00022094288],"about_ca_topic_score_codex":0.000043555887,"about_ca_topic_score_gemma":0.000004556365,"teacher_disagreement_score":0.93359226,"about_ca_system_score_codex":0.000016850958,"about_ca_system_score_gemma":0.000008278455,"threshold_uncertainty_score":0.9993786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075454906,0.00018486766,0.9187672,0.00075106526,0.00058297446,0.00015540412,0.0000010321962,0.00026909108,0.0038334262],"genre_scores_gemma":[0.99289757,0.000018686893,0.004852237,0.0019640727,0.000115890834,0.0000130398585,0.0000012064609,0.0000114014165,0.00012587394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998465,0.00011277819,0.0005440811,0.00042853213,0.00016660367,0.00028299936],"domain_scores_gemma":[0.9991981,0.00008610802,0.00012685964,0.00032591113,0.00015969257,0.000103342776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020113951,0.00018334403,0.0003440625,0.00007776797,0.000058242284,0.0001303023,0.00091367314,0.000086327294,0.00007730907],"category_scores_gemma":[0.000056023575,0.00014460667,0.00016883337,0.00028583335,0.000028214956,0.00040769568,0.00044640581,0.00014285055,0.000054199638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041561172,0.00020606739,0.00019864253,0.0003193231,0.0005646172,0.00014061933,0.01684636,0.6532269,0.1732704,0.08753792,0.003721244,0.06355229],"study_design_scores_gemma":[0.00020942412,0.0003200298,0.0000017114712,0.0000342798,0.0000042760353,0.000028578894,0.00035959453,0.98927003,0.008083288,0.0009082285,0.0006101653,0.00017038669],"about_ca_topic_score_codex":0.00017544659,"about_ca_topic_score_gemma":0.000018664046,"teacher_disagreement_score":0.9174427,"about_ca_system_score_codex":0.000026606522,"about_ca_system_score_gemma":0.000023984068,"threshold_uncertainty_score":0.5896889},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02244738,0.00001691202,0.9545291,0.0010817678,0.00016336261,0.00022409245,0.00000304391,0.00017576331,0.021358546],"genre_scores_gemma":[0.9616227,0.000004086956,0.037671678,0.0005555439,0.00006555578,0.0000322642,0.0000022378772,0.000010622081,0.000035316752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992155,0.000013321315,0.00021075286,0.00026050163,0.00014087852,0.00015908295],"domain_scores_gemma":[0.9994144,0.00010254036,0.00008298376,0.00024994576,0.000026984104,0.00012319135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012064217,0.00011599526,0.00018151711,0.000024370802,0.00013133675,0.00017251994,0.00025131062,0.000043183598,0.00001829534],"category_scores_gemma":[0.000031324143,0.00010086717,0.00003577301,0.00020812689,0.000029239442,0.00016568271,0.00013964585,0.00008779359,0.000065307286],"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.0000020895468,0.000016074144,0.0000124256585,0.000052451793,0.000016469814,0.000001886955,0.0060214605,0.00006528525,0.0014684206,0.9897125,0.00084951177,0.0017814348],"study_design_scores_gemma":[0.0010139844,0.0001562798,0.00028700047,0.00005773488,0.000034696444,0.000041713232,0.003435821,0.8694136,0.0035422551,0.11262966,0.008701214,0.0006859957],"about_ca_topic_score_codex":0.000003170341,"about_ca_topic_score_gemma":0.000003671907,"teacher_disagreement_score":0.9391753,"about_ca_system_score_codex":0.000011293545,"about_ca_system_score_gemma":0.00001438592,"threshold_uncertainty_score":0.41132438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045286235,0.00012781173,0.96768904,0.020290429,0.00018219894,0.00018384516,9.3914514e-7,0.00017185105,0.006825257],"genre_scores_gemma":[0.98919016,0.0000021245319,0.0055683763,0.004460421,0.00012949691,0.0000083044715,4.1569186e-7,0.0000085004995,0.0006321874],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911,0.000060556933,0.00013649493,0.00029776554,0.00021534329,0.00017984193],"domain_scores_gemma":[0.99923056,0.00011545425,0.00005257902,0.00043970265,0.00006851383,0.00009317548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020453654,0.00011415546,0.00012450176,0.000018160987,0.00014958516,0.00038336968,0.0006513533,0.000037669033,0.000055047665],"category_scores_gemma":[0.000023305845,0.00006259646,0.000033828597,0.0001691525,0.000033034856,0.00030335714,0.0001922275,0.00014055608,0.000014147246],"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.00032080707,0.00018970163,0.018019505,0.00052385125,0.0006827454,0.0001879517,0.044136062,0.08547283,0.0037247988,0.083889164,0.7202957,0.042556856],"study_design_scores_gemma":[0.0005353581,0.00017985754,0.00068528217,0.000036763875,0.0000079150595,0.000015384921,0.000658509,0.9705463,0.0002678925,0.00007081884,0.026824616,0.00017131334],"about_ca_topic_score_codex":0.000098234865,"about_ca_topic_score_gemma":0.0001276407,"teacher_disagreement_score":0.9846616,"about_ca_system_score_codex":0.000010813842,"about_ca_system_score_gemma":0.000032824428,"threshold_uncertainty_score":0.36968428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06493147,0.0001547698,0.93140596,0.0004204818,0.00083053793,0.0007592405,0.000007861773,0.0003507822,0.0011389094],"genre_scores_gemma":[0.98769826,7.736e-7,0.010451184,0.0009613488,0.0006012511,0.00022218851,0.00000907541,0.0000308507,0.000025060346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767846,0.00028436133,0.00060704345,0.00067456043,0.00029849232,0.00045706207],"domain_scores_gemma":[0.99802905,0.00024870515,0.00024842334,0.0010217028,0.00022348878,0.0002286098],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007604719,0.00024734085,0.00039487073,0.00009857552,0.00038676092,0.0012975855,0.0029582053,0.00011429148,0.0000040928185],"category_scores_gemma":[0.000056618912,0.00022184703,0.00014478098,0.00049955404,0.000036367117,0.00048290708,0.00039385288,0.0002971504,0.000013655537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025810235,0.00007872706,0.00014410159,0.0002115404,0.000022560725,0.00000204099,0.0021712224,0.9921257,0.00039633617,0.0021559566,0.00069189473,0.0019741482],"study_design_scores_gemma":[0.0005093771,0.00016685654,0.000007954944,0.000109344284,0.000007842223,0.000009405785,0.00040047755,0.995695,0.0018724357,0.000019952107,0.0009250888,0.00027625723],"about_ca_topic_score_codex":0.0002498765,"about_ca_topic_score_gemma":0.000004668997,"teacher_disagreement_score":0.9227668,"about_ca_system_score_codex":0.00008210438,"about_ca_system_score_gemma":0.000064807784,"threshold_uncertainty_score":0.99973917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9562151,0.0008028762,0.03062443,0.0006032612,0.0010163777,0.0005009971,0.000076334945,0.00030150637,0.009859145],"genre_scores_gemma":[0.99658936,0.00016753895,0.0022950985,0.000210587,0.000071804956,0.000012250561,0.000019387233,0.00005056236,0.000583408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9951187,0.0010008318,0.0008867485,0.0014101043,0.0006648935,0.00091877306],"domain_scores_gemma":[0.994502,0.0015172606,0.0008389503,0.001385104,0.0013419589,0.000414724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001118114,0.0006284798,0.0013521017,0.0008515822,0.00041061486,0.00019393432,0.0010797493,0.0005102924,0.00018605967],"category_scores_gemma":[0.00059423916,0.0007127342,0.0005969285,0.0026793296,0.00038347152,0.001080348,0.00067460095,0.0005598102,0.000013467322],"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.0011227233,0.0018716827,0.050206088,0.0014827584,0.002564465,0.0022486034,0.017102597,0.0029204097,0.31830922,0.57283664,0.005776473,0.02355834],"study_design_scores_gemma":[0.022880504,0.00518255,0.4072768,0.0026218027,0.0007272366,0.003928634,0.009748738,0.2305666,0.24654517,0.053825185,0.009794235,0.0069025373],"about_ca_topic_score_codex":0.00047977202,"about_ca_topic_score_gemma":0.0010440999,"teacher_disagreement_score":0.51901144,"about_ca_system_score_codex":0.00019604579,"about_ca_system_score_gemma":0.0005555303,"threshold_uncertainty_score":0.9995324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016333702,0.00020020241,0.9950682,0.0006213888,0.0005749839,0.0017385079,0.000004224597,0.00010941703,0.00004969698],"genre_scores_gemma":[0.91492176,0.000009458345,0.08208041,0.0006857738,0.0008903882,0.0013575346,0.000015355592,0.000012345916,0.00002696492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985465,0.00024480798,0.00045554162,0.00035322973,0.0001327231,0.00026723064],"domain_scores_gemma":[0.9994432,0.000082246625,0.00015380167,0.00011785337,0.000112386806,0.00009051466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006565066,0.00013341915,0.00019625275,0.00002122078,0.0003569543,0.0005839272,0.00015677164,0.00004956965,0.0000075836524],"category_scores_gemma":[0.000018256736,0.00012409587,0.000039711318,0.00018991885,0.000009992591,0.00040389624,0.00003823692,0.000058625785,0.0000040663745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007070005,0.00004094519,0.0012996774,0.00059287576,0.00013758587,0.0000126038,0.01567538,0.6576951,0.07687906,0.1480006,0.083221845,0.01637363],"study_design_scores_gemma":[0.00048022936,0.0003940917,0.00002467195,0.000060866605,0.0000071614804,0.000028665925,0.00046240556,0.98565894,0.0052172234,0.00006464865,0.007416193,0.0001849248],"about_ca_topic_score_codex":0.0000791566,"about_ca_topic_score_gemma":0.0000040269347,"teacher_disagreement_score":0.9132884,"about_ca_system_score_codex":0.000029525256,"about_ca_system_score_gemma":0.000040979707,"threshold_uncertainty_score":0.56308234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62542933,0.0014668193,0.33357304,0.037759073,0.0005013358,0.00046647113,4.835473e-7,0.00010689838,0.00069651456],"genre_scores_gemma":[0.99737346,0.00003431652,0.0009598752,0.0012396635,0.0003171777,0.000052957836,3.4281086e-7,0.000009464479,0.000012727603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985032,0.00026828298,0.00034519634,0.00033429757,0.00032176188,0.00022726502],"domain_scores_gemma":[0.99920976,0.00014950735,0.00017528154,0.00019732429,0.0002152284,0.00005291566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092932186,0.00012769901,0.00021104579,0.00009117723,0.00036927586,0.00015002395,0.00036123392,0.00006022134,0.0000031437698],"category_scores_gemma":[0.000077515346,0.00008457424,0.00004371529,0.00054381887,0.00014916569,0.00028587168,0.00013589172,0.00033306787,0.0000017184921],"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.0011592797,0.0007163636,0.0037155927,0.0025383523,0.00061337353,0.000017197388,0.20163794,0.03660454,0.08013738,0.060731456,0.017697332,0.5944312],"study_design_scores_gemma":[0.0012234414,0.00067078543,0.0046405373,0.0020089434,0.000024607216,0.000052627594,0.007242376,0.8795181,0.035182063,0.00023903018,0.06837962,0.00081787095],"about_ca_topic_score_codex":0.00004657679,"about_ca_topic_score_gemma":0.000025961534,"teacher_disagreement_score":0.84291357,"about_ca_system_score_codex":0.000043973825,"about_ca_system_score_gemma":0.00006376554,"threshold_uncertainty_score":0.34488374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037384524,0.000089813344,0.98833555,0.00072420697,0.0048517683,0.0017756005,0.00009133893,0.00035833425,0.00003492114],"genre_scores_gemma":[0.94642496,0.000015616277,0.051406488,0.0014051885,0.00034080257,0.0002930931,0.000004847553,0.000045664125,0.00006335122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966511,0.000460364,0.0010231172,0.0009723381,0.00040918883,0.00048390613],"domain_scores_gemma":[0.99679774,0.0012853076,0.0003253681,0.0005778849,0.000656963,0.00035671538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005843718,0.00046962567,0.00082899275,0.0003313731,0.0003757854,0.00045343692,0.0006678227,0.00035470433,0.000008912332],"category_scores_gemma":[0.00003442758,0.00041357713,0.00027480946,0.001173645,0.00004710498,0.0003352857,0.0000053441945,0.00045162576,0.00001900156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029332476,0.00018560892,0.0000048389647,0.00018959583,0.0002427831,0.000008102583,0.000945551,0.94577175,0.003361372,0.0049018217,0.0021104286,0.04198484],"study_design_scores_gemma":[0.00089778285,0.0047527812,0.000008992454,0.00068306515,0.00004233115,0.000043307937,0.00013875598,0.98673946,0.004726929,0.0005835557,0.0008920916,0.0004909221],"about_ca_topic_score_codex":0.00045650717,"about_ca_topic_score_gemma":0.000015667405,"teacher_disagreement_score":0.9426865,"about_ca_system_score_codex":0.00016618903,"about_ca_system_score_gemma":0.00023961949,"threshold_uncertainty_score":0.9998316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013346819,0.00007268371,0.9842525,0.006074825,0.0003670608,0.00017298767,0.000017091532,0.00026217996,0.0074459757],"genre_scores_gemma":[0.9902499,0.000009793936,0.006166557,0.002993025,0.00035815092,0.0000056053022,0.000041227428,0.0000144158,0.00016135172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864,0.000065833796,0.00023179683,0.00060562347,0.00018191543,0.0002748247],"domain_scores_gemma":[0.99889416,0.00005004208,0.000052729,0.0007804687,0.000047228146,0.00017537463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099174285,0.00017574013,0.000213052,0.000031433174,0.00007963238,0.00019211437,0.0013860863,0.000059203358,0.0001490957],"category_scores_gemma":[0.0000069235903,0.00011570109,0.000043883803,0.00023981351,0.00002898574,0.00031731595,0.00025750117,0.0002346992,0.000022494034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012771849,0.000969566,0.013096542,0.00025618786,0.001700978,0.0006569021,0.020551523,0.34520152,0.0006656234,0.086800724,0.30241215,0.22641109],"study_design_scores_gemma":[0.00082980783,0.0002343918,0.00010394288,0.00004176011,0.000008661107,0.0000970165,0.000090268615,0.94529945,0.000038269554,0.000028246923,0.052991647,0.00023653332],"about_ca_topic_score_codex":0.000031887022,"about_ca_topic_score_gemma":0.00051743287,"teacher_disagreement_score":0.9889152,"about_ca_system_score_codex":0.000009856546,"about_ca_system_score_gemma":0.000014094143,"threshold_uncertainty_score":0.47181535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10430798,0.0003187726,0.892747,0.0019239524,0.00020024422,0.00020458769,0.000002439874,0.000068553454,0.00022647742],"genre_scores_gemma":[0.9942222,0.00007390856,0.00496481,0.00054206135,0.000066069806,0.00011722626,0.000010175744,0.0000026692683,8.48477e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989286,0.00006541618,0.00027735982,0.00040704483,0.00014831814,0.00017324807],"domain_scores_gemma":[0.9994144,0.00014069241,0.000118981356,0.000090645575,0.000089441986,0.00014585577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015115205,0.000111713416,0.00013317629,0.00002919792,0.0001766308,0.0003295831,0.00014539849,0.00003711639,9.598263e-7],"category_scores_gemma":[0.00007728308,0.000115794086,0.0000134825705,0.0005315084,0.000033772663,0.00081653014,0.000092883354,0.00009808633,0.00000690423],"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.00028985814,0.0002155491,0.0355817,0.00013940723,0.00004514255,0.000038923823,0.11296146,0.16548404,0.00065195817,0.28735262,0.0008253676,0.39641395],"study_design_scores_gemma":[0.0011478292,0.00030125317,0.015296848,0.000097943004,0.000012288561,0.00005837402,0.019347483,0.9487547,0.000181981,0.005506581,0.008722337,0.00057236734],"about_ca_topic_score_codex":0.00006756894,"about_ca_topic_score_gemma":0.0000036728543,"teacher_disagreement_score":0.8899143,"about_ca_system_score_codex":0.000023246443,"about_ca_system_score_gemma":0.000020311225,"threshold_uncertainty_score":0.47219458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000950398,0.00015491186,0.99063313,0.0019208359,0.0013146593,0.0017748915,0.00006556459,0.0038518095,0.0001891724],"genre_scores_gemma":[0.81241655,0.0000040271175,0.18608357,0.00010157849,0.00023350425,0.0010896546,0.000008563714,0.000026019312,0.000036521964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975863,0.0000796548,0.00076243514,0.00079676724,0.00027413073,0.00050067523],"domain_scores_gemma":[0.99836844,0.00029203418,0.00029513595,0.0007321964,0.00024963374,0.00006255347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069569406,0.00030045834,0.00042100414,0.000237601,0.0004313753,0.00050311594,0.0013672503,0.00041591492,0.0000015483008],"category_scores_gemma":[0.00023101052,0.0002677756,0.00016842349,0.00078348577,0.00008013747,0.00022970194,0.0002548646,0.0003827943,0.000035473775],"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.00014427467,0.00038152796,0.000105554675,0.001475263,0.00021077014,0.000099159515,0.0015330885,0.29903898,0.06663348,0.40276307,0.009719272,0.21789558],"study_design_scores_gemma":[0.00007851613,0.0004921039,6.4892555e-7,0.00033030377,0.0000074197796,0.000040700303,0.0013917708,0.9348487,0.05726254,0.00020434079,0.0050689913,0.00027393538],"about_ca_topic_score_codex":0.00002480981,"about_ca_topic_score_gemma":0.0000034218194,"teacher_disagreement_score":0.81232154,"about_ca_system_score_codex":0.00016044697,"about_ca_system_score_gemma":0.00007691672,"threshold_uncertainty_score":0.99997747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017565493,0.000049920105,0.97839224,0.0035166459,0.00027615548,0.00009303186,0.0000020626833,0.000015654627,0.000088766785],"genre_scores_gemma":[0.9818042,0.000021030224,0.017500853,0.00028109053,0.00036816997,0.0000035336243,5.223664e-7,0.0000039763495,0.000016608214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994305,0.000022146241,0.00023745508,0.00010628633,0.00010696728,0.00009667919],"domain_scores_gemma":[0.9992095,0.00003828475,0.000248738,0.000057018962,0.0003745131,0.00007190285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010254249,0.000077894074,0.00017293802,0.000025504847,0.00008802387,0.00018733613,0.00019679793,0.000027913593,0.0000015889732],"category_scores_gemma":[0.000022507575,0.00006475506,0.00006625239,0.000090686684,0.000024500067,0.0008702015,0.000036544414,0.00009525827,6.4621327e-7],"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.00008539722,0.000031300417,0.0003291299,0.00023137426,0.00008801866,0.000007232893,0.011746689,0.0003331533,0.027794914,0.7373757,0.0016128741,0.22036424],"study_design_scores_gemma":[0.0026512004,0.0029472406,0.003546638,0.00097564596,0.000051691943,0.00054252654,0.0035711275,0.4972244,0.13441291,0.33989605,0.013336888,0.00084366533],"about_ca_topic_score_codex":8.685855e-7,"about_ca_topic_score_gemma":9.528901e-7,"teacher_disagreement_score":0.9642387,"about_ca_system_score_codex":0.0000072462944,"about_ca_system_score_gemma":0.00006046423,"threshold_uncertainty_score":0.26406348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083701506,0.00007310163,0.87963134,0.00941107,0.0016802392,0.00031459163,8.1936713e-7,0.00044274493,0.02474457],"genre_scores_gemma":[0.9892013,0.000007608115,0.001700268,0.0077506537,0.0008669235,0.000021139489,0.0000016389871,0.000013320777,0.0004371129],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822015,0.00013417986,0.0004349985,0.00052952336,0.00024099111,0.0004401845],"domain_scores_gemma":[0.9991899,0.00013032477,0.00009170057,0.00037538135,0.000046529352,0.0001661456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036387902,0.00017847681,0.00028925875,0.00008498415,0.000101422746,0.00021642572,0.00072856375,0.00010686209,0.000042299194],"category_scores_gemma":[0.000021579814,0.00015788405,0.00009877016,0.00071924645,0.000018451703,0.00023790884,0.00020229754,0.00029684432,0.00013474286],"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.00012542323,0.00023906042,0.009280463,0.00013120471,0.00013834442,0.0007619744,0.009937316,0.096505895,0.00087482965,0.29935434,0.43108875,0.1515624],"study_design_scores_gemma":[0.00042224137,0.00010800548,0.00041678982,0.00010724834,7.571704e-7,0.000021013466,0.00008517512,0.97447914,0.0001833407,0.0006279519,0.023307122,0.00024118651],"about_ca_topic_score_codex":0.00006112136,"about_ca_topic_score_gemma":0.00006727083,"teacher_disagreement_score":0.9054998,"about_ca_system_score_codex":0.00004425846,"about_ca_system_score_gemma":0.000040204257,"threshold_uncertainty_score":0.64383245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5139677,0.00021880033,0.48197737,0.0027168293,0.0001935394,0.00014882823,8.568903e-7,0.000079472455,0.00069662725],"genre_scores_gemma":[0.9958741,0.000030105632,0.0011855437,0.0027842375,0.00009509326,0.000021636555,0.0000013821058,0.000004971458,0.0000028971706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.00017087016,0.00020014134,0.00042576462,0.00022279708,0.00016573959],"domain_scores_gemma":[0.99894154,0.0005029561,0.00014195779,0.00015839368,0.00013720227,0.00011797453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028105464,0.00013600549,0.00012207535,0.000020095209,0.00045861455,0.00043173967,0.00022178555,0.000032984924,0.0000040126647],"category_scores_gemma":[0.00014568886,0.00008754537,0.000015840493,0.00023869118,0.0000871379,0.000646436,0.00006078755,0.00017658283,0.00000516283],"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.0002135586,0.00041780758,0.0032581722,0.00003777392,0.000064105974,0.00010191926,0.29508832,0.09207137,0.0008915562,0.35521647,0.00049247657,0.25214645],"study_design_scores_gemma":[0.00019137494,0.00045164523,0.0006314924,0.00005171722,0.0000071502786,0.000095392534,0.010442647,0.9864402,0.00010630612,0.00004115383,0.0013775371,0.0001634279],"about_ca_topic_score_codex":0.000022191998,"about_ca_topic_score_gemma":9.4119287e-7,"teacher_disagreement_score":0.89436877,"about_ca_system_score_codex":0.000008062011,"about_ca_system_score_gemma":0.00003116088,"threshold_uncertainty_score":0.41632754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09944036,0.00005303828,0.8350407,0.0011629006,0.0013217903,0.00007202916,1.0346544e-7,0.00013213686,0.06277693],"genre_scores_gemma":[0.99505645,0.0000063177613,0.0028979508,0.00017445018,0.00011919182,0.000002785647,7.776426e-8,0.0000030958906,0.0017396994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994292,0.000030861192,0.00012333658,0.00021156594,0.00006993472,0.00013505427],"domain_scores_gemma":[0.9992815,0.000042348467,0.00008660122,0.0005053725,0.000034444023,0.000049695882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031747654,0.000065406515,0.000092003436,0.000026039239,0.00048646796,0.00083370396,0.00048670082,0.000036493162,0.000019614932],"category_scores_gemma":[0.000062043524,0.000047618872,0.000027880584,0.00001893352,0.000022393886,0.00070743466,0.00036058438,0.00006411326,0.000029648869],"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.000004906519,0.00002073584,0.015563199,0.000016571355,0.000023892835,0.000023368484,0.001312983,0.000016693692,0.0011292722,0.5852245,0.003229269,0.3934346],"study_design_scores_gemma":[0.0005788821,0.00012488973,0.015075568,0.0002263266,0.000004280917,0.00017859209,0.0003696195,0.96001315,0.002813046,0.0050358907,0.015200597,0.00037916593],"about_ca_topic_score_codex":0.00012195702,"about_ca_topic_score_gemma":0.000081393184,"teacher_disagreement_score":0.95999646,"about_ca_system_score_codex":0.000010018065,"about_ca_system_score_gemma":0.000007498187,"threshold_uncertainty_score":0.8039427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15030333,0.000006748883,0.8404462,0.00009750915,0.0009790477,0.000050218903,1.3392001e-7,0.000090641784,0.008026189],"genre_scores_gemma":[0.98432654,3.578436e-7,0.014106998,0.00013483907,0.00020461778,8.470414e-7,1.7754545e-7,0.0000030610377,0.00122256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953496,0.000014837122,0.000106950254,0.00015918566,0.00007831971,0.00010575655],"domain_scores_gemma":[0.99965096,0.000038436872,0.00003058439,0.0001887968,0.000048998227,0.000042211068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015304267,0.00005207044,0.00006100587,0.00004227101,0.000108004424,0.00018953654,0.00011653633,0.000042576346,0.00004246996],"category_scores_gemma":[0.00000833749,0.00004274738,0.000017203256,0.000103353595,0.000013354876,0.00035159095,0.000062598156,0.00007705663,0.000021168691],"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.000009068627,0.000060107745,0.0050136335,0.00002457665,0.000026073485,0.00000809294,0.0019232428,0.3980117,0.032560673,0.43059415,0.0019575637,0.12981111],"study_design_scores_gemma":[0.000075669865,0.000013502654,0.00028125156,0.00000431963,8.166624e-7,0.000018338738,0.000014334506,0.9920477,0.0006137597,0.000530616,0.006338879,0.000060760995],"about_ca_topic_score_codex":0.000064177715,"about_ca_topic_score_gemma":0.00006159773,"teacher_disagreement_score":0.83402324,"about_ca_system_score_codex":0.0000057728503,"about_ca_system_score_gemma":0.000010798901,"threshold_uncertainty_score":0.18277052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039622583,0.000104970066,0.9897101,0.0021205181,0.00019057358,0.00066735793,0.000009459251,0.00012382993,0.003110926],"genre_scores_gemma":[0.9887134,0.000005856603,0.0068272864,0.00090406527,0.00014318364,0.0007564893,0.000027870065,0.000015977108,0.0026058976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985748,0.000059626705,0.00030090145,0.0005300669,0.00019098079,0.0003436149],"domain_scores_gemma":[0.99893457,0.000120433775,0.00006588091,0.00054990005,0.00023818169,0.00009105354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025413313,0.00016712748,0.00023419368,0.00010548294,0.00012246038,0.00013906206,0.00040309297,0.00009334244,0.00005748363],"category_scores_gemma":[0.000006577452,0.00013732677,0.00011083742,0.0005950651,0.000032807977,0.00021387529,0.000025528572,0.000120058176,0.0000303332],"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.00038846058,0.004178308,0.015617941,0.0011728737,0.00047246864,0.00052646815,0.009001458,0.13951044,0.0027676958,0.7167015,0.029852347,0.07981003],"study_design_scores_gemma":[0.004230503,0.0003759465,0.005017568,0.00022212138,0.000025652573,0.00012989163,0.00022498144,0.92508334,0.005456562,0.0017084458,0.05670075,0.0008242371],"about_ca_topic_score_codex":0.00006675475,"about_ca_topic_score_gemma":0.0020153078,"teacher_disagreement_score":0.9847511,"about_ca_system_score_codex":0.00005543965,"about_ca_system_score_gemma":0.00016036785,"threshold_uncertainty_score":0.5600023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01114202,0.00009785793,0.9776603,0.00019722794,0.0005380837,0.000051185496,8.1368086e-7,0.000041187413,0.010271323],"genre_scores_gemma":[0.96631956,0.0000014673789,0.030429702,0.000115985415,0.00009249233,0.000006930278,6.2088367e-7,0.000002789555,0.0030304347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999512,0.000022558828,0.00016204883,0.00014043528,0.00006521774,0.00009773594],"domain_scores_gemma":[0.99944735,0.0001617049,0.000037393118,0.00018174989,0.00014973205,0.000022083632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012497269,0.00004059241,0.00010253712,0.000021152158,0.000038712475,0.000041434534,0.00014456891,0.000020673426,0.000022255283],"category_scores_gemma":[0.000077176985,0.000034078766,0.00006107544,0.00012908092,0.0000065692025,0.00007782671,0.000049040147,0.000021957565,0.0000044084804],"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.000010019144,0.00013666069,0.001125744,0.00014389056,0.00006722756,0.000025980584,0.0016239799,0.0023557723,0.014711128,0.864868,0.021038394,0.0938932],"study_design_scores_gemma":[0.00036837542,0.000114815935,0.0005433744,0.000072397546,0.0000057702628,0.00012721254,0.00033932796,0.96493024,0.011682731,0.0030093,0.018660195,0.0001462467],"about_ca_topic_score_codex":0.000016774673,"about_ca_topic_score_gemma":0.000055825156,"teacher_disagreement_score":0.9625745,"about_ca_system_score_codex":0.0000066835064,"about_ca_system_score_gemma":0.000028218728,"threshold_uncertainty_score":0.13896918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35110942,0.000002299259,0.6241878,0.000017618897,0.00043743465,0.000084419975,4.0565723e-7,0.000054841148,0.024105757],"genre_scores_gemma":[0.95651793,1.7082475e-7,0.043158066,0.000049466642,0.0000978184,0.0000036358745,0.0000013019176,0.0000044689923,0.000167125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.00003258539,0.00042506628,0.00023883158,0.00024790873,0.00023810191],"domain_scores_gemma":[0.99927694,0.00007809688,0.00006802708,0.00038491946,0.000084082654,0.00010794623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847522,0.00008445942,0.00017982355,0.00012028763,0.000035827226,0.000077034165,0.00043107822,0.000079707796,0.000012061431],"category_scores_gemma":[0.0000047739513,0.000067607274,0.000036311478,0.00021773351,0.000015252606,0.0006028231,0.000068042515,0.00010319707,0.0000058308824],"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.0000066990087,0.00014152197,0.0024934511,0.000025068593,0.0000065083777,0.000032374435,0.0004640751,0.00095129514,0.0006305318,0.9826702,0.000050468847,0.012527802],"study_design_scores_gemma":[0.0003400712,0.00035329032,0.031434324,0.00007053794,0.0000013164263,0.000059504826,0.001212239,0.96487564,0.0012898806,0.00012695072,0.000100101795,0.00013614932],"about_ca_topic_score_codex":0.00016958146,"about_ca_topic_score_gemma":0.0013346875,"teacher_disagreement_score":0.98254323,"about_ca_system_score_codex":0.00012082634,"about_ca_system_score_gemma":0.000042668376,"threshold_uncertainty_score":0.27569446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08053686,0.00011318207,0.9020331,0.000111227026,0.00048172392,0.00013977819,1.9829734e-7,0.00017830385,0.016405614],"genre_scores_gemma":[0.986821,0.000006127514,0.011644899,0.00016747462,0.00028455694,0.000006225965,8.231065e-7,0.00000844111,0.0010604371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916786,0.00007468963,0.00016985048,0.00030124234,0.0001239744,0.00016237091],"domain_scores_gemma":[0.99954706,0.000037693626,0.000067873916,0.00022103084,0.00007769492,0.000048660542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021414382,0.000111598936,0.0001165171,0.00006145131,0.000082950275,0.000155572,0.00023164132,0.000051577546,0.00006310298],"category_scores_gemma":[0.000011168092,0.00007630862,0.000024485167,0.00014870818,0.0000300994,0.00031220226,0.000098464894,0.000084812586,0.000010656549],"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.0005373945,0.00046270314,0.033471134,0.00038348752,0.0004180566,0.00025649823,0.10388059,0.00034983474,0.00307231,0.5796323,0.02398015,0.2535556],"study_design_scores_gemma":[0.001013338,0.0006645316,0.0077467537,0.0003124116,0.000022221222,0.0005322402,0.0022951886,0.9500038,0.00612835,0.00016497636,0.030583754,0.00053245947],"about_ca_topic_score_codex":0.00012894828,"about_ca_topic_score_gemma":0.00019149572,"teacher_disagreement_score":0.9496539,"about_ca_system_score_codex":0.000009325092,"about_ca_system_score_gemma":0.00001052709,"threshold_uncertainty_score":0.31117752},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056122977,0.000061474464,0.91313696,0.00013268946,0.00036507,0.00006275785,4.719218e-8,0.00009948974,0.030018512],"genre_scores_gemma":[0.99552625,0.000001910963,0.0032293615,0.00012181635,0.00020944161,0.0000031451468,3.0688634e-7,0.0000033136137,0.00090444443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992634,0.00004117747,0.0002125737,0.0002068556,0.00007034474,0.00020566933],"domain_scores_gemma":[0.99971426,0.00007170226,0.000043330852,0.00012505661,0.000021981743,0.000023661858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003429635,0.000067662004,0.00009676976,0.000045324392,0.00007115651,0.00016920228,0.00013739077,0.00004433784,0.000005757545],"category_scores_gemma":[0.000008702026,0.000057695346,0.000018873428,0.00020712055,0.000009131823,0.00021726268,0.00009402333,0.000091964765,0.0000033960596],"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.0000035178161,0.0000387426,0.083052255,0.000010369143,0.000006584171,0.00003968431,0.00040237588,0.037329447,0.00011570899,0.8153487,0.00490167,0.058750972],"study_design_scores_gemma":[0.00013189598,0.000010172728,0.008084382,0.000025462505,3.605106e-7,0.000029304783,0.000037350917,0.9906821,0.000017270586,0.00043662495,0.00046522534,0.00007983299],"about_ca_topic_score_codex":0.0007415753,"about_ca_topic_score_gemma":0.00048860424,"teacher_disagreement_score":0.9533527,"about_ca_system_score_codex":0.000018902367,"about_ca_system_score_gemma":0.000005363948,"threshold_uncertainty_score":0.23527479},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90129995,0.006324132,0.004906917,0.00051745964,0.002618438,0.0012883629,0.000010696757,0.000063276464,0.08297077],"genre_scores_gemma":[0.99502105,0.0005955945,0.00063417805,0.000010835777,0.00005037042,0.0000011037781,0.00005013137,0.000006091683,0.0036306446],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990571,0.000060451275,0.000106794214,0.00037911747,0.00023084518,0.00016566418],"domain_scores_gemma":[0.99911565,0.000023103152,0.00034598375,0.00034883164,0.00011092365,0.000055513738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047979172,0.0001394267,0.00025436995,0.000041474974,0.00020734426,0.00007618077,0.00041862004,0.00014183286,0.00015775893],"category_scores_gemma":[0.0000123471955,0.00016827074,0.00003246941,0.000029204555,0.000030038844,0.00081891933,0.0001024264,0.00010324977,0.0000010130206],"study_design_candidate":"design_other","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.00021221777,0.00006594596,0.0021524404,0.00045340962,0.00012302621,0.000012164588,0.04477319,0.0002971146,0.00027634812,0.0028904993,0.0016949184,0.9470487],"study_design_scores_gemma":[0.003416124,0.0004636793,0.6280421,0.0014797274,0.00014239034,0.0000064667192,0.03228926,0.32964054,0.000033356126,0.00031496683,0.0033602042,0.00081120175],"about_ca_topic_score_codex":0.051349968,"about_ca_topic_score_gemma":0.24269928,"teacher_disagreement_score":0.9462375,"about_ca_system_score_codex":0.0001524831,"about_ca_system_score_gemma":0.00006184188,"threshold_uncertainty_score":0.9549672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028304306,0.00044315183,0.8988383,0.0014873978,0.0068954164,0.00012029161,7.3933e-7,0.00039539908,0.08898889],"genre_scores_gemma":[0.9375258,0.000044685967,0.018008126,0.008713449,0.007467994,0.000032325002,0.0000056024355,0.00003244819,0.02816956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785054,0.00020799485,0.0003826706,0.00058614847,0.0003337284,0.0006389163],"domain_scores_gemma":[0.998133,0.00031252322,0.00009134213,0.001155712,0.00015839063,0.00014905771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221373,0.00019785849,0.00026944652,0.00004562814,0.0003234582,0.00043793762,0.00089494215,0.0001198047,0.00024390688],"category_scores_gemma":[0.000071978546,0.00017251507,0.00015969384,0.00083407515,0.000020664855,0.00027294687,0.00050754927,0.00026457754,0.00030532762],"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.0000062387003,0.00002985304,0.00019282498,0.0000031698385,0.000033563832,0.00007777802,0.00013961236,0.09477561,0.000025618949,0.6623355,0.23422198,0.008158229],"study_design_scores_gemma":[0.0010094309,0.0003888898,0.00043390086,0.0002474956,0.000011191712,0.00026118205,0.00014706397,0.5368491,0.00044473473,0.026850019,0.43258262,0.0007744122],"about_ca_topic_score_codex":0.000024265113,"about_ca_topic_score_gemma":0.00016128118,"teacher_disagreement_score":0.93469536,"about_ca_system_score_codex":0.000044656863,"about_ca_system_score_gemma":0.00008989503,"threshold_uncertainty_score":0.70349604},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77130467,0.0020328623,0.21411094,0.00033941848,0.0049904827,0.0002456314,0.0000012203344,0.00014701489,0.0068277847],"genre_scores_gemma":[0.99852526,0.0008289701,0.00026618943,0.000055133627,0.000029773815,0.000007093905,6.7727103e-7,0.0000050596677,0.00028181932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927056,0.000043911965,0.00019978886,0.00022569427,0.00010256935,0.00015745714],"domain_scores_gemma":[0.99949145,0.000059199767,0.00009520325,0.00020759198,0.00007807167,0.000068488305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016249123,0.000111347894,0.00018009235,0.0000959472,0.00013712072,0.00007774864,0.00013837712,0.00008403367,0.000003543999],"category_scores_gemma":[0.000008111763,0.00009789947,0.000042462885,0.00033871934,0.000060814727,0.00021620191,0.000058470454,0.00010715115,7.4960764e-7],"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.000018182338,0.000033819182,0.005570754,0.000011607778,0.000017182108,0.000004031947,0.000100003694,0.00021749009,0.000008312097,0.96733654,0.0010988532,0.02558322],"study_design_scores_gemma":[0.0025891215,0.0020585316,0.023819022,0.00026727762,0.000029750288,0.0010925493,0.00035509554,0.2242484,0.00019446661,0.7338864,0.010644798,0.000814573],"about_ca_topic_score_codex":0.000019704556,"about_ca_topic_score_gemma":0.000006383722,"teacher_disagreement_score":0.23345011,"about_ca_system_score_codex":0.000008961792,"about_ca_system_score_gemma":0.000008341628,"threshold_uncertainty_score":0.39922246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.132284,0.00016813437,0.8409973,0.0002614028,0.0013952918,0.000227784,0.000004198396,0.000137826,0.024524067],"genre_scores_gemma":[0.95651376,0.000024489484,0.041697096,0.00035992928,0.00004681447,0.000015580046,0.0000027862698,0.00001983268,0.0013197268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986424,0.000032034848,0.00046874097,0.00027333375,0.000345902,0.00023763123],"domain_scores_gemma":[0.9984866,0.00018051689,0.00020683481,0.0008180503,0.00023743507,0.000070577975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003193665,0.00015022057,0.00030115285,0.00009241804,0.00008318067,0.00009376658,0.00048849796,0.00008331721,0.000062095394],"category_scores_gemma":[0.00005599556,0.0001285995,0.0001332359,0.00055672973,0.00004400492,0.00015387783,0.00013238633,0.00013702115,0.000070079426],"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.0000034992338,0.00023861631,0.00010800871,0.00013415048,0.0000356963,0.00008206038,0.0005574067,0.00072048977,0.00030517537,0.98976034,0.0066311858,0.0014233635],"study_design_scores_gemma":[0.0004721351,0.00033380542,0.00010660889,0.00074832584,0.000023754037,0.00036296682,0.00021088573,0.31815264,0.0057377648,0.67208076,0.0014250568,0.00034532513],"about_ca_topic_score_codex":0.000018862836,"about_ca_topic_score_gemma":0.000043486485,"teacher_disagreement_score":0.8242298,"about_ca_system_score_codex":0.000016459548,"about_ca_system_score_gemma":0.00006543282,"threshold_uncertainty_score":0.5244135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7080579,0.00030066475,0.2883947,0.0015498543,0.0010146765,0.000065810724,4.812915e-7,0.000017289423,0.00059864746],"genre_scores_gemma":[0.98545414,0.000013808775,0.01343659,0.00056570617,0.00044513374,6.430205e-7,2.2430004e-7,0.000008623387,0.0000751459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820405,0.00030513757,0.00072859204,0.00015395701,0.00031357823,0.00029470064],"domain_scores_gemma":[0.99884486,0.00026991556,0.00015229196,0.00029785943,0.00034815617,0.00008693285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024856543,0.00011540228,0.00026079227,0.00011197534,0.00016480211,0.0003102987,0.0007610755,0.000043773918,0.000013959304],"category_scores_gemma":[0.000095057454,0.00007597813,0.00011349814,0.0005195137,0.000023884715,0.0004185846,0.00033419282,0.00037098696,0.000022750954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082867,0.00036231684,0.051346395,0.00014574693,0.00016065419,0.0011195501,0.07091975,0.7726028,0.020380951,0.018167123,0.0070515727,0.057660248],"study_design_scores_gemma":[0.0017678164,0.00045391807,0.038554378,0.0020524669,0.0000220821,0.007881524,0.004822286,0.9242213,0.006187343,0.0045347107,0.008819983,0.000682234],"about_ca_topic_score_codex":0.00005639366,"about_ca_topic_score_gemma":0.000034456127,"teacher_disagreement_score":0.27739623,"about_ca_system_score_codex":0.00007916308,"about_ca_system_score_gemma":0.00010052004,"threshold_uncertainty_score":0.30982983},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051643987,0.0006897758,0.38519764,0.00021724186,0.0015564415,0.00042971267,0.000038023853,0.00017623654,0.61164325],"genre_scores_gemma":[0.016063655,0.00023829605,0.03906006,0.00022440171,0.00061946636,0.0002482075,0.000068425994,0.000124964,0.9433525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803364,0.000030435991,0.0007179393,0.0005669245,0.00032123667,0.00032982975],"domain_scores_gemma":[0.99780643,0.0007028275,0.00035461542,0.00092672807,0.00014542315,0.000063976106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079229294,0.00041161934,0.00096912426,0.00052980724,0.00010224855,0.00020287558,0.0006654398,0.0003693365,0.00012888391],"category_scores_gemma":[0.00005203207,0.00036958145,0.00050352723,0.00017319407,0.0000626658,0.00014114266,0.00018519873,0.0003493902,0.000015336544],"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.000010476923,0.00005453925,0.0000026066512,0.00020747617,0.00009289467,0.000025763267,0.0011855399,0.00015153873,0.00000386163,0.9821554,0.00861871,0.007491208],"study_design_scores_gemma":[0.0029256495,0.00016476553,0.000005206445,0.0015183124,0.00007180031,0.0001118483,0.00018427757,0.15047918,0.000045518547,0.7783764,0.065084785,0.0010322519],"about_ca_topic_score_codex":0.0000058396727,"about_ca_topic_score_gemma":0.00020952486,"teacher_disagreement_score":0.34613758,"about_ca_system_score_codex":0.000092946524,"about_ca_system_score_gemma":0.00004836485,"threshold_uncertainty_score":0.9998756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43815622,0.0002506592,0.5229106,0.0021117874,0.001341273,0.0001799517,0.0000074158265,0.000117590935,0.0349245],"genre_scores_gemma":[0.9977203,0.00005053324,0.00072709733,0.0001422041,0.000048950496,0.0000035854168,0.0000022304923,0.000006393894,0.0012987283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887294,0.00021982352,0.00016297137,0.0002676821,0.00021296105,0.00026362934],"domain_scores_gemma":[0.99871105,0.00029508697,0.00013528451,0.0005137966,0.00025894033,0.00008583194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033579327,0.00010016464,0.00015435074,0.000086901506,0.00034544614,0.00013652023,0.00045466062,0.00007082761,0.000034120465],"category_scores_gemma":[0.000051450752,0.00008928679,0.00015071874,0.00071713293,0.000085960215,0.00035143728,0.00016656179,0.0001391225,0.00001309044],"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.000029107174,0.00014124368,0.011768856,0.000043553126,0.00040398038,0.00041244642,0.009051882,0.0067838677,0.0021836562,0.93807167,0.0131796915,0.017930072],"study_design_scores_gemma":[0.004828115,0.00067014043,0.13617475,0.0004042877,0.00018130586,0.0011299731,0.02689483,0.41821045,0.011208312,0.09311844,0.3052109,0.0019684902],"about_ca_topic_score_codex":0.00022290232,"about_ca_topic_score_gemma":0.00092039345,"teacher_disagreement_score":0.84495324,"about_ca_system_score_codex":0.00007818875,"about_ca_system_score_gemma":0.000110166045,"threshold_uncertainty_score":0.36410096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22537157,0.00009362705,0.77188414,0.00036789424,0.0011184479,0.00074478285,0.0000050873423,0.00009487753,0.00031956745],"genre_scores_gemma":[0.7849541,0.000002209092,0.21408539,0.00036435615,0.00008089228,0.00033327428,0.0000017700363,0.00001648723,0.00016156149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976986,0.00027550405,0.0003313804,0.0010018825,0.0002248507,0.0004677698],"domain_scores_gemma":[0.99791616,0.0009045521,0.000090604466,0.0006186497,0.0003269836,0.00014302044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091229804,0.00028971856,0.00044920796,0.0003039778,0.00025469746,0.000372124,0.00061963394,0.00023618783,0.000034346256],"category_scores_gemma":[0.00016515027,0.00024496746,0.00015899977,0.00018616073,0.000055605262,0.000031815503,0.0008868846,0.00040005887,0.000004980751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012098183,0.00017036735,0.0008995305,0.00046198643,0.00016858116,0.000017460326,0.008621813,0.9656292,0.0018687755,0.0010480612,0.00026261562,0.020730633],"study_design_scores_gemma":[0.00020282637,0.00017282991,0.0018348352,0.00027536455,0.0000093003155,0.000021934618,0.00033052516,0.9796089,0.01713741,0.000012195408,0.00007447408,0.00031938896],"about_ca_topic_score_codex":0.00015933742,"about_ca_topic_score_gemma":0.00007585781,"teacher_disagreement_score":0.5595825,"about_ca_system_score_codex":0.0001000487,"about_ca_system_score_gemma":0.00021345436,"threshold_uncertainty_score":0.99894834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00844001,0.0003363328,0.9803568,0.0013617269,0.0075493143,0.00073927303,0.00001638894,0.00016727298,0.001032842],"genre_scores_gemma":[0.98886096,0.000019002367,0.0065950644,0.0013469598,0.0016610583,0.00040740147,0.00016968611,0.000021309466,0.00091853697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970446,0.0004456216,0.0006596529,0.0011833685,0.00027740377,0.00038931856],"domain_scores_gemma":[0.9978619,0.00046765577,0.0002919509,0.0009766824,0.00027822537,0.00012357108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008015832,0.0003750881,0.00078582834,0.0003927175,0.0003163869,0.00086934626,0.00044158593,0.0004905457,0.000045080247],"category_scores_gemma":[0.000022449802,0.00033224997,0.00045392875,0.0004892435,0.00003906054,0.00009588907,0.00007479885,0.00038176784,0.0000049662362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022914764,0.000047166683,0.00024070319,0.000093557486,0.00055304467,0.0000052139862,0.00013547107,0.96034634,0.000041375526,0.035308402,0.0021017566,0.0011040454],"study_design_scores_gemma":[0.00031281888,0.00019222715,0.00016189186,0.000086960325,0.00017004999,0.0000074069217,0.00004275914,0.99730563,0.0002145545,0.0003175725,0.0008351517,0.00035295603],"about_ca_topic_score_codex":0.000348052,"about_ca_topic_score_gemma":0.00061876484,"teacher_disagreement_score":0.98042095,"about_ca_system_score_codex":0.0001126224,"about_ca_system_score_gemma":0.00014132395,"threshold_uncertainty_score":0.999913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008531424,0.00006511472,0.98393303,0.0007998751,0.0039468654,0.0005366003,0.0000033991569,0.00017086162,0.0020128023],"genre_scores_gemma":[0.9813623,0.000032244356,0.01294805,0.0020694553,0.0023720558,0.0000830728,0.00015712414,0.000027902424,0.00094783795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998517,0.00009882754,0.00031415507,0.0006671702,0.00017277244,0.00023008355],"domain_scores_gemma":[0.99896187,0.000114522896,0.00015998322,0.00045757217,0.00023884168,0.00006719712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003106806,0.00022536836,0.00026547894,0.00007465762,0.00017151513,0.0007640036,0.00032741734,0.00027200612,0.000013433865],"category_scores_gemma":[0.000042272313,0.00020118887,0.00007799609,0.00019755974,0.000012995384,0.00014709459,0.0004127954,0.00030040886,0.0000042283937],"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.000029573164,0.000109754765,0.00013558478,0.0001863569,0.00016734346,0.000008768971,0.004589731,0.29494032,0.000072374234,0.6725245,0.014994232,0.012241425],"study_design_scores_gemma":[0.00034413463,0.00026219303,0.00035607608,0.0003492693,0.000015040739,0.000036749414,0.000101050144,0.9887874,0.00036644412,0.007194652,0.0017133177,0.0004736449],"about_ca_topic_score_codex":0.000015426267,"about_ca_topic_score_gemma":0.000058197544,"teacher_disagreement_score":0.97283083,"about_ca_system_score_codex":0.0000381305,"about_ca_system_score_gemma":0.00007678914,"threshold_uncertainty_score":0.82042444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028375931,0.00031761458,0.9420244,0.0004653432,0.0057029487,0.00031442594,0.000002165638,0.00027024912,0.02252694],"genre_scores_gemma":[0.99521345,0.000021676125,0.0017923823,0.0008550108,0.0005655528,0.000021823224,0.000019251966,0.000017075488,0.00149378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980433,0.00016252827,0.00038193565,0.00082232396,0.00028474347,0.00030515838],"domain_scores_gemma":[0.9984268,0.00022264355,0.00016925753,0.0008917025,0.00017909853,0.0001105308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037062878,0.00028656612,0.00036227235,0.000086219196,0.00015987911,0.0008677292,0.00047657348,0.00032620344,0.0001819128],"category_scores_gemma":[0.00002401579,0.00024664466,0.00015099003,0.00018167087,0.000019289126,0.00017529349,0.0010313285,0.00047732776,0.000020734748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063235843,0.000030259665,0.0006786044,0.000038248974,0.00006426693,0.000023692024,0.00061819307,0.97083175,0.0000019383342,0.01909289,0.005828419,0.0027854242],"study_design_scores_gemma":[0.00013316753,0.00005330537,0.0012700655,0.00029458155,0.0000049112555,0.000014884189,0.000052350268,0.9923002,0.00000822974,0.0022122313,0.0033328077,0.00032324914],"about_ca_topic_score_codex":0.000054064192,"about_ca_topic_score_gemma":0.0000539243,"teacher_disagreement_score":0.9668375,"about_ca_system_score_codex":0.000051076615,"about_ca_system_score_gemma":0.000069158654,"threshold_uncertainty_score":0.99999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44583946,0.00033404908,0.55255073,0.00023448454,0.00051225006,0.00014676365,0.0000012860638,0.000031107484,0.0003498403],"genre_scores_gemma":[0.9912047,0.00009995434,0.0085585555,0.00006602825,0.000019151556,0.000035631365,4.9258966e-7,0.0000049306136,0.000010601485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997685,0.00019781322,0.0005924708,0.0006629655,0.0004920084,0.0003697056],"domain_scores_gemma":[0.998545,0.00045654102,0.00011930838,0.00052730646,0.00023979091,0.00011205047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022709956,0.00013198388,0.00029925033,0.00056136743,0.00010208302,0.00040749175,0.0008973961,0.0000669657,0.0000024828473],"category_scores_gemma":[0.00016911351,0.00012065858,0.00004190904,0.0029551012,0.00052024797,0.000726381,0.00047630788,0.0001786764,0.0000042526276],"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.000001751154,0.00008372178,0.0035822287,0.000033162494,0.000001623444,0.000012288206,0.0006005757,0.023955446,0.00042424895,0.96702534,0.000014515734,0.00426509],"study_design_scores_gemma":[0.00019129876,0.00004405281,0.0024749623,0.00017957685,0.000001457641,0.00003074844,0.000038686085,0.9020434,0.0024810648,0.09238306,0.000004047038,0.00012765753],"about_ca_topic_score_codex":0.00006801285,"about_ca_topic_score_gemma":0.000012618036,"teacher_disagreement_score":0.87808794,"about_ca_system_score_codex":0.000067171284,"about_ca_system_score_gemma":0.000101108,"threshold_uncertainty_score":0.49203143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001954714,0.00028771412,0.99054337,0.0020586797,0.0017410179,0.0001337615,0.0000016927895,0.00008858841,0.0031904562],"genre_scores_gemma":[0.9842048,0.000013814565,0.0095269075,0.00095254846,0.00065896567,0.000035024463,0.0000042400343,0.0000064833525,0.0045971707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989107,0.00007038497,0.00024697752,0.0003339592,0.00013963241,0.00029829968],"domain_scores_gemma":[0.99848294,0.00048048777,0.000066007095,0.00064616627,0.0002617257,0.00006264531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368678,0.00010531322,0.000192042,0.000042410094,0.00034933095,0.00031540735,0.00036741828,0.000058363516,0.00015277615],"category_scores_gemma":[0.000036252743,0.00006684625,0.00026329394,0.0016801438,0.000013777274,0.00016292247,0.00013496453,0.000090765956,0.000032656077],"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.000028891365,0.00010100243,0.0071922145,0.000019598476,0.0026476406,0.0009087968,0.0015183265,0.10952551,0.00002498368,0.6895168,0.1643033,0.024212956],"study_design_scores_gemma":[0.00021211788,0.000033625165,0.00038023113,0.0000067293777,0.00012864602,0.00026683515,0.0002601291,0.9680049,0.000043862,0.0021048775,0.028411373,0.00014670462],"about_ca_topic_score_codex":0.00014661,"about_ca_topic_score_gemma":0.0017167059,"teacher_disagreement_score":0.98225015,"about_ca_system_score_codex":0.00002273279,"about_ca_system_score_gemma":0.000048420236,"threshold_uncertainty_score":0.30414802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005555821,0.00052094896,0.94653267,0.0056260177,0.002916043,0.0019192175,0.00017648345,0.0008936253,0.04135946],"genre_scores_gemma":[0.5643263,0.00015741723,0.2523779,0.0007935587,0.000779641,0.0005883313,0.00084559235,0.0003201484,0.17981115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997091,0.000018191977,0.0009035337,0.001083475,0.00045669408,0.0004470994],"domain_scores_gemma":[0.99588835,0.00007735002,0.0013091943,0.0017378586,0.0009101371,0.000077100965],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00032305726,0.00057876325,0.00091642654,0.0012898678,0.00023760827,0.00011166881,0.0017872558,0.0014868903,0.000026082955],"category_scores_gemma":[0.00013992908,0.0005855386,0.00033961335,0.00037232347,0.0004852428,0.00046393592,0.00022678784,0.00057020655,0.00009631598],"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.000026038813,0.00006206336,0.00007126989,0.0005131409,0.00016913052,0.0000049323808,0.000047134527,0.0009437897,0.00025349826,0.97241306,0.005911988,0.019583978],"study_design_scores_gemma":[0.0011037319,0.00030581641,0.000016544627,0.00082784967,0.00007133293,0.000015765987,0.000010747175,0.22442041,0.00058287196,0.016073473,0.75590634,0.0006650816],"about_ca_topic_score_codex":0.000009848972,"about_ca_topic_score_gemma":0.00009662574,"teacher_disagreement_score":0.95633954,"about_ca_system_score_codex":0.00034873345,"about_ca_system_score_gemma":0.0005539975,"threshold_uncertainty_score":0.9998094},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011479403,0.004093579,0.93358827,0.00017725595,0.0075913486,0.00075145386,0.000011147304,0.00036342634,0.05341205],"genre_scores_gemma":[0.26996672,0.0027425436,0.074641414,0.0018535347,0.010899518,0.0004182769,0.0011579539,0.0005347609,0.6377853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651694,0.00009124331,0.0009586888,0.0012677037,0.00038295137,0.00078247715],"domain_scores_gemma":[0.9970067,0.0003302522,0.00064564194,0.0013089284,0.0005253447,0.00018313182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007819727,0.00062554283,0.00091951096,0.000106468,0.00047459116,0.00052150665,0.0010318883,0.0010577022,0.0001227297],"category_scores_gemma":[0.000017714752,0.0006658413,0.0005582572,0.00018260356,0.000070686976,0.00027593863,0.00040066137,0.00079305895,0.000024335553],"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.000027635244,0.000019071676,0.000013623178,0.000106772844,0.00018768222,0.00002626336,0.0000407298,0.37410027,7.3298037e-7,0.55360794,0.008427629,0.06344165],"study_design_scores_gemma":[0.0003113419,0.000048531016,0.000010344319,0.00078434695,0.000041341296,0.000033464836,0.0000056327535,0.90147215,7.089802e-7,0.010199193,0.086493,0.0005999366],"about_ca_topic_score_codex":0.000006429658,"about_ca_topic_score_gemma":0.00014523827,"teacher_disagreement_score":0.85894686,"about_ca_system_score_codex":0.00019321774,"about_ca_system_score_gemma":0.00016479095,"threshold_uncertainty_score":0.9995793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16613264,0.000060641356,0.8254407,0.00094743905,0.0046035754,0.000088882385,0.000074028816,0.00012305658,0.0025290253],"genre_scores_gemma":[0.9958854,0.0001696007,0.0014989551,0.0005277505,0.00077876926,0.000002953204,0.0001308523,0.000011929868,0.0009937919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798995,0.000058247675,0.0004288865,0.0007226433,0.00048525105,0.00031499309],"domain_scores_gemma":[0.9982399,0.000100433004,0.00020977075,0.0008377279,0.0004911541,0.00012103999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034191413,0.00023183989,0.0002713235,0.00015139057,0.00023779829,0.000629252,0.0015400826,0.00008738486,0.00005964193],"category_scores_gemma":[0.000040384642,0.00022069261,0.000043326123,0.00022126948,0.000064682594,0.00064690184,0.0006217092,0.00029675782,0.00006232033],"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.0001281615,0.00091817335,0.0019501683,0.000290821,0.0008874261,0.0003078878,0.0033012002,0.24544217,0.001618443,0.5913942,0.036490418,0.11727097],"study_design_scores_gemma":[0.00035258115,0.000078903395,0.0004406137,0.00025446567,0.000010136093,0.00008914239,0.00010169676,0.99553245,0.0003608881,0.0005044753,0.0020100684,0.00026457754],"about_ca_topic_score_codex":0.000026888389,"about_ca_topic_score_gemma":0.000017155953,"teacher_disagreement_score":0.82975274,"about_ca_system_score_codex":0.000044837205,"about_ca_system_score_gemma":0.00012448581,"threshold_uncertainty_score":0.8999584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033918206,0.00014445264,0.9636456,0.0002709417,0.00070525304,0.00029727205,7.867638e-7,0.0001330366,0.0008844569],"genre_scores_gemma":[0.93384314,0.000028871222,0.065639205,0.00015244863,0.00016484145,0.00003590311,0.00003041554,0.00000772466,0.00009745196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883586,0.000086189895,0.0003208408,0.0004809362,0.00014158334,0.0001346013],"domain_scores_gemma":[0.9991263,0.00002834694,0.00018697033,0.00040289984,0.00020512665,0.000050335086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026876226,0.0001282859,0.00017033525,0.00005101073,0.00012535659,0.0007204082,0.00018492564,0.00009294807,0.000012762644],"category_scores_gemma":[0.0000117183445,0.00013121792,0.000042833148,0.00012700848,0.000013529966,0.0003156419,0.00031731784,0.00013957913,0.0000033857443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001236569,0.000018998504,0.00011735834,0.00006219181,0.000022787355,0.0000028959623,0.0005691322,0.9796076,0.0016686221,0.011929925,0.000085951564,0.0059133377],"study_design_scores_gemma":[0.00008160309,0.000005906853,0.000056454013,0.000071202994,0.000005342634,0.0000298435,0.00011237951,0.9949641,0.004107768,0.00029152638,0.00012283071,0.00015102266],"about_ca_topic_score_codex":0.00018939364,"about_ca_topic_score_gemma":0.000010305515,"teacher_disagreement_score":0.89992493,"about_ca_system_score_codex":0.00006498331,"about_ca_system_score_gemma":0.00005894458,"threshold_uncertainty_score":0.6946913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010652203,0.00025826955,0.9862135,0.0011244671,0.003289076,0.00071375194,0.000004492381,0.00027853003,0.0070526777],"genre_scores_gemma":[0.9593523,0.000037951428,0.038079,0.00056319335,0.00069024216,0.00027097942,0.00010341053,0.000019296414,0.0008836249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980579,0.0003463946,0.0004615276,0.0006302692,0.0002013311,0.00030255783],"domain_scores_gemma":[0.9972082,0.00055943284,0.00036059908,0.001319036,0.0004883532,0.000064384025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009253339,0.00024441714,0.00035143492,0.000062086954,0.0003180703,0.00062907906,0.0010149059,0.0003246446,0.000016157148],"category_scores_gemma":[0.000056606794,0.00023256315,0.00022502955,0.00015494261,0.00002188117,0.00017903956,0.0010385755,0.0005260973,0.000011012147],"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.00002661207,0.00005890387,0.00011033472,0.000066316126,0.00014400076,0.0000032248383,0.0012249913,0.37683526,0.0000040460664,0.5846821,0.016287621,0.02055661],"study_design_scores_gemma":[0.00019221951,0.00008461465,0.00018589328,0.0008048432,0.000011458216,0.000008175734,0.00025304526,0.99136025,0.000039614995,0.0050995667,0.0016652378,0.00029509256],"about_ca_topic_score_codex":0.00018648227,"about_ca_topic_score_gemma":0.0002746092,"teacher_disagreement_score":0.95828706,"about_ca_system_score_codex":0.00014627205,"about_ca_system_score_gemma":0.00012599716,"threshold_uncertainty_score":0.948365},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005873541,0.0014147504,0.09741398,0.002636924,0.015142047,0.0038069224,0.0011186276,0.0011788333,0.8767006],"genre_scores_gemma":[0.0055863303,0.000009852288,0.003319673,0.0010764378,0.0034439827,0.000044933873,0.00012080407,0.000121578916,0.9862764],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99545425,0.0002978799,0.0010075809,0.0012087927,0.0010733646,0.00095815345],"domain_scores_gemma":[0.9954571,0.0014500967,0.0014347369,0.0009586296,0.00043581423,0.00026363006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009958614,0.00079847255,0.0009284611,0.0003147011,0.0007863519,0.00052115513,0.0014062868,0.0006028148,0.00004143217],"category_scores_gemma":[0.00018639553,0.00079958554,0.00032941086,0.00009309737,0.000038385897,0.00008608851,0.0005494251,0.000959785,0.00003870578],"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.000019868947,0.00003465752,0.000096931624,0.000090007605,0.0003523051,0.00002891258,0.00044493692,0.008882135,0.0000010872727,0.00287018,0.9654164,0.021762595],"study_design_scores_gemma":[0.0012092034,0.0003368842,0.00026167996,0.00038039728,0.00008617019,0.000061378094,0.000028408731,0.25011173,0.0000027678834,0.0013779786,0.74505574,0.0010876921],"about_ca_topic_score_codex":0.03107856,"about_ca_topic_score_gemma":0.1139933,"teacher_disagreement_score":0.24122958,"about_ca_system_score_codex":0.0018757362,"about_ca_system_score_gemma":0.0005373919,"threshold_uncertainty_score":0.9994455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037351828,0.0022903325,0.9591582,0.00011145387,0.000588298,0.0002520268,0.000004253216,0.00009167369,0.00015194033],"genre_scores_gemma":[0.99581003,0.00007260055,0.0036629497,0.000075493874,0.0002988335,0.0000077403165,0.000038544422,0.000008650703,0.000025167728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984963,0.000056519562,0.0004298194,0.0004115213,0.000108195,0.00049762876],"domain_scores_gemma":[0.9987196,0.0007564375,0.00013553615,0.00017379689,0.000079603175,0.00013504802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012948923,0.00017990981,0.00025267867,0.00007697819,0.00027975286,0.00018821967,0.0001776237,0.00014833058,5.90832e-7],"category_scores_gemma":[0.000044548477,0.00016566088,0.00004742827,0.00032850844,0.000043672597,0.000044883956,0.00013715719,0.00019688727,2.926806e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040587474,0.00005006036,0.0027197201,0.00001795147,0.000011391579,0.000008782878,0.00017106844,0.92973554,0.0000012246246,0.024361826,0.00094739767,0.041934468],"study_design_scores_gemma":[0.0005203083,0.00006484067,0.014084671,0.00012421593,0.000006006135,0.000029017945,0.00007851832,0.98418546,0.0000012364226,0.0002456521,0.00045856676,0.000201494],"about_ca_topic_score_codex":0.00001504228,"about_ca_topic_score_gemma":0.000022042865,"teacher_disagreement_score":0.9584582,"about_ca_system_score_codex":0.000032260712,"about_ca_system_score_gemma":0.0000072137414,"threshold_uncertainty_score":0.67554545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037002985,0.00021623634,0.99394673,0.0003539588,0.0015765975,0.0005640752,0.000006060117,0.000055499706,0.0029108166],"genre_scores_gemma":[0.77981144,0.00006274894,0.21598014,0.0018202027,0.0005843069,0.00011278839,0.00001607674,0.00010411368,0.0015081605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684536,0.00011411126,0.0005766939,0.0010081632,0.0010404108,0.00041526376],"domain_scores_gemma":[0.9978154,0.00026227525,0.0004373325,0.0012397802,0.00017869807,0.00006655443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001163038,0.00036142746,0.00046411535,0.0008722876,0.00023857052,0.00019902177,0.0027111366,0.00015845406,0.000056197638],"category_scores_gemma":[0.000023567864,0.00024863164,0.00015156082,0.0016687899,0.00047699528,0.0004663482,0.00091685547,0.0007743606,0.000006107615],"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.000028463635,0.0001318608,0.0003743581,0.000113487855,0.000035011817,0.000082498824,0.0045977007,0.4002974,0.00019213003,0.09814158,0.00010605001,0.49589944],"study_design_scores_gemma":[0.0003663146,0.0002669014,0.0001758809,0.0005302582,0.000005939557,0.00014250092,9.661065e-7,0.9529213,0.0004012285,0.043691445,0.0010421342,0.00045515498],"about_ca_topic_score_codex":0.00010595732,"about_ca_topic_score_gemma":0.00013609532,"teacher_disagreement_score":0.7794414,"about_ca_system_score_codex":0.00020484472,"about_ca_system_score_gemma":0.00030518565,"threshold_uncertainty_score":0.9999966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004367918,0.004607526,0.21535814,0.0002692828,0.01038016,0.00036672386,0.000004274053,0.00016666585,0.76880354],"genre_scores_gemma":[0.51484585,0.009440073,0.18842328,0.010697269,0.0036543196,0.00047407273,0.00012267058,0.00061487796,0.2717276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979134,0.00006347999,0.0006306318,0.0006981347,0.00035436705,0.0003399564],"domain_scores_gemma":[0.9987422,0.0003139281,0.00029376897,0.0005662987,0.00003259579,0.000051169973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040506077,0.00029925298,0.00045417703,0.0004141367,0.000083509054,0.0000946227,0.0011870785,0.00012941533,0.00013492953],"category_scores_gemma":[0.000009387466,0.00032979387,0.00012328103,0.00016946941,0.000038131227,0.0006905006,0.00060846045,0.0007180194,0.000031338986],"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.000005722291,0.000016982696,0.000116559575,0.000038552647,0.000011558038,0.00026634906,0.0007309358,0.04839695,7.23973e-7,0.873593,0.00085175276,0.07597095],"study_design_scores_gemma":[0.00031837012,0.00012393788,0.000022698356,0.0004934803,0.0000011519134,0.000053288106,0.000024647532,0.07341297,0.000001160732,0.020454042,0.9046258,0.00046846285],"about_ca_topic_score_codex":0.00002709675,"about_ca_topic_score_gemma":0.00015588039,"teacher_disagreement_score":0.903774,"about_ca_system_score_codex":0.0003345603,"about_ca_system_score_gemma":0.000050680024,"threshold_uncertainty_score":0.9999154},"labels":[],"label_agreement":null},{"id":"W4210619295","doi":"10.1142/s0219265921420172","title":"A Note on Linearly Many Faults of Interconnection Networks","year":2022,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interconnection; Computer science; Vulnerability (computing); Measure (data warehouse); Graph; Theoretical computer science; Distributed computing; Topology (electrical circuits); Mathematics; Computer network; Combinatorics; Data mining; Computer security","score_opus":0.011292947896288664,"score_gpt":0.24226947289312595,"score_spread":0.2309765249968373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210619295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055718996,0.00043522648,0.92220783,0.00075895526,0.019114297,0.0002876095,0.0000033210747,0.00010736023,0.0013663995],"genre_scores_gemma":[0.9951401,0.00010099129,0.0010255036,0.00091080717,0.0022641572,0.000031550484,0.0000036490671,0.000046371093,0.00047690756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995208,0.0008578447,0.002030299,0.00053223857,0.0008219011,0.0005497113],"domain_scores_gemma":[0.9954794,0.0006607969,0.0021746994,0.000692237,0.0007730801,0.00021981094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002672074,0.00040199008,0.0008218093,0.0008961239,0.0004631391,0.00017321315,0.001424791,0.00023593837,0.00024460186],"category_scores_gemma":[0.00017027937,0.00037025363,0.00076229527,0.0012648201,0.00006652777,0.0009354212,0.0004403441,0.0019124815,0.000010093931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008093946,0.00040976805,0.00028736345,0.00002101307,0.00024856743,0.00008833535,0.0011245323,0.9440375,0.00035547125,0.009279439,0.015109355,0.028229268],"study_design_scores_gemma":[0.001496714,0.004543439,0.00036888418,0.00035015898,0.000044240474,0.0019554533,0.0007710229,0.9716001,0.0004540105,0.0005161677,0.017490024,0.00040976494],"about_ca_topic_score_codex":0.00006927171,"about_ca_topic_score_gemma":0.000050817962,"teacher_disagreement_score":0.93942106,"about_ca_system_score_codex":0.00057215756,"about_ca_system_score_gemma":0.00009879561,"threshold_uncertainty_score":0.99987495},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001698484,0.0000075616563,0.73964965,0.000704341,0.0020159148,0.000035844383,4.0236912e-8,0.000081596154,0.2558066],"genre_scores_gemma":[0.9898395,0.0000018156481,0.00086750364,0.0007760563,0.0002890365,0.0000039720253,7.7700726e-8,0.00000284162,0.008219193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950033,0.000018359582,0.00008656699,0.00016887496,0.00008358143,0.00014225912],"domain_scores_gemma":[0.9989338,0.00004165477,0.00005891165,0.00089421874,0.000025578702,0.000045837183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017449568,0.000055823366,0.00006887784,0.000018352199,0.00039738172,0.0005661836,0.0008866558,0.00003646747,0.000053803004],"category_scores_gemma":[0.000021063699,0.000040979594,0.00004237359,0.000020299123,0.000015511843,0.00023695095,0.00012701961,0.00007275101,0.0002023261],"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.0000014141276,0.000009075694,0.00025352262,5.715066e-7,0.000004904459,0.000005658348,0.00002113929,0.0017809254,0.000002189091,0.95155483,0.036072213,0.010293578],"study_design_scores_gemma":[0.00014606188,0.0000612967,0.003098165,0.000016359603,5.457631e-7,0.000011344933,0.000003624972,0.97556865,0.00003924243,0.0071823057,0.013764038,0.000108334454],"about_ca_topic_score_codex":0.00003696025,"about_ca_topic_score_gemma":0.000030190718,"teacher_disagreement_score":0.988141,"about_ca_system_score_codex":0.000008773324,"about_ca_system_score_gemma":0.0000058647347,"threshold_uncertainty_score":0.5459721},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053730268,0.0015951515,0.93807364,0.0024675825,0.00094036356,0.0009562708,0.000012962391,0.00079414836,0.001429609],"genre_scores_gemma":[0.99563366,0.000050910774,0.0011598519,0.00008109816,0.000020010042,0.0008168983,0.000002453025,0.000018941384,0.0022161498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833953,0.00014928507,0.00036849806,0.0006226468,0.00019941879,0.00032061376],"domain_scores_gemma":[0.9986002,0.00014692565,0.00018561707,0.0009069867,0.00008419469,0.00007610398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058910676,0.00020741834,0.00035902034,0.0006286691,0.0010796343,0.00016708636,0.00054702925,0.00016895666,0.000031096275],"category_scores_gemma":[0.000008640951,0.00018707848,0.000042364412,0.0008491479,0.00009501906,0.00034231678,0.000023141078,0.00045978604,0.000008481036],"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.0008870138,0.0007514733,0.004075823,0.0006288714,0.0014299348,0.00011621814,0.004353315,0.11665798,0.007207209,0.35921603,0.004084568,0.5005916],"study_design_scores_gemma":[0.0055077546,0.0017739238,0.0003968277,0.00033696,0.00012981863,0.0053370595,0.01025088,0.8579264,0.003306742,0.006269909,0.10714634,0.0016173748],"about_ca_topic_score_codex":0.00022277699,"about_ca_topic_score_gemma":0.0000468735,"teacher_disagreement_score":0.9419034,"about_ca_system_score_codex":0.00010985904,"about_ca_system_score_gemma":0.000043853437,"threshold_uncertainty_score":0.83037835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028848602,0.000031231542,0.98972374,0.00086057896,0.00030562983,0.0006501934,0.0000017817637,0.0001224235,0.0054195626],"genre_scores_gemma":[0.96586627,5.057387e-7,0.03144283,0.0008427217,0.00018958283,0.0015503442,0.0000022299896,0.000005621555,0.000099919285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858767,0.000101039666,0.00016355644,0.0004674855,0.00039653102,0.00028374768],"domain_scores_gemma":[0.9991517,0.00035312038,0.000105017694,0.000315325,0.000027856024,0.000046994886],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015889117,0.00009617601,0.00009220925,0.00010912557,0.0032891717,0.00028232895,0.0013901506,0.000018544873,0.00002146003],"category_scores_gemma":[0.0000064923333,0.000065428285,0.000051475727,0.00082076894,0.00010037125,0.000043498883,0.00016539043,0.00022545137,0.000012003674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011060164,0.000033184,0.0000042353795,0.0000014843183,0.000003494351,1.837716e-7,0.0016303478,0.46134755,0.00037459846,0.34556156,0.000115835865,0.19092642],"study_design_scores_gemma":[0.00007192048,0.00014014477,0.000016954104,0.0000021105143,0.0000011379935,0.000008389664,0.0024139145,0.9396606,0.00013861361,0.0037533613,0.05368503,0.000107814725],"about_ca_topic_score_codex":0.00000686383,"about_ca_topic_score_gemma":0.0000029229159,"teacher_disagreement_score":0.9629814,"about_ca_system_score_codex":0.000038855214,"about_ca_system_score_gemma":0.000034948167,"threshold_uncertainty_score":0.99800843},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28574377,0.0001975519,0.09253562,0.006408239,0.19636633,0.0010222441,0.000037783942,0.00090507773,0.4167834],"genre_scores_gemma":[0.9539333,0.0000029949867,0.00058851135,0.0043650675,0.022351932,0.000051733103,0.0000025582854,0.000019243787,0.018684685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989117,0.00013352842,0.00018693156,0.0003330886,0.00019838197,0.00023637523],"domain_scores_gemma":[0.99939054,0.00006262607,0.00006507231,0.00040136275,0.000029190232,0.000051221985],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002643368,0.00010955219,0.00013610176,0.000108350825,0.00027612722,0.00012349436,0.00074330135,0.000028272592,0.0010705505],"category_scores_gemma":[0.0000069364155,0.00010839631,0.000087216584,0.00024073692,0.000014135175,0.00011423548,0.00017625868,0.00023353363,0.0006416657],"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.000024031877,0.00006835004,0.000013515948,0.0000038862067,0.0000142261015,0.000058612444,0.0015279368,0.000864487,0.004481513,0.0071740863,0.9698739,0.015895465],"study_design_scores_gemma":[0.0002223837,0.00025828273,0.000023961964,0.000010057139,0.0000013227288,0.00009341623,0.00012054337,0.003028853,0.008990541,0.00020753524,0.98688996,0.00015315451],"about_ca_topic_score_codex":0.000035612655,"about_ca_topic_score_gemma":0.000017716051,"teacher_disagreement_score":0.6681895,"about_ca_system_score_codex":0.00011791723,"about_ca_system_score_gemma":0.000025768106,"threshold_uncertainty_score":0.9998426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006064071,0.00063786615,0.95090336,0.0012248601,0.0011272859,0.0011563768,0.000033794164,0.00013279165,0.03871962],"genre_scores_gemma":[0.9321383,0.00052455324,0.06621921,0.0006048357,0.00009460143,0.0002339627,0.00009816909,0.000014236799,0.000072124414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978311,0.0003361122,0.00096258114,0.00025468902,0.00036681886,0.00024872087],"domain_scores_gemma":[0.997147,0.00067448907,0.0009963035,0.0009141226,0.0002167137,0.00005134943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014237358,0.00024289718,0.0003484513,0.00028815627,0.0005329951,0.00020263938,0.0024539854,0.000068543915,0.000032224092],"category_scores_gemma":[0.0000205788,0.00023768198,0.00007505817,0.0003116394,0.00009132384,0.0003606743,0.0009659588,0.00062325277,0.0000036727633],"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.00011543984,0.00006584611,0.000034607147,0.00004401721,0.000027411628,1.5633579e-7,0.004157713,0.21403946,0.000019484154,0.75465626,0.000422201,0.02641743],"study_design_scores_gemma":[0.0010660193,0.00021513838,0.00007159381,0.00024940743,0.0000044736635,0.000016825998,0.005421847,0.9614006,0.00015293337,0.014568322,0.01656151,0.0002712867],"about_ca_topic_score_codex":0.000010828684,"about_ca_topic_score_gemma":0.000015869524,"teacher_disagreement_score":0.92607427,"about_ca_system_score_codex":0.00020090882,"about_ca_system_score_gemma":0.0000635772,"threshold_uncertainty_score":0.969239},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003885655,0.00003058211,0.9738163,0.00083395734,0.020088706,0.0006368351,0.0000035587802,0.00025604153,0.00044838275],"genre_scores_gemma":[0.9103834,0.0000010372104,0.087853394,0.0006522933,0.00032719233,0.00028693254,0.0000036638032,0.000008188428,0.00048391984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978208,0.00009471654,0.00029787197,0.000790187,0.000594704,0.00040174712],"domain_scores_gemma":[0.99858624,0.00014878341,0.00014312817,0.0006893349,0.0002749283,0.00015756654],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012098583,0.00013358571,0.00015068999,0.00039264033,0.0016244117,0.0003568139,0.0018972261,0.000020354677,0.000011117808],"category_scores_gemma":[0.00003463766,0.00012991854,0.00009209098,0.001986762,0.00005921689,0.0006286563,0.0010079463,0.00015390372,0.000021646609],"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.00005026097,0.00021215226,0.00052364374,0.00002435456,0.0000131344605,0.000003984197,0.0048221936,0.28239825,0.0195706,0.08377213,0.19476342,0.41384587],"study_design_scores_gemma":[0.00021872837,0.00033393252,0.00075016933,0.000020723506,0.0000013834913,0.000044785713,0.00003449865,0.9691267,0.0013616141,0.0010727821,0.026847739,0.00018691411],"about_ca_topic_score_codex":0.000047297697,"about_ca_topic_score_gemma":0.000009350233,"teacher_disagreement_score":0.9064977,"about_ca_system_score_codex":0.00019017923,"about_ca_system_score_gemma":0.00012756963,"threshold_uncertainty_score":0.99967533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009888901,0.00026389962,0.9948317,0.0001966205,0.0015028415,0.00025774553,0.000002911788,0.000052950632,0.0019024882],"genre_scores_gemma":[0.95919853,0.00008113328,0.036217295,0.0006551089,0.0018869818,0.00007941379,0.000004967741,0.00001939944,0.0018571633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.00005875928,0.00028410513,0.00021734834,0.00014540534,0.00027700572],"domain_scores_gemma":[0.9991488,0.00019386788,0.00013122121,0.0003808158,0.00010209914,0.00004319024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031063732,0.000108037304,0.00017816327,0.00003836391,0.00023351602,0.00003210573,0.00054289633,0.00007887377,0.000008159379],"category_scores_gemma":[0.0000096469985,0.00007263462,0.00015731974,0.0002506865,0.000049090122,0.00012850776,0.0000955093,0.00013646318,0.000005195552],"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.000036887654,0.00020837612,0.0014759307,0.000024773504,0.00015295776,0.000026143276,0.002998462,0.03631859,0.000041134397,0.010525139,0.17504665,0.77314496],"study_design_scores_gemma":[0.00037219474,0.00008569351,0.00012942454,0.000033454475,0.0000030652861,0.00008962665,0.00002004841,0.94605607,0.00004828408,0.000055825618,0.0530234,0.000082919985],"about_ca_topic_score_codex":0.000013411162,"about_ca_topic_score_gemma":0.000010568072,"teacher_disagreement_score":0.95861435,"about_ca_system_score_codex":0.000017880497,"about_ca_system_score_gemma":0.000020386515,"threshold_uncertainty_score":0.2961954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22537157,0.00009362705,0.77188414,0.00036789424,0.0011184479,0.00074478285,0.0000050873423,0.00009487753,0.00031956745],"genre_scores_gemma":[0.7849541,0.000002209092,0.21408539,0.00036435615,0.00008089228,0.00033327428,0.0000017700363,0.00001648723,0.00016156149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976986,0.00027550405,0.0003313804,0.0010018825,0.0002248507,0.0004677698],"domain_scores_gemma":[0.99791616,0.0009045521,0.000090604466,0.0006186497,0.0003269836,0.00014302044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091229804,0.00028971856,0.00044920796,0.0003039778,0.00025469746,0.000372124,0.00061963394,0.00023618783,0.000034346256],"category_scores_gemma":[0.00016515027,0.00024496746,0.00015899977,0.00018616073,0.000055605262,0.000031815503,0.0008868846,0.00040005887,0.000004980751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012098183,0.00017036735,0.0008995305,0.00046198643,0.00016858116,0.000017460326,0.008621813,0.9656292,0.0018687755,0.0010480612,0.00026261562,0.020730633],"study_design_scores_gemma":[0.00020282637,0.00017282991,0.0018348352,0.00027536455,0.0000093003155,0.000021934618,0.00033052516,0.9796089,0.01713741,0.000012195408,0.00007447408,0.00031938896],"about_ca_topic_score_codex":0.00015933742,"about_ca_topic_score_gemma":0.00007585781,"teacher_disagreement_score":0.5595825,"about_ca_system_score_codex":0.0001000487,"about_ca_system_score_gemma":0.00021345436,"threshold_uncertainty_score":0.99894834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028375931,0.00031761458,0.9420244,0.0004653432,0.0057029487,0.00031442594,0.000002165638,0.00027024912,0.02252694],"genre_scores_gemma":[0.99521345,0.000021676125,0.0017923823,0.0008550108,0.0005655528,0.000021823224,0.000019251966,0.000017075488,0.00149378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980433,0.00016252827,0.00038193565,0.00082232396,0.00028474347,0.00030515838],"domain_scores_gemma":[0.9984268,0.00022264355,0.00016925753,0.0008917025,0.00017909853,0.0001105308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037062878,0.00028656612,0.00036227235,0.000086219196,0.00015987911,0.0008677292,0.00047657348,0.00032620344,0.0001819128],"category_scores_gemma":[0.00002401579,0.00024664466,0.00015099003,0.00018167087,0.000019289126,0.00017529349,0.0010313285,0.00047732776,0.000020734748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063235843,0.000030259665,0.0006786044,0.000038248974,0.00006426693,0.000023692024,0.00061819307,0.97083175,0.0000019383342,0.01909289,0.005828419,0.0027854242],"study_design_scores_gemma":[0.00013316753,0.00005330537,0.0012700655,0.00029458155,0.0000049112555,0.000014884189,0.000052350268,0.9923002,0.00000822974,0.0022122313,0.0033328077,0.00032324914],"about_ca_topic_score_codex":0.000054064192,"about_ca_topic_score_gemma":0.0000539243,"teacher_disagreement_score":0.9668375,"about_ca_system_score_codex":0.000051076615,"about_ca_system_score_gemma":0.000069158654,"threshold_uncertainty_score":0.99999857},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011258131,0.000052991036,0.4962949,0.000008811904,0.00041957086,0.00007232453,6.7772896e-7,0.00015478783,0.5029847],"genre_scores_gemma":[0.26731074,0.000020329258,0.0022580733,0.0001043444,0.00034673652,0.0000029872936,0.000005552396,0.000086784574,0.7298644],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992365,0.000041558662,0.00023641287,0.00021987154,0.00015158874,0.00011402987],"domain_scores_gemma":[0.9993969,0.000038466493,0.00017394229,0.00033809326,0.000025961064,0.000026634796],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007459932,0.00012212008,0.00020949007,0.00015272641,0.000022408807,0.00006942235,0.00035127986,0.00017535804,0.0012863707],"category_scores_gemma":[0.0000031521304,0.00010089748,0.000061573526,0.00023525069,0.0000047861504,0.00008226326,0.000040023686,0.00008865723,0.000096546646],"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.0000050701783,0.000057624373,0.000039045728,0.000086714106,0.00010745778,0.0000066107095,0.00036530592,0.11713066,0.0000642677,0.012129385,0.80954176,0.06046609],"study_design_scores_gemma":[0.000073421405,0.000015836962,0.0000053920066,0.00008747769,0.0000022283734,0.0000016205338,0.000002895682,0.6423063,0.000020772686,0.00005431447,0.35732445,0.00010527772],"about_ca_topic_score_codex":0.00026796936,"about_ca_topic_score_gemma":0.000056568657,"teacher_disagreement_score":0.52517563,"about_ca_system_score_codex":0.000011150565,"about_ca_system_score_gemma":0.000021094836,"threshold_uncertainty_score":0.9996266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6762099,0.000040847393,0.31978762,0.000082596,0.00043498137,0.00038716174,2.3065125e-7,0.000062222316,0.0029943914],"genre_scores_gemma":[0.99840015,3.117762e-7,0.001369285,0.00006957309,0.00007171532,0.000037524132,1.6362836e-7,0.0000049629507,0.000046331465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984054,0.00032209023,0.0003170257,0.00027558432,0.00053875963,0.00014115436],"domain_scores_gemma":[0.99895203,0.00006864911,0.000092864306,0.00046075508,0.0003809809,0.00004474881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023116372,0.00009927749,0.00015421634,0.00013362325,0.00007091482,0.000063219304,0.00031272488,0.000034252575,0.00004829012],"category_scores_gemma":[0.000084798834,0.00007576092,0.0000729754,0.00027646997,0.000016867114,0.00011656706,0.00009873575,0.00008620217,0.000015786329],"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.00003337728,0.0025119318,0.0012199166,0.00005201664,0.00065023935,0.0014993697,0.12673765,0.28536618,0.0010316841,0.076594606,0.00052971917,0.50377333],"study_design_scores_gemma":[0.010545308,0.0046377527,0.0010632352,0.00024118312,0.00024879808,0.015557353,0.04162318,0.8755627,0.007284285,0.041908707,0.00034297,0.0009845011],"about_ca_topic_score_codex":0.0019453017,"about_ca_topic_score_gemma":0.0037186407,"teacher_disagreement_score":0.59019655,"about_ca_system_score_codex":0.00009106764,"about_ca_system_score_gemma":0.00010667955,"threshold_uncertainty_score":0.30894408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033918206,0.00014445264,0.9636456,0.0002709417,0.00070525304,0.00029727205,7.867638e-7,0.0001330366,0.0008844569],"genre_scores_gemma":[0.93384314,0.000028871222,0.065639205,0.00015244863,0.00016484145,0.00003590311,0.00003041554,0.00000772466,0.00009745196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883586,0.000086189895,0.0003208408,0.0004809362,0.00014158334,0.0001346013],"domain_scores_gemma":[0.9991263,0.00002834694,0.00018697033,0.00040289984,0.00020512665,0.000050335086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026876226,0.0001282859,0.00017033525,0.00005101073,0.00012535659,0.0007204082,0.00018492564,0.00009294807,0.000012762644],"category_scores_gemma":[0.0000117183445,0.00013121792,0.000042833148,0.00012700848,0.000013529966,0.0003156419,0.00031731784,0.00013957913,0.0000033857443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001236569,0.000018998504,0.00011735834,0.00006219181,0.000022787355,0.0000028959623,0.0005691322,0.9796076,0.0016686221,0.011929925,0.000085951564,0.0059133377],"study_design_scores_gemma":[0.00008160309,0.000005906853,0.000056454013,0.000071202994,0.000005342634,0.0000298435,0.00011237951,0.9949641,0.004107768,0.00029152638,0.00012283071,0.00015102266],"about_ca_topic_score_codex":0.00018939364,"about_ca_topic_score_gemma":0.000010305515,"teacher_disagreement_score":0.89992493,"about_ca_system_score_codex":0.00006498331,"about_ca_system_score_gemma":0.00005894458,"threshold_uncertainty_score":0.6946913},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.7562196e-7,0.00022320802,0.45257366,0.000038793387,0.002387586,0.000083760075,5.01036e-7,0.00019104959,0.544501],"genre_scores_gemma":[0.0051637385,0.000055025157,0.0013400397,0.00086925813,0.0022613965,0.000005461421,0.0000035707199,0.00003492002,0.99026656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865395,0.000015088192,0.00033867723,0.00052069605,0.00021092597,0.0002606684],"domain_scores_gemma":[0.9986836,0.000039604834,0.00015725769,0.00087598496,0.00014181467,0.00010176947],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016222961,0.00027729545,0.00029901747,0.00008882226,0.000098710225,0.00022988326,0.0008583021,0.00038522648,0.0025175666],"category_scores_gemma":[0.000001912614,0.00023199577,0.00021396147,0.000024485895,0.000043587166,0.00010346616,0.00028373857,0.00022315446,0.0017498377],"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.0000022137763,0.000004101002,4.4341522e-7,0.000006239024,0.00007643333,0.000050362087,0.00003935083,0.00070322654,3.264528e-7,0.78322774,0.20766644,0.00822309],"study_design_scores_gemma":[0.000056150093,0.00010331521,1.9980517e-7,0.00006990873,0.0000055903743,0.00017303409,5.3853705e-7,0.16046235,0.0000049798896,0.014394082,0.8244179,0.00031193483],"about_ca_topic_score_codex":0.000005444967,"about_ca_topic_score_gemma":0.000042182335,"teacher_disagreement_score":0.7688337,"about_ca_system_score_codex":0.000050139937,"about_ca_system_score_gemma":0.00002550714,"threshold_uncertainty_score":0.99902743},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.9192145e-8,0.00006519223,0.4973786,0.00018230068,0.0009270064,0.0000846605,1.7708163e-7,0.00014913875,0.5012129],"genre_scores_gemma":[0.0044527417,0.000015587355,0.006392966,0.0011564645,0.0019138696,0.000011150055,0.0000067308656,0.000020928885,0.98602957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989647,0.00001592763,0.00028537156,0.00039255075,0.00016889046,0.0001725191],"domain_scores_gemma":[0.9988221,0.00007152992,0.00017734806,0.00076706975,0.00010306712,0.00005889542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002443265,0.00018090346,0.00022412947,0.000048240752,0.00008671191,0.00012648563,0.0005856165,0.0002453554,0.00019550654],"category_scores_gemma":[0.0000035314354,0.00015457577,0.00011017975,0.00002293117,0.0000145967515,0.00006579461,0.00013915509,0.00017449041,0.0014080903],"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":[4.570441e-7,7.651688e-7,9.2031087e-7,0.0000039606407,0.000009049523,6.604738e-7,0.000009951942,0.00026713507,4.454737e-7,0.85814714,0.124930546,0.016628953],"study_design_scores_gemma":[0.00005020335,0.000024917135,0.0000032944824,0.000058695176,0.0000030845104,0.000012124874,2.165012e-7,0.0661129,0.0000011342038,0.053849038,0.87969774,0.0001866523],"about_ca_topic_score_codex":0.000008441066,"about_ca_topic_score_gemma":0.000020609044,"teacher_disagreement_score":0.8042981,"about_ca_system_score_codex":0.00003689599,"about_ca_system_score_gemma":0.000017278384,"threshold_uncertainty_score":0.99936944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007905831,0.00008461366,0.9877071,0.0001171957,0.0005623907,0.001423924,0.0000013500804,0.00019967696,0.001997932],"genre_scores_gemma":[0.90551484,0.00001962993,0.09389771,0.000110366804,0.00006329896,0.00008068615,4.3855007e-7,0.000027027481,0.00028601842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970449,0.00025499437,0.00090114796,0.0005617418,0.0007401953,0.0004969937],"domain_scores_gemma":[0.9967465,0.00030463986,0.0013602129,0.00036028572,0.0011225383,0.00010583422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026532998,0.00036355888,0.0005211766,0.00024392249,0.0003097044,0.00026812567,0.0012007004,0.0002063094,0.00004414802],"category_scores_gemma":[0.00035226406,0.00027754751,0.00013739419,0.0011257295,0.0001121166,0.0009219603,0.00010190758,0.00025547564,0.000017151982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033749256,0.00045259958,0.0004120468,0.00059297966,0.0002515668,0.000002238616,0.007507204,0.63692003,0.16348264,0.17238455,0.014242428,0.003414213],"study_design_scores_gemma":[0.00044236382,0.0003896114,0.00011480491,0.0008588021,0.000031599608,0.000028123171,0.0001413369,0.91230124,0.06949932,0.01578716,0.00008145772,0.0003241959],"about_ca_topic_score_codex":0.00001072361,"about_ca_topic_score_gemma":4.5515554e-7,"teacher_disagreement_score":0.897609,"about_ca_system_score_codex":0.00013460628,"about_ca_system_score_gemma":0.0004167845,"threshold_uncertainty_score":0.9999677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022669466,0.000027588749,0.9250189,0.00014770884,0.018186862,0.0009816755,0.000032536474,0.00034483094,0.03259042],"genre_scores_gemma":[0.9497102,0.000038810285,0.046580255,0.0008758892,0.0007361439,0.0001210864,0.000015535788,0.000050734285,0.0018713395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944264,0.00048096292,0.0014899804,0.0012939807,0.001469739,0.00083890685],"domain_scores_gemma":[0.9933149,0.0005458094,0.0008069019,0.0012542014,0.0037611444,0.00031702497],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014926476,0.0007401892,0.0008597879,0.0006611749,0.00033744526,0.0005277806,0.0027389962,0.00032078623,0.00016846765],"category_scores_gemma":[0.00033914772,0.0006698562,0.00023118858,0.00115158,0.0001732017,0.000882678,0.00016519858,0.00056877494,0.0010291064],"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.00038090022,0.00080935477,0.00055820716,0.0002233285,0.0003946542,0.000110190274,0.0016249687,0.06960804,0.0021129623,0.8707079,0.029806843,0.023662621],"study_design_scores_gemma":[0.0011487223,0.0013174615,0.00017748834,0.0012178688,0.000014782698,0.00017506289,0.000082428465,0.98622286,0.0055831643,0.00020250071,0.0031648183,0.0006928115],"about_ca_topic_score_codex":0.000053175274,"about_ca_topic_score_gemma":0.0000058577093,"teacher_disagreement_score":0.92704076,"about_ca_system_score_codex":0.0005210577,"about_ca_system_score_gemma":0.0007595305,"threshold_uncertainty_score":0.9997487},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.5673236e-8,0.00039153607,0.08712887,0.001231003,0.001435284,0.000077432225,1.8806543e-7,0.000118277785,0.90961736],"genre_scores_gemma":[0.00044128182,0.00010409722,0.00044929964,0.0007398221,0.000474907,0.0000017584096,4.7446787e-7,0.0000070485435,0.99778134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992746,0.000009789049,0.00019304903,0.00021225841,0.00017492464,0.00013537519],"domain_scores_gemma":[0.99915475,0.00007165448,0.00008345335,0.0005877053,0.00006605728,0.00003637092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019691567,0.0001271612,0.000120818964,0.00002786541,0.0001787246,0.00029561715,0.0007684271,0.00012541829,0.00008516419],"category_scores_gemma":[0.0000027662743,0.00007097651,0.000113881884,0.000013221742,0.0000182691,0.00006550116,0.00008456373,0.00017534003,0.0006475893],"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":[3.0158958e-7,5.3222357e-7,3.0826854e-8,5.03384e-7,0.0000072769813,0.0000030948686,0.000019235584,0.0000034802836,1.2419929e-7,0.8400997,0.076144665,0.08372106],"study_design_scores_gemma":[0.00002153185,0.000028038148,8.5362757e-7,0.000021969267,0.0000013015409,0.000020862672,9.2386995e-7,0.0035930371,0.000001359563,0.072953254,0.9232596,0.00009722696],"about_ca_topic_score_codex":0.000005643515,"about_ca_topic_score_gemma":0.00004413947,"teacher_disagreement_score":0.847115,"about_ca_system_score_codex":0.000025336525,"about_ca_system_score_gemma":0.000023791425,"threshold_uncertainty_score":0.8323666},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09002628,0.000089982765,0.6140983,0.0075172354,0.005635171,0.0014373092,0.000040165192,0.00096477935,0.28019077],"genre_scores_gemma":[0.9936409,0.000028315952,0.003683301,0.0015653137,0.0003643859,0.00013451361,0.00007024429,0.000016230928,0.00049681007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967403,0.000029362258,0.0012611003,0.00045355945,0.0010303794,0.00048532404],"domain_scores_gemma":[0.99721247,0.000039993658,0.0006763515,0.00022625447,0.0016852551,0.00015967329],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008089639,0.00036362914,0.0003038793,0.0009095826,0.00026602836,0.001363485,0.001089667,0.00020248367,0.00028282704],"category_scores_gemma":[0.00027842875,0.00035515698,0.00010223991,0.00088763714,0.000055782122,0.006891922,0.00011346297,0.00038676985,0.00055207],"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.00004607323,0.00011186881,0.0011852742,0.000037107013,0.000029478024,0.000002724348,0.006647006,0.0036150792,0.000119761105,0.97950757,0.0031644274,0.005533648],"study_design_scores_gemma":[0.008183766,0.0010743222,0.009979966,0.0018449281,0.00001983307,0.00029976232,0.0052660955,0.8359497,0.0025716757,0.06438813,0.0681631,0.0022587308],"about_ca_topic_score_codex":0.00024119028,"about_ca_topic_score_gemma":0.000037867474,"teacher_disagreement_score":0.9151194,"about_ca_system_score_codex":0.0007959247,"about_ca_system_score_gemma":0.00031399765,"threshold_uncertainty_score":0.99989},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15978992,0.00028895945,0.81156135,0.0023568792,0.0012010502,0.00042343437,8.7635317e-7,0.00049988984,0.023877613],"genre_scores_gemma":[0.9651482,0.000018373386,0.029830514,0.0009494708,0.00024651623,0.0000589603,8.131986e-7,0.000015889724,0.0037312733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977935,0.00008968921,0.0006370598,0.0006279685,0.00031188206,0.0005398944],"domain_scores_gemma":[0.9986958,0.00014644729,0.00011472073,0.000827142,0.000117753065,0.00009813011],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061358116,0.00022097526,0.00032924218,0.00055584696,0.00011498122,0.00016783009,0.0010127207,0.0002968728,0.00042831688],"category_scores_gemma":[0.000067050074,0.0001808507,0.00010088129,0.0011600315,0.000053169264,0.0004924394,0.0003587556,0.00029012928,0.0012680556],"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.000070588314,0.00053440966,0.006733132,0.00002160712,0.000038318714,0.00012063707,0.0011096894,0.0034686183,0.0017982473,0.4638581,0.045617696,0.47662896],"study_design_scores_gemma":[0.0024670262,0.0004502282,0.0021422773,0.0002666267,0.00000720105,0.0003500878,0.0005870808,0.6825841,0.0039432542,0.009214375,0.29704538,0.0009423418],"about_ca_topic_score_codex":0.00018386115,"about_ca_topic_score_gemma":0.0015171071,"teacher_disagreement_score":0.8053583,"about_ca_system_score_codex":0.00016322984,"about_ca_system_score_gemma":0.000056734098,"threshold_uncertainty_score":0.9995096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6607926,0.000020166055,0.3310614,0.00012425944,0.0008513884,0.00005696492,1.2856017e-7,0.000023698703,0.007069406],"genre_scores_gemma":[0.993313,0.0000034620723,0.0063710683,0.000028698341,0.000055049128,0.0000038917333,1.7042397e-7,0.0000018604896,0.0002227887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995593,0.000022412592,0.00014056163,0.00013302887,0.00006618866,0.00007852244],"domain_scores_gemma":[0.9997032,0.000059170652,0.000045582303,0.00014229432,0.000029719009,0.000020015425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441826,0.000039382736,0.000072261486,0.000052492378,0.000026780794,0.000054111555,0.000120806,0.00003398951,0.000016043237],"category_scores_gemma":[0.000022498314,0.000033869725,0.000010374209,0.00012301962,0.000014122814,0.00026906424,0.00003321135,0.00007440373,0.0000026043883],"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.0000050419612,0.00005176477,0.028172217,0.000028656304,0.0000057421166,0.000009187876,0.006079742,0.00008919278,0.020334525,0.9247827,0.00045728163,0.019983929],"study_design_scores_gemma":[0.000993493,0.00020308839,0.117456295,0.00014694218,0.0000026871048,0.00013641952,0.0011043578,0.86303896,0.0067567276,0.005850373,0.0039126994,0.0003979492],"about_ca_topic_score_codex":0.00011604136,"about_ca_topic_score_gemma":0.00039693897,"teacher_disagreement_score":0.9189323,"about_ca_system_score_codex":0.000005897623,"about_ca_system_score_gemma":0.000010897279,"threshold_uncertainty_score":0.13811673},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006195842,0.0020808473,0.19856171,0.00004698448,0.0058233133,0.0006262925,0.00015040056,0.00019114913,0.79251313],"genre_scores_gemma":[0.0050420747,0.0015292016,0.0051510357,0.000086750406,0.0030141028,0.00004068146,0.00058490445,0.000084251835,0.98446697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997047,0.00009383842,0.0011519741,0.0007449457,0.00065914716,0.0003031066],"domain_scores_gemma":[0.99709034,0.00016564694,0.0009362107,0.0013694812,0.0002917619,0.00014658894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061993464,0.00044065603,0.000767877,0.0003400142,0.00008623763,0.00012013764,0.0010250838,0.0003234602,0.000059020418],"category_scores_gemma":[0.000027173408,0.00041727032,0.00022410724,0.00009569607,0.00003731172,0.0005797123,0.00021577682,0.00036781584,0.00029248724],"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.00000826847,0.000041765416,0.000007688652,0.00040107936,0.00012589472,0.000065033644,0.0004058453,0.0011035609,0.000010241803,0.8343999,0.119719945,0.043710813],"study_design_scores_gemma":[0.00023881762,0.00015283767,0.000009624942,0.0013029737,0.000031580537,0.0000968317,0.000012809759,0.020065881,0.000006074212,0.0017896368,0.9757796,0.0005133606],"about_ca_topic_score_codex":0.00011630788,"about_ca_topic_score_gemma":0.000021418053,"teacher_disagreement_score":0.8560596,"about_ca_system_score_codex":0.000093819865,"about_ca_system_score_gemma":0.00015739116,"threshold_uncertainty_score":0.9998279},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24119593,0.000033964636,0.757527,0.00040152142,0.000050798855,0.00041494798,0.0000015178096,0.0001198963,0.00025439338],"genre_scores_gemma":[0.98440725,0.00006751963,0.015283175,0.00013176481,0.000032503027,0.000044414403,0.000004420985,0.000008735679,0.000020223915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897414,0.000010675885,0.00035393675,0.00033778744,0.00015165152,0.00017180602],"domain_scores_gemma":[0.99925095,0.000059683764,0.00018403743,0.00007649564,0.00035143184,0.00007739426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042789965,0.00013625271,0.00018786648,0.00021721207,0.00010648139,0.00017529265,0.00013794635,0.00006908515,0.0000016722339],"category_scores_gemma":[0.00017487505,0.00012775772,0.000015235314,0.00057421636,0.000030480258,0.00089410116,0.000060600818,0.000083976876,0.000009870997],"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.00009188629,0.0005012314,0.008993024,0.00079659204,0.000029280609,0.0000060781354,0.021739637,0.0015618855,0.23375882,0.5577454,0.00031955045,0.1744566],"study_design_scores_gemma":[0.0021648875,0.000657138,0.028951278,0.00079670764,0.000013934704,0.00007417045,0.00069020974,0.9124234,0.040569652,0.012898221,0.00026583794,0.0004945785],"about_ca_topic_score_codex":0.000049992163,"about_ca_topic_score_gemma":0.000010214543,"teacher_disagreement_score":0.9108615,"about_ca_system_score_codex":0.000037584807,"about_ca_system_score_gemma":0.000037679056,"threshold_uncertainty_score":0.5209809},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011391736,0.00014423524,0.32527447,0.00013303102,0.0041999016,0.00013340711,9.817895e-7,0.00038993504,0.6697229],"genre_scores_gemma":[0.0017287518,0.000027139178,0.0048777526,0.0010875094,0.0038822205,0.000007549803,0.00000800117,0.00004239902,0.98833865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982469,0.000027812737,0.00047694342,0.0006391695,0.00025191248,0.00035723328],"domain_scores_gemma":[0.9982864,0.00009381599,0.00022432479,0.0010267209,0.00025223283,0.000116469986],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029884392,0.00035004053,0.00041565136,0.0001130781,0.00012515663,0.00027102174,0.001147979,0.00041472673,0.005793563],"category_scores_gemma":[0.0000086098835,0.00029457398,0.00023590135,0.000058680194,0.000058045243,0.00020173886,0.0004389985,0.00032022592,0.004421102],"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.000001663847,0.0000017677986,4.577161e-7,0.0000045905963,0.000043400196,0.000009878701,0.000052486215,0.000010412443,4.5163233e-7,0.63733286,0.3601371,0.002404943],"study_design_scores_gemma":[0.00008645828,0.000122006735,0.000001106119,0.00021595345,0.000007706837,0.00006400186,0.0000025077698,0.0117077185,0.0000045832603,0.10413168,0.88328516,0.00037113443],"about_ca_topic_score_codex":0.0000108004815,"about_ca_topic_score_gemma":0.00010738342,"teacher_disagreement_score":0.53320116,"about_ca_system_score_codex":0.00007143369,"about_ca_system_score_gemma":0.00005146825,"threshold_uncertainty_score":0.99995065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005345112,0.009254161,0.09834163,0.005880268,0.043782223,0.0075960187,0.000092760354,0.00030633932,0.8294015],"genre_scores_gemma":[0.8445615,0.0011311288,0.002546819,0.0005050875,0.0026076545,0.00053677213,0.000009199173,0.00005945992,0.14804237],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857885,0.00005944696,0.00047397194,0.0003945262,0.00023392834,0.0002592587],"domain_scores_gemma":[0.9976227,0.00044972083,0.00047968648,0.0011422898,0.00025534915,0.000050221526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003062243,0.00024874334,0.000421421,0.00011576065,0.0004533799,0.00023437027,0.0027779343,0.00022424596,0.0000022183438],"category_scores_gemma":[0.000015313317,0.00015563643,0.00016197575,0.0002456258,0.00012233191,0.000040375915,0.00054287293,0.00035226392,0.000012990746],"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.000013553825,0.000042593976,0.000037208392,0.00040141193,0.000116243114,1.1032055e-7,0.0012514176,0.006847485,0.00015903497,0.02897099,0.9614466,0.0007133438],"study_design_scores_gemma":[0.00034862373,0.00027934814,0.000029781828,0.0019325543,0.000026064119,0.00014411204,0.000116828785,0.23148538,0.00029413623,0.00025793837,0.76463056,0.0004546702],"about_ca_topic_score_codex":0.00011387622,"about_ca_topic_score_gemma":0.000018782346,"teacher_disagreement_score":0.8392164,"about_ca_system_score_codex":0.000045788915,"about_ca_system_score_gemma":0.000058373313,"threshold_uncertainty_score":0.634667},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25328705,0.00018599957,0.73538125,0.0052264743,0.0011572243,0.0007627017,0.0000017119214,0.00026709735,0.0037305043],"genre_scores_gemma":[0.9083921,0.00003345039,0.07891524,0.010748858,0.0014504783,0.000059315415,0.000006960031,0.000024917741,0.0003686991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641037,0.00025479018,0.000758192,0.00094748836,0.00062869606,0.0010004473],"domain_scores_gemma":[0.99786276,0.00034549975,0.00018598247,0.0013605859,0.00008656788,0.00015861414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006534568,0.00045459383,0.0005990807,0.0002914311,0.00025691968,0.00030820054,0.0022678874,0.00016334806,0.00003156472],"category_scores_gemma":[0.00003560103,0.00037317755,0.00018798708,0.00055416254,0.00005359592,0.00059913384,0.0007130195,0.0008558435,0.000038456914],"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.0002675861,0.00035832348,0.007688814,0.00011623883,0.00013054085,0.00013904214,0.016647026,0.22282276,0.0016422605,0.0037364145,0.028151197,0.7182998],"study_design_scores_gemma":[0.0056706443,0.0022061737,0.02948669,0.0007590313,0.000020378016,0.00037443143,0.00008491092,0.8756837,0.00063864357,0.0070503554,0.07668118,0.0013438053],"about_ca_topic_score_codex":0.00007430556,"about_ca_topic_score_gemma":0.000057438032,"teacher_disagreement_score":0.716956,"about_ca_system_score_codex":0.00013891543,"about_ca_system_score_gemma":0.00006522365,"threshold_uncertainty_score":0.999872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026946124,0.00025759882,0.95362633,0.00019569304,0.013181659,0.001508844,0.000012621077,0.0005435175,0.02797912],"genre_scores_gemma":[0.97467136,0.00001330572,0.00079627725,0.0004861809,0.0007895894,0.00040984128,0.00038141926,0.000053784814,0.022398265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974354,0.00015991648,0.000707474,0.00085496507,0.00040249978,0.000439738],"domain_scores_gemma":[0.9982496,0.00028453907,0.0003736222,0.0006864639,0.00028857827,0.00011720553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052167714,0.00047764907,0.0006025303,0.000467053,0.00022383954,0.0005580092,0.0007491157,0.0005053746,0.000028367513],"category_scores_gemma":[0.000029420742,0.00040866953,0.00046897284,0.00034196608,0.000007669028,0.00027259762,0.000004190236,0.0003492291,0.00008374551],"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.0012144059,0.00083274447,0.0000058797286,0.0024679562,0.0004844707,0.000032160966,0.0024061617,0.03133723,0.0010744066,0.19422624,0.0757085,0.69020987],"study_design_scores_gemma":[0.002012933,0.002902128,0.00020430707,0.0022248998,0.000089481866,0.00003104484,0.0009726417,0.93089736,0.008969704,0.0010572668,0.048975717,0.0016625425],"about_ca_topic_score_codex":0.00018005955,"about_ca_topic_score_gemma":0.00050937687,"teacher_disagreement_score":0.9719767,"about_ca_system_score_codex":0.00020291877,"about_ca_system_score_gemma":0.00012822107,"threshold_uncertainty_score":0.9998365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005946122,0.00022716341,0.9810937,0.0062706526,0.00048700164,0.00024335619,3.8637222e-7,0.0002233188,0.0055082673],"genre_scores_gemma":[0.95860916,0.00001796507,0.040678106,0.00025608373,0.00005930723,0.00009398787,0.0000013246637,0.0000050427416,0.00027902686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933827,0.000021663005,0.00020515616,0.00018111266,0.000051377137,0.0002024395],"domain_scores_gemma":[0.9990561,0.00007482845,0.000050957307,0.0007380428,0.000056889723,0.000023186047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025889176,0.000069615766,0.000116025694,0.0001582879,0.00013026402,0.000073558236,0.0009387411,0.00008092113,0.0000028557772],"category_scores_gemma":[0.000011926096,0.00006328512,0.000037434267,0.00049371424,0.00003424059,0.00017441137,0.00020840924,0.000112800146,0.00000910139],"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.0000018675167,0.000051872685,0.00084966194,0.0000053425492,0.00000791878,0.0000020525813,0.00038742615,0.0084942635,0.00009837585,0.9780342,0.0007253055,0.0113417385],"study_design_scores_gemma":[0.0012782057,0.00019077754,0.0004535081,0.00020337115,0.000003431511,0.00006424873,0.0005386722,0.7323297,0.00032349184,0.13093233,0.13330245,0.0003797818],"about_ca_topic_score_codex":0.00007799838,"about_ca_topic_score_gemma":0.001267053,"teacher_disagreement_score":0.952663,"about_ca_system_score_codex":0.00008066034,"about_ca_system_score_gemma":0.000030673218,"threshold_uncertainty_score":0.25806922},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016304605,0.000037442514,0.9855109,0.00039946407,0.00090095535,0.00021397925,0.000001603311,0.00013327837,0.011171931],"genre_scores_gemma":[0.8112425,0.00000223548,0.17304735,0.0012228084,0.00069923344,0.00010396711,0.0000040117097,0.0000095414825,0.013668361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993189,0.00004929929,0.00015331437,0.00023051022,0.00009804582,0.00014992448],"domain_scores_gemma":[0.99949586,0.0000777118,0.000045357072,0.00018365339,0.00014508543,0.000052343297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001685375,0.00007414653,0.00009487119,0.000042684638,0.00017476012,0.00024901505,0.00021273461,0.00003754029,0.00016083811],"category_scores_gemma":[0.00000748924,0.000060732655,0.0000472501,0.00011850134,0.000011277464,0.00063452777,0.000024171595,0.000039249266,0.000044260756],"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.0000026028663,0.00010919173,0.000018390487,0.000010466558,0.00003523019,0.0000124488315,0.01340001,0.0011237464,0.0001819066,0.12269947,0.026691467,0.83571506],"study_design_scores_gemma":[0.0002078514,0.00017321813,0.000014748117,0.000006717276,0.0000013669396,0.000025374891,0.00032006775,0.9911626,0.00036484664,0.00042397025,0.0072035315,0.00009570281],"about_ca_topic_score_codex":0.0000095002115,"about_ca_topic_score_gemma":0.000016183149,"teacher_disagreement_score":0.9900389,"about_ca_system_score_codex":0.000026908803,"about_ca_system_score_gemma":0.0000060050224,"threshold_uncertainty_score":0.24766058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008531424,0.00006511472,0.98393303,0.0007998751,0.0039468654,0.0005366003,0.0000033991569,0.00017086162,0.0020128023],"genre_scores_gemma":[0.9813623,0.000032244356,0.01294805,0.0020694553,0.0023720558,0.0000830728,0.00015712414,0.000027902424,0.00094783795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998517,0.00009882754,0.00031415507,0.0006671702,0.00017277244,0.00023008355],"domain_scores_gemma":[0.99896187,0.000114522896,0.00015998322,0.00045757217,0.00023884168,0.00006719712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003106806,0.00022536836,0.00026547894,0.00007465762,0.00017151513,0.0007640036,0.00032741734,0.00027200612,0.000013433865],"category_scores_gemma":[0.000042272313,0.00020118887,0.00007799609,0.00019755974,0.000012995384,0.00014709459,0.0004127954,0.00030040886,0.0000042283937],"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.000029573164,0.000109754765,0.00013558478,0.0001863569,0.00016734346,0.000008768971,0.004589731,0.29494032,0.000072374234,0.6725245,0.014994232,0.012241425],"study_design_scores_gemma":[0.00034413463,0.00026219303,0.00035607608,0.0003492693,0.000015040739,0.000036749414,0.000101050144,0.9887874,0.00036644412,0.007194652,0.0017133177,0.0004736449],"about_ca_topic_score_codex":0.000015426267,"about_ca_topic_score_gemma":0.000058197544,"teacher_disagreement_score":0.97283083,"about_ca_system_score_codex":0.0000381305,"about_ca_system_score_gemma":0.00007678914,"threshold_uncertainty_score":0.82042444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05584287,0.000033321852,0.9279089,0.00052144367,0.001322654,0.00046849434,0.0000026485195,0.00039716915,0.013502507],"genre_scores_gemma":[0.956647,3.5606772e-7,0.02391756,0.00088671705,0.00016335813,0.000050607236,0.0000035986413,0.000017281913,0.018313546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797827,0.00013458653,0.0004381993,0.00064251694,0.00035896536,0.00044743269],"domain_scores_gemma":[0.9989176,0.00013258526,0.00013194361,0.00056371535,0.00015155983,0.000102636615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041605753,0.00025277556,0.00026359336,0.00022874582,0.0004663928,0.00018438158,0.0005365884,0.00011316719,0.000060869064],"category_scores_gemma":[0.000022710083,0.00020566487,0.00016975198,0.00054344395,0.00005472253,0.00008264234,0.00012613715,0.00016482461,0.00013088301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032947064,0.000977596,0.0006705654,0.000013239736,0.000023639028,0.000026384441,0.00058994995,0.96718097,0.00021369831,0.00773529,0.021344816,0.001190903],"study_design_scores_gemma":[0.0015000211,0.00024228354,0.0020019598,0.000041035804,0.0000034156376,0.000009477329,0.00008131727,0.98967105,0.00082340423,0.000013838308,0.005330106,0.00028211856],"about_ca_topic_score_codex":0.00060102117,"about_ca_topic_score_gemma":0.00044523441,"teacher_disagreement_score":0.90399134,"about_ca_system_score_codex":0.00017188002,"about_ca_system_score_gemma":0.00008913289,"threshold_uncertainty_score":0.838677},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019228808,0.00025600658,0.2995148,0.000095176736,0.0045837327,0.00010114612,0.0000012328996,0.0005359111,0.6949101],"genre_scores_gemma":[0.01716277,0.00001037589,0.002021575,0.00080231036,0.0012803848,0.000013558461,0.0000029019284,0.00017408993,0.978532],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882376,0.00009136486,0.00019818221,0.00037362525,0.00018338845,0.00032969896],"domain_scores_gemma":[0.99886006,0.000104514766,0.00013215584,0.0007894034,0.000018638679,0.00009521609],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025265117,0.00024109716,0.00028057053,0.00037866153,0.00003967222,0.0001472351,0.0007974208,0.00023232836,0.005601583],"category_scores_gemma":[0.000016818665,0.00018399786,0.00012879228,0.0002057944,0.00001439052,0.000094553136,0.00015236765,0.00021759573,0.0032199032],"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":[4.5673548e-7,0.000011513928,0.0000046814544,0.000009008967,0.00002098905,0.0000024277542,0.00003783824,0.0000024609647,8.8480994e-7,0.39590916,0.5995037,0.0044969055],"study_design_scores_gemma":[0.00009224554,0.000041954216,0.0000028583556,0.00023658731,0.0000030291033,0.000018398337,0.0000071519094,0.002217114,0.000013356913,0.0007150505,0.9963821,0.00027011684],"about_ca_topic_score_codex":0.00017058624,"about_ca_topic_score_gemma":0.00013488508,"teacher_disagreement_score":0.39687848,"about_ca_system_score_codex":0.000035514542,"about_ca_system_score_gemma":0.000017312106,"threshold_uncertainty_score":0.9975562},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.9937518e-7,0.000027207869,0.34346974,0.000066032095,0.0015047326,0.000043423966,2.5345648e-7,0.00014288355,0.65474534],"genre_scores_gemma":[0.0033104033,0.000004813108,0.002418412,0.00040113603,0.0012213441,0.0000013527193,0.0000010256867,0.00001365014,0.99262786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991881,0.0000065964637,0.0002133037,0.00030405293,0.00015049215,0.00013741062],"domain_scores_gemma":[0.99925053,0.000028171811,0.00010717637,0.00047422267,0.000096640884,0.000043266013],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017431244,0.0001404132,0.00016383547,0.000057962632,0.00007097344,0.0001555315,0.00051115727,0.0001701549,0.0017893735],"category_scores_gemma":[0.0000033220117,0.000114241004,0.000101784615,0.000013918856,0.000018805393,0.00010265553,0.00018609593,0.00013007199,0.0027456677],"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":[1.9711383e-7,6.311863e-7,3.020872e-7,0.0000021398203,0.000011151327,0.000004058333,0.00006552399,9.489895e-7,5.3278865e-7,0.9200955,0.0763068,0.003512206],"study_design_scores_gemma":[0.000036293335,0.000040238458,4.721466e-7,0.000091583664,0.0000023486773,0.000034390632,0.0000027157782,0.017706143,0.000008578333,0.036284912,0.9455995,0.00019285371],"about_ca_topic_score_codex":0.00000841681,"about_ca_topic_score_gemma":0.000018430826,"teacher_disagreement_score":0.8838106,"about_ca_system_score_codex":0.000031785796,"about_ca_system_score_gemma":0.00002354392,"threshold_uncertainty_score":0.9991231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024868206,0.00032823617,0.37650272,0.000008848377,0.0030148106,0.0003926597,0.000014362739,0.00020367444,0.6195098],"genre_scores_gemma":[0.71512437,2.8745558e-7,0.008630755,0.000271669,0.0011104612,0.000019248038,0.0000036964748,0.00005284944,0.27478665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975295,0.00002210931,0.0005752962,0.000982066,0.00036461293,0.00052638794],"domain_scores_gemma":[0.9981711,0.000040178664,0.0005087168,0.0007026978,0.00041973975,0.00015756908],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000497309,0.00041541937,0.00046177563,0.00010363592,0.00052701833,0.0010475182,0.0011981926,0.00026921293,0.0000093761855],"category_scores_gemma":[0.000006022385,0.00039856086,0.00030671703,0.000039273014,0.00011283731,0.00014630424,0.00035795677,0.00022930448,0.00013542984],"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.000006015192,0.0000075529733,0.0000018163747,0.00009396568,0.000017866605,0.00001090747,0.00028428953,0.000038245475,0.000016099635,0.9682079,0.0060849586,0.025230385],"study_design_scores_gemma":[0.00093414594,0.00020568747,0.0000024788537,0.0012499607,0.00005989674,0.00015282823,0.00001754683,0.06484683,0.00037745445,0.71481407,0.21603334,0.0013057829],"about_ca_topic_score_codex":0.000037532354,"about_ca_topic_score_gemma":0.000033540746,"teacher_disagreement_score":0.7150995,"about_ca_system_score_codex":0.00018478167,"about_ca_system_score_gemma":0.00028279776,"threshold_uncertainty_score":0.9999895},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.3644257e-7,0.00014700042,0.48902276,0.0001405848,0.0030140649,0.00010941482,3.4592696e-7,0.00028074143,0.5072849],"genre_scores_gemma":[0.04393768,0.00010354953,0.001535486,0.00078770396,0.0014082633,0.00001143995,0.00000721074,0.00004634593,0.9521623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984708,0.000015682715,0.0004401555,0.0005883361,0.0002229922,0.0002620462],"domain_scores_gemma":[0.9987783,0.00004877576,0.00020374321,0.0007342564,0.00013378465,0.000101156416],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021073806,0.00033213265,0.00034779176,0.00018116855,0.00011111485,0.00026621475,0.000712479,0.00047906747,0.0010542226],"category_scores_gemma":[0.0000045149836,0.00029403585,0.00026602397,0.000046110665,0.000030344538,0.0002869086,0.0002266878,0.0004762321,0.0006478102],"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.000001771954,0.0000043176447,3.6116612e-7,0.0000073208757,0.000039535556,0.0000167639,0.00002923445,0.002216803,5.311457e-7,0.97717255,0.01123067,0.009280144],"study_design_scores_gemma":[0.00034394517,0.00022932274,0.0000030095875,0.000573662,0.000019207728,0.00023467907,0.0000069279113,0.11330497,0.000013172555,0.22649583,0.6578918,0.0008834655],"about_ca_topic_score_codex":0.000035532466,"about_ca_topic_score_gemma":0.000083482606,"teacher_disagreement_score":0.7506767,"about_ca_system_score_codex":0.00023498893,"about_ca_system_score_gemma":0.00006201445,"threshold_uncertainty_score":0.9999512},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022463737,0.0008096251,0.9757607,0.00048354556,0.00039175077,0.000024124445,4.1066895e-7,0.000007222946,0.00005890193],"genre_scores_gemma":[0.9958891,0.000006154017,0.0035952132,0.00025534208,0.00024390832,1.9995817e-7,6.358984e-8,0.0000031998356,0.000006772505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947643,0.000010851584,0.00022299954,0.00007021372,0.00006845252,0.00015105882],"domain_scores_gemma":[0.9993722,0.00003872524,0.000065127264,0.000046228422,0.00009519177,0.0003825598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006569189,0.00005686334,0.00016518675,0.000092628194,0.00002191142,0.000053160962,0.00022759807,0.000027068189,0.000002993661],"category_scores_gemma":[0.00002347134,0.000049383205,0.000041049174,0.00025879324,0.000006158055,0.00012931963,0.000013677917,0.0001248112,6.114076e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005504339,0.00008029423,0.020437498,0.0003693696,0.00080264,0.0015594091,0.0061694155,0.27564508,0.007875154,0.4108882,0.059890524,0.21622738],"study_design_scores_gemma":[0.00019003781,0.00029003792,0.0010376503,0.000036809113,0.0000031362922,0.0001748864,0.0000020378109,0.9847684,0.00030959817,0.00004153723,0.013075418,0.00007048505],"about_ca_topic_score_codex":0.00012595038,"about_ca_topic_score_gemma":0.000020812695,"teacher_disagreement_score":0.9734254,"about_ca_system_score_codex":0.000013997627,"about_ca_system_score_gemma":0.000078746336,"threshold_uncertainty_score":0.20137887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98023355,0.00007813285,0.0028507442,0.0000257817,0.0027566561,0.00018069119,0.0000027187343,0.000027752412,0.013843975],"genre_scores_gemma":[0.9943897,0.0000012002109,0.0021275121,0.000053526197,0.00008671898,0.0000027099686,0.000014102232,0.0000059191943,0.0033186153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871176,0.000100234836,0.0004633406,0.0002447942,0.00036820117,0.000111655005],"domain_scores_gemma":[0.99863946,0.00010521221,0.00026373193,0.0006041604,0.0003537072,0.000033697313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005425683,0.0001123071,0.00024020435,0.000057683643,0.000051528445,0.0000135701475,0.0006635949,0.00016637228,0.000051515643],"category_scores_gemma":[0.000032634256,0.000068885616,0.00015041904,0.00022176125,0.00002914682,0.00014778928,0.000043366766,0.00013892465,0.0000043550185],"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.001879465,0.006187495,0.013529161,0.0058851284,0.0016196215,0.00003071135,0.04243408,0.06806645,0.10458236,0.5750221,0.019602733,0.16116068],"study_design_scores_gemma":[0.0006040993,0.0006345025,0.054011453,0.00067702663,0.00007223379,0.000032056996,0.0012320487,0.76771367,0.16773084,0.0031383848,0.0034574966,0.00069619936],"about_ca_topic_score_codex":0.00038813957,"about_ca_topic_score_gemma":0.00093142834,"teacher_disagreement_score":0.6996472,"about_ca_system_score_codex":0.000016749702,"about_ca_system_score_gemma":0.00009733057,"threshold_uncertainty_score":0.2809074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041573778,0.0007945169,0.94487244,0.0015506063,0.0020185157,0.0003249974,0.000002425259,0.00020603254,0.00865672],"genre_scores_gemma":[0.9977681,0.00003478393,0.0013740332,0.00012426099,0.00042597865,0.000013599561,0.0000014283784,0.000006415524,0.0002513848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863505,0.00017834442,0.0004165962,0.0002574731,0.00020001976,0.0003125344],"domain_scores_gemma":[0.9983276,0.0004918324,0.00017257812,0.00075815764,0.00018705857,0.00006276263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006769016,0.000114364455,0.0001845581,0.000027590999,0.000247905,0.000109384586,0.0007842478,0.00007935491,0.000014642969],"category_scores_gemma":[0.000037778274,0.00007596073,0.00012065228,0.00033926332,0.00010014127,0.00019009707,0.00012340136,0.0002048366,0.000012218513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065961205,0.00013538617,0.005421749,0.000014929273,0.00008672295,0.0000027669482,0.00059511745,0.5230493,0.0001018251,0.32647854,0.053148303,0.09089939],"study_design_scores_gemma":[0.00019845618,0.00006550858,0.0040632756,0.000018571507,0.0000031452678,0.000006326809,0.000025265235,0.90515685,0.000023616349,0.0005007294,0.08984154,0.000096708754],"about_ca_topic_score_codex":0.00003407713,"about_ca_topic_score_gemma":0.000178765,"teacher_disagreement_score":0.95619434,"about_ca_system_score_codex":0.000030538467,"about_ca_system_score_gemma":0.000020107924,"threshold_uncertainty_score":0.30975884},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1031973e-7,0.00013251783,0.45396355,0.00010562105,0.002825807,0.00010441327,4.785256e-7,0.00021439797,0.5426529],"genre_scores_gemma":[0.0020717464,0.000051503128,0.0032419604,0.0006530756,0.0028402717,0.0000061146493,0.0000040745686,0.000037483405,0.99109375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844027,0.000020579979,0.00036656926,0.0005932407,0.00026773123,0.0003116015],"domain_scores_gemma":[0.99838936,0.000062360865,0.00020570212,0.0010260491,0.00019253827,0.00012398964],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002619242,0.00032663564,0.00037230738,0.00012207008,0.000112951275,0.00028199682,0.00090913917,0.00047164914,0.003359205],"category_scores_gemma":[0.000004267925,0.00027114176,0.00022512468,0.00004272245,0.00005687643,0.00017416818,0.0003130211,0.00032306928,0.0022035404],"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.0000014104296,0.000002205416,2.8063903e-7,0.0000037165619,0.000033107208,0.000011030628,0.000046543846,0.000084685824,3.336231e-7,0.67424107,0.3241464,0.0014292253],"study_design_scores_gemma":[0.0000912968,0.00008904996,6.5778596e-7,0.00011474099,0.0000073129154,0.000052149222,0.00000372767,0.14814377,0.0000051795337,0.020625107,0.8305001,0.0003669067],"about_ca_topic_score_codex":0.000008149644,"about_ca_topic_score_gemma":0.00004846737,"teacher_disagreement_score":0.65361595,"about_ca_system_score_codex":0.000059934522,"about_ca_system_score_gemma":0.000043216536,"threshold_uncertainty_score":0.9999741},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100316135,0.00024283554,0.9850357,0.0012059816,0.0003585997,0.001677825,0.00000485416,0.00030416474,0.001138434],"genre_scores_gemma":[0.9188093,0.000030959785,0.07913025,0.00008651442,0.00020474242,0.0002730612,0.000002718895,0.000025942789,0.0014365249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976211,0.00008448722,0.0007045172,0.0006376359,0.00034389077,0.0006083568],"domain_scores_gemma":[0.99824065,0.00020191119,0.00061387365,0.00025221976,0.00051982224,0.00017153757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019850074,0.00036266338,0.00045378468,0.00023316863,0.00054037175,0.0009943527,0.0005563239,0.0002541984,0.000022672837],"category_scores_gemma":[0.00013100525,0.00028154004,0.00013187576,0.00029322694,0.00016336792,0.0010548467,0.00010930699,0.00022646163,0.00000575868],"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.001741034,0.001626265,0.01774694,0.0024077715,0.0013457027,0.0000028233494,0.034457527,0.038877346,0.027668063,0.39887002,0.12976083,0.34549567],"study_design_scores_gemma":[0.0009173222,0.00021054236,0.00034401807,0.00027589203,0.00004590071,0.000023799643,0.0009485078,0.9815126,0.006185995,0.0013491478,0.007837099,0.0003491896],"about_ca_topic_score_codex":0.000006349934,"about_ca_topic_score_gemma":0.0000036149531,"teacher_disagreement_score":0.94263524,"about_ca_system_score_codex":0.00006837283,"about_ca_system_score_gemma":0.000121708574,"threshold_uncertainty_score":0.9999637},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022463737,0.0008096251,0.9757607,0.00048354556,0.00039175077,0.000024124445,4.1066895e-7,0.000007222946,0.00005890193],"genre_scores_gemma":[0.9958891,0.000006154017,0.0035952132,0.00025534208,0.00024390832,1.9995817e-7,6.358984e-8,0.0000031998356,0.000006772505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947643,0.000010851584,0.00022299954,0.00007021372,0.00006845252,0.00015105882],"domain_scores_gemma":[0.9993722,0.00003872524,0.000065127264,0.000046228422,0.00009519177,0.0003825598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006569189,0.00005686334,0.00016518675,0.000092628194,0.00002191142,0.000053160962,0.00022759807,0.000027068189,0.000002993661],"category_scores_gemma":[0.00002347134,0.000049383205,0.000041049174,0.00025879324,0.000006158055,0.00012931963,0.000013677917,0.0001248112,6.114076e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005504339,0.00008029423,0.020437498,0.0003693696,0.00080264,0.0015594091,0.0061694155,0.27564508,0.007875154,0.4108882,0.059890524,0.21622738],"study_design_scores_gemma":[0.00019003781,0.00029003792,0.0010376503,0.000036809113,0.0000031362922,0.0001748864,0.0000020378109,0.9847684,0.00030959817,0.00004153723,0.013075418,0.00007048505],"about_ca_topic_score_codex":0.00012595038,"about_ca_topic_score_gemma":0.000020812695,"teacher_disagreement_score":0.9734254,"about_ca_system_score_codex":0.000013997627,"about_ca_system_score_gemma":0.000078746336,"threshold_uncertainty_score":0.20137887},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000424339,0.00024224042,0.07012147,0.000027983928,0.0016359794,0.0002465155,0.000031081836,0.00033739296,0.9273531],"genre_scores_gemma":[0.0018613179,0.000025581767,0.00027095366,0.00008732555,0.0003309045,6.042999e-7,0.000011035065,0.00003164792,0.9973806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841803,0.00006325776,0.0002383018,0.0006546399,0.00032699973,0.00029879584],"domain_scores_gemma":[0.9980996,0.00006194752,0.00024321627,0.0009976489,0.0003554632,0.00024207502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002363395,0.00036532464,0.00044063557,0.0002195603,0.00013816037,0.00015369068,0.0015407883,0.00038537502,0.000005293948],"category_scores_gemma":[0.000008548436,0.0004046634,0.00026372646,0.000011518122,0.00009479771,0.00023230164,0.00086795323,0.00047629254,0.000097665215],"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.00001183398,0.000003015967,9.8206286e-8,0.000017245406,0.000067704925,0.00020997059,0.000050654395,0.000007096719,0.0000029774671,0.78718996,0.21004611,0.0023933607],"study_design_scores_gemma":[0.00033133687,0.000082917984,3.1685207e-7,0.00017026877,0.000034270302,0.00008007551,0.000016479067,0.0026178875,0.000029923223,0.00007905905,0.9961159,0.00044152592],"about_ca_topic_score_codex":0.00010557472,"about_ca_topic_score_gemma":0.0000044580497,"teacher_disagreement_score":0.78711087,"about_ca_system_score_codex":0.00032118408,"about_ca_system_score_gemma":0.0001414668,"threshold_uncertainty_score":0.9998405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007388858,0.0000755486,0.976298,0.0009937754,0.0023383875,0.000270341,0.000001071733,0.00048326835,0.01215076],"genre_scores_gemma":[0.6157374,0.000007115342,0.37968498,0.00286814,0.0012841148,0.000033279535,0.000002501572,0.000027396856,0.0003550894],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977329,0.00024157156,0.00039706822,0.0006914769,0.0003585132,0.00057846395],"domain_scores_gemma":[0.9974759,0.00021372299,0.000107500404,0.0018702843,0.000102630314,0.00022994583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032350875,0.0002835038,0.00030201825,0.00023024963,0.00018565553,0.00017294673,0.0030230223,0.000110725,0.000089485955],"category_scores_gemma":[0.000037988666,0.00022839423,0.0001972743,0.00042535312,0.00006322059,0.00025644177,0.0012402569,0.00043113396,0.00024303001],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003738194,0.00017264603,0.0017791492,0.00003694619,0.00012736842,0.00017190301,0.016878655,0.0010557426,0.00035620254,0.06465228,0.03410665,0.88062507],"study_design_scores_gemma":[0.0026944415,0.002583508,0.016586857,0.00030261435,0.00003476067,0.0019543325,0.000099617326,0.1752263,0.0043656174,0.22462283,0.5687951,0.0027340217],"about_ca_topic_score_codex":0.00019830176,"about_ca_topic_score_gemma":0.000099977704,"teacher_disagreement_score":0.87789106,"about_ca_system_score_codex":0.000033348093,"about_ca_system_score_gemma":0.000052911364,"threshold_uncertainty_score":0.93136466},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2252695e-7,0.00007990596,0.42944747,0.00013160764,0.0013324232,0.0001036763,3.66987e-7,0.00016812404,0.5687362],"genre_scores_gemma":[0.0012837398,0.0000170079,0.008454865,0.0008150746,0.0030310738,0.000009924486,0.0000063554435,0.000020280615,0.9863617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998952,0.000011539119,0.00027522823,0.0004122354,0.00016988872,0.00017913937],"domain_scores_gemma":[0.9988019,0.00004488132,0.00016674545,0.000768866,0.00016075304,0.000056891786],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020369176,0.00017839884,0.00019222434,0.000049326678,0.000100005294,0.00013607014,0.0006090443,0.0002506627,0.001000168],"category_scores_gemma":[0.0000030146284,0.00015186294,0.00010017825,0.000028962342,0.000027052798,0.00012367142,0.00017177525,0.0001422769,0.0031315316],"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":[6.41415e-7,0.0000011990821,6.716713e-7,0.0000025872248,0.000010829926,9.828459e-7,0.000028750559,0.000028913695,4.8885323e-7,0.7161984,0.27971113,0.004015425],"study_design_scores_gemma":[0.000046548077,0.000039555216,0.0000027869094,0.00006464558,0.0000032242565,0.000014822639,6.7685187e-7,0.027544087,0.0000024794765,0.0937408,0.87835073,0.00018964712],"about_ca_topic_score_codex":0.000006866652,"about_ca_topic_score_gemma":0.000027936812,"teacher_disagreement_score":0.6224576,"about_ca_system_score_codex":0.000043541975,"about_ca_system_score_gemma":0.00002462057,"threshold_uncertainty_score":0.99991304},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37807113,0.00012241892,0.610128,0.00059184665,0.009526569,0.00009079873,6.431566e-7,0.000013568395,0.0014550491],"genre_scores_gemma":[0.9842904,0.0000073431647,0.00076923927,0.000044496766,0.014741086,3.884507e-7,4.16133e-7,0.000004447895,0.00014216619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998838,0.00005894724,0.000472541,0.00013818186,0.00038983164,0.00010247736],"domain_scores_gemma":[0.9988174,0.0001061759,0.00034235846,0.000084699925,0.00052487676,0.00012449439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007688241,0.00008928796,0.00019808898,0.00016729077,0.000033577548,0.000442659,0.0002885317,0.00003576495,8.884312e-7],"category_scores_gemma":[0.000078661265,0.00007207893,0.00003338461,0.00010345483,0.00002086737,0.00043875084,0.00008840852,0.00010097583,0.000004092971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000437872,0.000089641144,0.0037937649,0.000022596529,0.0001399451,0.00002394018,0.0019781578,0.7969593,0.000022066457,0.008995515,0.047892697,0.1396445],"study_design_scores_gemma":[0.0006715613,0.0016464941,0.0013301669,0.00042468304,0.000004253369,0.001451914,0.00020771948,0.96468294,0.00007044916,0.00011191257,0.029245261,0.00015264518],"about_ca_topic_score_codex":0.0000060130556,"about_ca_topic_score_gemma":1.4131737e-7,"teacher_disagreement_score":0.6093587,"about_ca_system_score_codex":0.000047095524,"about_ca_system_score_gemma":0.00002878882,"threshold_uncertainty_score":0.42685708},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.7156464e-8,0.000113906935,0.4958188,0.00015028406,0.0020821844,0.000089704066,2.4873614e-7,0.00019944811,0.50154537],"genre_scores_gemma":[0.006784429,0.00004699575,0.0024449746,0.00090341916,0.0018160022,0.000006783838,0.0000042777215,0.000038332237,0.9879548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845934,0.00002805873,0.000379547,0.0005661768,0.0002662563,0.00030059673],"domain_scores_gemma":[0.9984062,0.000097599426,0.00021823401,0.0010237924,0.0001259792,0.00012822657],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003123806,0.0003310485,0.00043122887,0.000119616605,0.000098427445,0.00026312264,0.0008760673,0.00046213192,0.0007123512],"category_scores_gemma":[0.000004973009,0.0002757862,0.00024668156,0.00003413853,0.000031462958,0.00009552364,0.00025595742,0.0003932171,0.0010320798],"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":[9.96984e-7,0.0000014021765,3.7346368e-7,0.0000054418883,0.000027184491,0.000007377753,0.00001652244,0.0006942491,2.988395e-7,0.8409832,0.15283012,0.005432794],"study_design_scores_gemma":[0.000084327876,0.000049053015,6.6680485e-7,0.0000897555,0.0000060216307,0.000036916023,0.0000010806032,0.25428718,0.0000021170854,0.010173396,0.7349589,0.0003105934],"about_ca_topic_score_codex":0.000009888348,"about_ca_topic_score_gemma":0.000036238915,"teacher_disagreement_score":0.83080983,"about_ca_system_score_codex":0.000051012932,"about_ca_system_score_gemma":0.000030773157,"threshold_uncertainty_score":0.9999694},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2165625,0.0005305823,0.78111947,0.0007623891,0.000628431,0.00025641956,0.000011951144,0.000013376208,0.00011490608],"genre_scores_gemma":[0.9880678,0.00034629932,0.011222381,0.000064397405,0.00013047246,0.000018111996,0.00001456879,0.000007501767,0.00012848739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806434,0.00025927564,0.0009898203,0.00013737312,0.00043366995,0.00011554104],"domain_scores_gemma":[0.9964347,0.00033401838,0.0012165975,0.00038187322,0.0015778025,0.00005500269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010954901,0.000114037306,0.00035037438,0.00053676206,0.000118324344,0.0001488206,0.0010917708,0.00005824774,0.000017084183],"category_scores_gemma":[0.00003104672,0.000096046024,0.00014862232,0.00030583044,0.000037055182,0.00063388306,0.00006448792,0.00012889708,0.0000013749291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001985339,0.0008886472,0.13888039,0.000332361,0.021737259,0.000039351264,0.05977943,0.5117979,0.03169788,0.07474467,0.019947965,0.13816878],"study_design_scores_gemma":[0.009821107,0.0018849502,0.14621995,0.001177875,0.0006659652,0.0020851858,0.002905858,0.78266114,0.028748408,0.0022223552,0.020498395,0.001108803],"about_ca_topic_score_codex":0.00024647726,"about_ca_topic_score_gemma":0.000026944637,"teacher_disagreement_score":0.7715053,"about_ca_system_score_codex":0.00008089126,"about_ca_system_score_gemma":0.00008083569,"threshold_uncertainty_score":0.39166433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000254539,0.00018798649,0.99291724,0.000042573865,0.0022219229,0.0005508325,0.0000029777123,0.000070256996,0.0037516942],"genre_scores_gemma":[0.8089949,0.00011834973,0.17550121,0.00040668048,0.0011330278,0.000109296096,0.0008267291,0.000060477316,0.012849363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987781,0.00004298352,0.00043996816,0.00038354186,0.00018280747,0.00017260973],"domain_scores_gemma":[0.9988804,0.00019510127,0.00032907567,0.0002665672,0.00028065545,0.0000482412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002312648,0.0002025156,0.00030309093,0.0001454057,0.000096218435,0.00011552228,0.00021941373,0.0002903993,0.000013275321],"category_scores_gemma":[0.00002420501,0.00017796962,0.0001062792,0.00015467257,0.000007391291,0.0001976751,0.000011464309,0.00011632992,0.0000010772897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048345624,0.000026160762,0.0000028127547,0.000021419777,0.000019451443,2.9044386e-7,0.000134419,0.97845274,7.301388e-7,0.011705829,0.0010780988,0.008509715],"study_design_scores_gemma":[0.00032425293,0.00033034096,0.00021695725,0.00011206104,0.00001001464,0.0000012007936,0.000050682378,0.99775237,0.000010739362,0.00040773326,0.00059484434,0.00018880393],"about_ca_topic_score_codex":0.00001350368,"about_ca_topic_score_gemma":0.000029866904,"teacher_disagreement_score":0.817416,"about_ca_system_score_codex":0.000022608496,"about_ca_system_score_gemma":0.000025594274,"threshold_uncertainty_score":0.72573906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010652203,0.00025826955,0.9862135,0.0011244671,0.003289076,0.00071375194,0.000004492381,0.00027853003,0.0070526777],"genre_scores_gemma":[0.9593523,0.000037951428,0.038079,0.00056319335,0.00069024216,0.00027097942,0.00010341053,0.000019296414,0.0008836249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980579,0.0003463946,0.0004615276,0.0006302692,0.0002013311,0.00030255783],"domain_scores_gemma":[0.9972082,0.00055943284,0.00036059908,0.001319036,0.0004883532,0.000064384025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009253339,0.00024441714,0.00035143492,0.000062086954,0.0003180703,0.00062907906,0.0010149059,0.0003246446,0.000016157148],"category_scores_gemma":[0.000056606794,0.00023256315,0.00022502955,0.00015494261,0.00002188117,0.00017903956,0.0010385755,0.0005260973,0.000011012147],"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.00002661207,0.00005890387,0.00011033472,0.000066316126,0.00014400076,0.0000032248383,0.0012249913,0.37683526,0.0000040460664,0.5846821,0.016287621,0.02055661],"study_design_scores_gemma":[0.00019221951,0.00008461465,0.00018589328,0.0008048432,0.000011458216,0.000008175734,0.00025304526,0.99136025,0.000039614995,0.0050995667,0.0016652378,0.00029509256],"about_ca_topic_score_codex":0.00018648227,"about_ca_topic_score_gemma":0.0002746092,"teacher_disagreement_score":0.95828706,"about_ca_system_score_codex":0.00014627205,"about_ca_system_score_gemma":0.00012599716,"threshold_uncertainty_score":0.948365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001264664,0.00058649224,0.2251739,0.00090608804,0.014635315,0.0023328376,0.0000924772,0.00033195436,0.7546763],"genre_scores_gemma":[0.7122207,0.00006573192,0.00061169185,0.0003823181,0.0010360546,0.000086694985,0.0000060179214,0.000046610334,0.28554416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978335,0.00011217227,0.00061929756,0.0006691607,0.00042560426,0.000340256],"domain_scores_gemma":[0.99834764,0.00011382093,0.00049379125,0.00039100175,0.00056003383,0.00009368832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059847574,0.00039321074,0.00057496637,0.00019531471,0.00017492892,0.0003340814,0.0012372503,0.00039881654,0.00005094731],"category_scores_gemma":[0.000012719901,0.00023314764,0.00013982406,0.0005229461,0.00006442148,0.0003000998,0.00021598424,0.00045245074,0.0002273802],"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.000011985268,0.000042101627,0.000006093514,0.0003140628,0.00008366902,0.0000014792955,0.0010261812,0.0008442124,0.00032107643,0.04874282,0.9468174,0.0017889035],"study_design_scores_gemma":[0.00178037,0.0022737554,0.00010821123,0.011134399,0.00012629134,0.0012692381,0.0038219858,0.2939969,0.016034251,0.000078414756,0.66695905,0.0024171048],"about_ca_topic_score_codex":0.00014081008,"about_ca_topic_score_gemma":0.000011283457,"teacher_disagreement_score":0.7109561,"about_ca_system_score_codex":0.0001862399,"about_ca_system_score_gemma":0.00015064684,"threshold_uncertainty_score":0.9507485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059588504,0.00040455896,0.9811697,0.00009896285,0.00093536,0.0013456789,0.0000049975265,0.00029695302,0.01514793],"genre_scores_gemma":[0.53720903,0.00017505499,0.40474892,0.000425887,0.0043955077,0.0047739074,0.0013043155,0.00016266183,0.046804734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793434,0.000024971016,0.0005548657,0.00077096745,0.00029306326,0.00042180953],"domain_scores_gemma":[0.99854577,0.00009851775,0.0002805424,0.0006247661,0.00032866866,0.000121712656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035555667,0.00032807284,0.00038031084,0.00015744957,0.0003279807,0.00018883841,0.00066584564,0.00030103436,0.000021365408],"category_scores_gemma":[0.000003414964,0.00027214727,0.00018379709,0.00036904382,0.000013770666,0.00028116716,0.000013492133,0.00030525727,0.000012313857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021305708,0.00026384948,0.00022218353,0.000516041,0.00043831818,0.000010874169,0.0022523482,0.53949153,0.00005054041,0.23827145,0.0031736647,0.21509612],"study_design_scores_gemma":[0.00053033675,0.00013686814,0.00027063023,0.00037195307,0.000053927535,0.000018976554,0.0006321913,0.9560057,0.00020437312,0.00021819441,0.040925805,0.0006310331],"about_ca_topic_score_codex":0.000043259828,"about_ca_topic_score_gemma":0.0016945013,"teacher_disagreement_score":0.5764207,"about_ca_system_score_codex":0.000085528285,"about_ca_system_score_gemma":0.00011244623,"threshold_uncertainty_score":0.99997306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056566424,0.000073839336,0.8989159,0.0020697527,0.0019061143,0.0002600349,0.0000018245686,0.0004018148,0.09071406],"genre_scores_gemma":[0.97161704,0.0000040970353,0.0041642776,0.0019037011,0.00011372066,0.000050268223,0.0000016982902,0.000013549625,0.022131642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986905,0.00010155669,0.00017505237,0.00040015706,0.00035382324,0.00027893332],"domain_scores_gemma":[0.999288,0.00006196277,0.00006859106,0.00047711644,0.000037551,0.00006674058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003269851,0.00013294704,0.00014530573,0.00010890136,0.00040946822,0.00016223703,0.0005626933,0.00002041904,0.00020725677],"category_scores_gemma":[0.0000037945056,0.00010068057,0.000057783323,0.00026756927,0.000013714493,0.0001992612,0.00026223552,0.00020589615,0.00006944785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001789397,0.00072855444,0.0015975649,0.000055133292,0.00023823988,0.0007309302,0.005657585,0.436851,0.00023180952,0.3205577,0.11119335,0.12197918],"study_design_scores_gemma":[0.0008871131,0.00058938185,0.00037902626,0.000027986482,0.0000043355335,0.000116315096,0.0004881979,0.85764235,0.0003391856,0.00030994334,0.13888602,0.0003301198],"about_ca_topic_score_codex":0.00017692045,"about_ca_topic_score_gemma":0.000119592565,"teacher_disagreement_score":0.9659604,"about_ca_system_score_codex":0.00009741906,"about_ca_system_score_gemma":0.000026086058,"threshold_uncertainty_score":0.41056347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4703397,0.00018274621,0.503765,0.00031182665,0.0022817052,0.0004793016,0.0000023664356,0.00013596768,0.02250138],"genre_scores_gemma":[0.99552363,0.000009304885,0.004186701,0.000042161813,0.000030597304,0.000007785431,0.0000025021918,0.0000049995356,0.00019230865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875385,0.00011741202,0.00041580675,0.0004119663,0.00014184139,0.00015911061],"domain_scores_gemma":[0.9990928,0.00007035257,0.00020366977,0.00051941734,0.00008246177,0.000031288422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037282208,0.00013663546,0.00036976184,0.00017254088,0.000022453187,0.00009146723,0.00047305893,0.00015014145,0.000014943807],"category_scores_gemma":[0.0000151877575,0.0001203368,0.00007137867,0.00016520054,0.000046380854,0.00008468166,0.000952221,0.00027762077,0.0000035679147],"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.000006253917,0.000050747145,0.020965094,0.00019266791,0.000035838035,0.0000049253754,0.0033282281,0.0013072795,0.00011964009,0.97201794,0.00046682137,0.001504576],"study_design_scores_gemma":[0.00041436465,0.00005069835,0.030310836,0.0005234579,0.0000025728536,0.000016603532,0.00036430339,0.92409194,0.00022491273,0.043567207,0.00008787336,0.00034522076],"about_ca_topic_score_codex":0.0018966377,"about_ca_topic_score_gemma":0.0005783509,"teacher_disagreement_score":0.9284507,"about_ca_system_score_codex":0.0000255544,"about_ca_system_score_gemma":0.000036216643,"threshold_uncertainty_score":0.49071923},"labels":[],"label_agreement":null},{"id":"W4290040450","doi":"10.1142/s0219265921500377","title":"Optimal Broadcasting in Fully Connected Trees","year":2022,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Combinatorics; Dissemination; Graph; Binary logarithm; Discrete mathematics; Mathematics; Computer network; Telecommunications","score_opus":0.011846415244611547,"score_gpt":0.2263594755566411,"score_spread":0.21451306031202955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290040450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2835561,0.0005606445,0.70640403,0.00063421624,0.007629369,0.00013998583,8.3670454e-7,0.00007094542,0.0010038541],"genre_scores_gemma":[0.9963882,0.000024217918,0.0020751164,0.00039108752,0.0008460135,0.00001876981,0.0000010645279,0.000019049841,0.00023647732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970065,0.0006135015,0.0012321211,0.00030273478,0.00044050557,0.00040465166],"domain_scores_gemma":[0.99802375,0.00038437918,0.00088247954,0.00028829914,0.00030157948,0.00011953128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020713361,0.00020368033,0.00044595456,0.0006760412,0.0002971642,0.00020865507,0.0009421999,0.00008770253,0.00024946046],"category_scores_gemma":[0.00014135533,0.00019544427,0.00027449205,0.0011229819,0.000026536836,0.0007929087,0.0003319882,0.0011367574,0.000004132923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016012417,0.00014295283,0.0011876009,0.000004903079,0.00006383778,0.00020649044,0.0010248659,0.9752521,0.0002910453,0.003370259,0.0065376777,0.011758145],"study_design_scores_gemma":[0.0012914935,0.0011722943,0.0011082034,0.00012264593,0.000010117273,0.0040741703,0.0019489421,0.9772891,0.00008574537,0.00024506316,0.012378065,0.00027420153],"about_ca_topic_score_codex":0.00004544353,"about_ca_topic_score_gemma":0.00010255,"teacher_disagreement_score":0.7128321,"about_ca_system_score_codex":0.0004192737,"about_ca_system_score_gemma":0.000090015565,"threshold_uncertainty_score":0.7969986},"labels":[],"label_agreement":null},{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26878345,0.00014247249,0.7230659,0.0030553378,0.004301877,0.00016513423,0.0000017031756,0.000037729682,0.00044635206],"genre_scores_gemma":[0.99660814,0.0000034527902,0.0013328334,0.0008211682,0.0010865774,0.0000038334847,5.0336496e-7,0.000010752318,0.00013272876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984461,0.00037073076,0.0005116513,0.00012667103,0.00032103836,0.00022381358],"domain_scores_gemma":[0.9986001,0.0007090764,0.00026625922,0.00021644233,0.00015796526,0.000050111845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003148131,0.000106778134,0.00019948746,0.00014791952,0.0007582892,0.00008393051,0.0010466618,0.000023861501,0.000022295522],"category_scores_gemma":[0.000056514124,0.0000729241,0.00019078245,0.0002502682,0.000017871971,0.00025514766,0.0002669623,0.0004365819,0.000004920546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007252224,0.00057763455,0.0012721115,0.00010252301,0.00058743043,0.000079234924,0.058487643,0.40967408,0.00879879,0.21754739,0.109739855,0.19240808],"study_design_scores_gemma":[0.0015903969,0.003368814,0.0003561772,0.00013982572,0.00004492846,0.003204795,0.008139178,0.91860855,0.0009706626,0.007802954,0.05539303,0.0003806642],"about_ca_topic_score_codex":0.00006112326,"about_ca_topic_score_gemma":0.0000058650494,"teacher_disagreement_score":0.7278247,"about_ca_system_score_codex":0.00013710528,"about_ca_system_score_gemma":0.00004253428,"threshold_uncertainty_score":0.5832224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005665857,0.00033979322,0.9893256,0.0012865516,0.0012107989,0.0036833514,0.00008104046,0.00031064506,0.0037056026],"genre_scores_gemma":[0.21890904,0.00025752056,0.7432761,0.00026716897,0.0025874006,0.028279133,0.0007004577,0.00017510328,0.0055480325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590826,0.00094237353,0.00040122797,0.0009943792,0.0010763333,0.0006773994],"domain_scores_gemma":[0.996972,0.00052465196,0.00014597757,0.0014327858,0.0007806426,0.00014392108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034795941,0.00024630543,0.00033763712,0.0006406172,0.00064656715,0.00059805316,0.002030173,0.00035050197,0.00027810826],"category_scores_gemma":[0.00027426312,0.00023272132,0.00024537332,0.00069110247,0.00005482855,0.000116371964,0.003068514,0.0019238559,0.000009570002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046452962,0.000093981565,0.00006242491,0.0011606539,0.000055514083,0.0000263041,0.0010777647,0.9356299,0.00003765961,0.02183675,0.022245778,0.017726794],"study_design_scores_gemma":[0.00017856849,0.0003583183,0.000015821583,0.00039993157,0.0000032785072,0.000021309364,0.00013021874,0.8561348,0.00010593731,0.008845705,0.13347687,0.00032928935],"about_ca_topic_score_codex":0.0001386949,"about_ca_topic_score_gemma":0.000037419588,"teacher_disagreement_score":0.24604942,"about_ca_system_score_codex":0.0004396852,"about_ca_system_score_gemma":0.0004404575,"threshold_uncertainty_score":0.94901},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015111843,0.00008619467,0.9942747,0.00043320077,0.0013127612,0.0019944343,0.000019492532,0.00024599914,0.00012207757],"genre_scores_gemma":[0.9410185,0.0000012359723,0.056719597,0.0002523592,0.00010635857,0.0016738742,0.000040810573,0.000018864765,0.00016835728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983287,0.00047418108,0.00037949922,0.00039453697,0.00025445616,0.00016861287],"domain_scores_gemma":[0.9981339,0.0010691979,0.0002999587,0.00031299202,0.00013051086,0.000053470663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020949258,0.00013541337,0.00019542484,0.0001785752,0.0005340261,0.00031764424,0.0001735361,0.00008119033,0.0000047947865],"category_scores_gemma":[0.0001447182,0.00013626869,0.000052485408,0.00020653855,0.00001236902,0.00029357054,0.000028596989,0.00008958961,0.000003099317],"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.00008994502,0.000052295207,0.000041043088,0.00015682883,0.000023033303,3.411457e-7,0.0016654895,0.29977632,0.0005200924,0.68843687,0.004241533,0.004996225],"study_design_scores_gemma":[0.00055807416,0.00037782523,0.00014519288,0.000051555515,0.00000775746,0.000011422867,0.00021873297,0.98662174,0.00009938015,0.0061285086,0.005623436,0.00015637893],"about_ca_topic_score_codex":0.000008329027,"about_ca_topic_score_gemma":5.285317e-7,"teacher_disagreement_score":0.93950737,"about_ca_system_score_codex":0.00009632007,"about_ca_system_score_gemma":0.000043207012,"threshold_uncertainty_score":0.5556876},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030168358,0.00033709832,0.50998086,0.0031069245,0.004422914,0.00035364903,0.000018550034,0.00040962605,0.48136735],"genre_scores_gemma":[0.07773769,0.00019501754,0.050427906,0.013589543,0.029087294,0.00020566762,0.000045869467,0.0005842018,0.8281268],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966013,0.00016143096,0.0005475496,0.0014592563,0.00058172055,0.0006487562],"domain_scores_gemma":[0.9951736,0.00088629476,0.00057631265,0.0030220016,0.00012492202,0.00021686956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003110358,0.0009268626,0.001070823,0.0005351409,0.0006441672,0.0006434855,0.003514313,0.0009287869,0.00033868843],"category_scores_gemma":[0.00004611261,0.0007368738,0.0007000557,0.000027195942,0.0001994445,0.00009748155,0.000667602,0.0014455722,0.00051268336],"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.000034808512,0.000024398523,8.1233577e-7,0.000060033268,0.00032704603,0.00022305618,0.00035610914,0.002844689,0.000009346176,0.36617488,0.06507149,0.56487334],"study_design_scores_gemma":[0.00015165092,0.00030299372,0.00001668763,0.00056754315,0.000035339228,0.00038559161,3.873873e-7,0.00444981,0.00019009171,0.099007316,0.89400125,0.0008913575],"about_ca_topic_score_codex":0.000019452922,"about_ca_topic_score_gemma":0.00007575883,"teacher_disagreement_score":0.8289297,"about_ca_system_score_codex":0.00012076189,"about_ca_system_score_gemma":0.00012191719,"threshold_uncertainty_score":0.9995082},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001773936,0.00013506236,0.9734131,0.0004656829,0.015350563,0.0017695514,0.000078349934,0.00038266016,0.008227628],"genre_scores_gemma":[0.98683,0.0000037066493,0.0020244175,0.00043975137,0.00090621674,0.0021901822,0.0002204747,0.000030480884,0.007354803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749184,0.000294341,0.0005860085,0.0008652347,0.00042322112,0.00033935285],"domain_scores_gemma":[0.99794066,0.00031588878,0.000428151,0.000846559,0.00037219026,0.00009654034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089285785,0.00032218805,0.00046891,0.00020191314,0.00029797523,0.00056258123,0.0010429627,0.00026524105,0.00008678806],"category_scores_gemma":[0.000030875595,0.000298186,0.00028383938,0.00016329896,0.000022915343,0.00017302878,0.0004751054,0.00042293756,0.000024251007],"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.00008028728,0.00006917785,0.000002373701,0.00013213599,0.00010750578,0.0000066339444,0.0006234546,0.45135888,0.000026254811,0.5124663,0.033941038,0.0011859117],"study_design_scores_gemma":[0.0003796775,0.0004219192,0.0000066233324,0.00009907934,0.000010878267,0.0000055154132,0.00059424,0.9792638,0.000112500355,0.00093294826,0.017797094,0.00037576727],"about_ca_topic_score_codex":0.0003304324,"about_ca_topic_score_gemma":0.000038137034,"teacher_disagreement_score":0.98665255,"about_ca_system_score_codex":0.00027116892,"about_ca_system_score_gemma":0.00030854382,"threshold_uncertainty_score":0.999947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001773936,0.00013506236,0.9734131,0.0004656829,0.015350563,0.0017695514,0.000078349934,0.00038266016,0.008227628],"genre_scores_gemma":[0.98683,0.0000037066493,0.0020244175,0.00043975137,0.00090621674,0.0021901822,0.0002204747,0.000030480884,0.007354803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749184,0.000294341,0.0005860085,0.0008652347,0.00042322112,0.00033935285],"domain_scores_gemma":[0.99794066,0.00031588878,0.000428151,0.000846559,0.00037219026,0.00009654034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089285785,0.00032218805,0.00046891,0.00020191314,0.00029797523,0.00056258123,0.0010429627,0.00026524105,0.00008678806],"category_scores_gemma":[0.000030875595,0.000298186,0.00028383938,0.00016329896,0.000022915343,0.00017302878,0.0004751054,0.00042293756,0.000024251007],"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.00008028728,0.00006917785,0.000002373701,0.00013213599,0.00010750578,0.0000066339444,0.0006234546,0.45135888,0.000026254811,0.5124663,0.033941038,0.0011859117],"study_design_scores_gemma":[0.0003796775,0.0004219192,0.0000066233324,0.00009907934,0.000010878267,0.0000055154132,0.00059424,0.9792638,0.000112500355,0.00093294826,0.017797094,0.00037576727],"about_ca_topic_score_codex":0.0003304324,"about_ca_topic_score_gemma":0.000038137034,"teacher_disagreement_score":0.98665255,"about_ca_system_score_codex":0.00027116892,"about_ca_system_score_gemma":0.00030854382,"threshold_uncertainty_score":0.999947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038641986,0.00024852433,0.92121124,0.009643844,0.0006361654,0.0003985843,0.000018384759,0.00033988757,0.028861402],"genre_scores_gemma":[0.86406547,0.00006088528,0.090786375,0.00025059187,0.0001237687,0.00010577824,0.00002664214,0.0000355432,0.044544943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965208,0.0016027717,0.00046732,0.0006739285,0.00024697778,0.00048819906],"domain_scores_gemma":[0.9954016,0.0012674127,0.00020503732,0.0013531017,0.0015977602,0.00017507524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039469264,0.000214054,0.00026931547,0.00014151075,0.00055422913,0.0005136322,0.0013032287,0.00012421439,0.00007897806],"category_scores_gemma":[0.0005835487,0.00016986707,0.0001938713,0.000373349,0.00007652897,0.00057709706,0.00023220452,0.00012838953,0.00008489112],"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.000013605922,0.0002406125,0.0012633717,0.000054653003,0.000057258825,0.000005191518,0.003920158,0.0000704703,0.0248267,0.62458885,0.015024445,0.3299347],"study_design_scores_gemma":[0.0027754358,0.0000052618066,0.001031937,0.002214103,0.000026112513,0.00016813503,0.00016713257,0.33514172,0.25616947,0.009563174,0.39161405,0.0011234572],"about_ca_topic_score_codex":0.00041270035,"about_ca_topic_score_gemma":0.0004299554,"teacher_disagreement_score":0.83042485,"about_ca_system_score_codex":0.00010817652,"about_ca_system_score_gemma":0.00013484566,"threshold_uncertainty_score":0.69269776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041091833,0.00018346302,0.9872867,0.00022346227,0.0016943567,0.00023082514,4.6982655e-7,0.00011117811,0.006160362],"genre_scores_gemma":[0.9886394,0.000001393033,0.009380248,0.0008007628,0.0002234569,0.00017383508,0.0000023214939,0.00000864266,0.0007699529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989466,0.00009302977,0.00026861884,0.0002821039,0.00012627237,0.00028337122],"domain_scores_gemma":[0.99941564,0.00023355744,0.000061057384,0.00022343542,0.000025670905,0.000040638275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055108714,0.00008252477,0.00012978469,0.00009040268,0.00023386505,0.0000889978,0.00045654003,0.00002535557,0.0000780865],"category_scores_gemma":[0.000021253982,0.000081561826,0.00006425423,0.00035899226,0.000007026511,0.00013932328,0.0002340727,0.00018406071,0.0000040224018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051288825,0.00010089592,0.000749762,0.000022037022,0.00001675389,0.000047687718,0.000988072,0.76201636,0.000022839007,0.20016189,0.010813753,0.025008664],"study_design_scores_gemma":[0.00023394017,0.00014432704,0.00009724185,0.0000064885594,9.068753e-7,0.00006235094,0.00016203175,0.98985875,0.0000030182239,0.0017812223,0.0075404653,0.00010926547],"about_ca_topic_score_codex":0.00004114341,"about_ca_topic_score_gemma":0.00007037247,"teacher_disagreement_score":0.9845302,"about_ca_system_score_codex":0.00006583286,"about_ca_system_score_gemma":0.00002236872,"threshold_uncertainty_score":0.3325995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027846705,0.0013010737,0.9871985,0.0013017184,0.007349785,0.0012323703,0.000044236025,0.00016320767,0.0011306418],"genre_scores_gemma":[0.82822514,0.0017044453,0.14421462,0.018223157,0.0039299903,0.0011450314,0.00013990913,0.00038823785,0.0020294795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951983,0.00014348792,0.00089862937,0.0017571453,0.0009845706,0.0010178671],"domain_scores_gemma":[0.99589723,0.0014860414,0.00044372998,0.0017278267,0.00029700637,0.00014815545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00238318,0.000586716,0.00064974435,0.00086682546,0.0010869823,0.00082505855,0.0040683965,0.00030224098,0.000040126844],"category_scores_gemma":[0.00013859158,0.00046053872,0.00034312363,0.0014019448,0.00044981623,0.0004334723,0.0010548361,0.0010429495,0.0000067858214],"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.0000696075,0.000095960466,0.00036637188,0.000109024084,0.000082106395,0.00024686675,0.0057994095,0.03360934,0.00013295405,0.42253682,0.003689717,0.53326184],"study_design_scores_gemma":[0.00059076474,0.00048165148,0.00012921952,0.00024252385,0.000008217558,0.00009984176,0.0000030645588,0.4931536,0.00015720511,0.4015434,0.10268575,0.0009047272],"about_ca_topic_score_codex":0.00022951483,"about_ca_topic_score_gemma":0.0013793997,"teacher_disagreement_score":0.8429839,"about_ca_system_score_codex":0.00039500927,"about_ca_system_score_gemma":0.00041431203,"threshold_uncertainty_score":0.99978465},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078627085,0.00038326497,0.0034518128,0.00020711908,0.0010935105,0.000718839,0.000018956072,0.00030911886,0.98595464],"genre_scores_gemma":[0.9144263,0.00017166167,0.020530812,0.00033401113,0.00042656338,0.00012947185,0.000015582158,0.00017258513,0.06379301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973879,0.000014123055,0.0006970042,0.0008353689,0.00068680616,0.0003787876],"domain_scores_gemma":[0.99839544,0.00006403675,0.00065399066,0.00045626741,0.00033952956,0.00009072914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062038144,0.00043116603,0.0007439893,0.0006132103,0.00016040748,0.00012710514,0.0013354655,0.00019416762,0.000340951],"category_scores_gemma":[0.000016750344,0.00040565757,0.00019334593,0.00030601743,0.00024059029,0.00037854884,0.0007680077,0.0008583308,0.000011346878],"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.000044177203,0.00004293593,0.0005506389,0.00022550662,0.00006754268,0.000017956172,0.00073339953,0.00004594894,0.000049281272,0.994344,0.0006552796,0.003223326],"study_design_scores_gemma":[0.0039839773,0.0029491954,0.006010331,0.005212666,0.00014858284,0.000843128,0.0006257072,0.032764133,0.0011226593,0.40706283,0.53410333,0.0051734596],"about_ca_topic_score_codex":0.00017691814,"about_ca_topic_score_gemma":0.00006501303,"teacher_disagreement_score":0.92216164,"about_ca_system_score_codex":0.000182195,"about_ca_system_score_gemma":0.00008052388,"threshold_uncertainty_score":0.99983954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04286543,0.000021204005,0.94049025,0.00018985175,0.0007069202,0.00033325236,8.441129e-8,0.00017671584,0.015216312],"genre_scores_gemma":[0.99655926,6.2105363e-7,0.0014493823,0.0008500575,0.00014473831,0.00008191334,0.000004110416,0.000009858814,0.0009000311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849355,0.00018513351,0.00036114393,0.00034089372,0.00029295715,0.00032634885],"domain_scores_gemma":[0.9993909,0.00006794273,0.0001744263,0.00029464206,0.000035536563,0.000036545516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009230151,0.00011463796,0.00014625955,0.00012874015,0.0005024888,0.00011833469,0.00036061654,0.00003272205,0.00008697753],"category_scores_gemma":[0.000010550541,0.00011316776,0.00005067806,0.00071021565,0.0000057827015,0.00016627082,0.00029485553,0.00035273243,0.000019226585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051153797,0.000011736255,0.0012750321,0.000004250389,0.000005204308,0.000002972797,0.00073809765,0.9709702,0.00015908676,0.02543015,0.00041257057,0.0009855593],"study_design_scores_gemma":[0.00020521377,0.00009509871,0.0002864325,0.000037988688,6.886599e-7,0.000013308453,0.0005403865,0.98725635,0.000027033322,0.00029704798,0.011095776,0.0001446631],"about_ca_topic_score_codex":0.00015553994,"about_ca_topic_score_gemma":0.000016184771,"teacher_disagreement_score":0.95369387,"about_ca_system_score_codex":0.0002673339,"about_ca_system_score_gemma":0.00003428416,"threshold_uncertainty_score":0.46148476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02640554,0.00041518867,0.9599381,0.005111529,0.0042227334,0.0006221176,0.000011974791,0.0000486969,0.0032241128],"genre_scores_gemma":[0.9963295,0.000003949311,0.000804227,0.00036272238,0.000023773406,0.0000447932,2.0549417e-7,0.00000237633,0.0024284562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993552,0.00008759333,0.00013931729,0.00013271697,0.0001760283,0.000109121356],"domain_scores_gemma":[0.99912363,0.0002790121,0.00007628501,0.0004515164,0.00005767049,0.000011870966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005568092,0.00004655793,0.000065817825,0.000011920419,0.00037455818,0.0000334248,0.0010467565,0.0000096572085,0.000053373456],"category_scores_gemma":[0.00001693061,0.000022807058,0.00010356135,0.00034146427,0.000025419991,0.000055329587,0.00028077973,0.000083979256,0.0000010261728],"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.000017800021,0.00007700307,0.0014559883,0.000016266129,0.00006106574,5.571594e-7,0.004840403,0.056888085,0.0003725214,0.7033663,0.22402883,0.0088752005],"study_design_scores_gemma":[0.00023763973,0.00015358857,0.0008374105,0.000013754223,0.0000062377926,0.000023038288,0.0010191883,0.7456731,0.0007753786,0.0070105656,0.24412368,0.00012638613],"about_ca_topic_score_codex":0.00009794285,"about_ca_topic_score_gemma":0.000055304583,"teacher_disagreement_score":0.969924,"about_ca_system_score_codex":0.00001430298,"about_ca_system_score_gemma":0.000029452523,"threshold_uncertainty_score":0.28808364},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070507927,0.0012218443,0.27447587,0.00010136354,0.0010697873,0.0013163415,0.0000026376897,0.00019203582,0.71456933],"genre_scores_gemma":[0.6430119,0.00020101265,0.00023865286,0.0000064976975,0.00067927357,0.000010727127,0.0000075290504,0.00003981909,0.35580453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969169,0.00043454455,0.0005133839,0.0008355629,0.0006386329,0.00066095695],"domain_scores_gemma":[0.9968902,0.001008183,0.0004045576,0.00086825306,0.0006733104,0.00015553388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013382211,0.00030338592,0.0006244215,0.0021871943,0.00041024937,0.00011155549,0.0012554859,0.00034904832,0.00000421853],"category_scores_gemma":[0.000032392145,0.00029483554,0.00016323531,0.0017800268,0.00049319153,0.0004285465,0.00057485676,0.0013963295,0.0000057090992],"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.0009159898,0.0005412109,0.035625935,0.0016068106,0.00217395,0.0041582054,0.00507207,0.01922362,0.00044435493,0.90258086,0.016402014,0.011255],"study_design_scores_gemma":[0.006272763,0.008317303,0.009970389,0.013183026,0.00032113242,0.0012620145,0.01980089,0.091383316,0.0062859114,0.014870786,0.8231786,0.005153905],"about_ca_topic_score_codex":0.001840731,"about_ca_topic_score_gemma":0.011969268,"teacher_disagreement_score":0.88771003,"about_ca_system_score_codex":0.0017223238,"about_ca_system_score_gemma":0.00068650255,"threshold_uncertainty_score":0.99995035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009929502,0.00006637525,0.98700976,0.0030878289,0.0016294048,0.00043902514,0.0000044565036,0.00016135095,0.006608839],"genre_scores_gemma":[0.96716887,0.0000034407408,0.025605356,0.0018089826,0.0003780639,0.00059043814,0.00003806058,0.00001199905,0.0043947776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904543,0.00006799396,0.00023767189,0.0002983199,0.000175118,0.00017545786],"domain_scores_gemma":[0.99942446,0.000095918105,0.00010505689,0.0002541965,0.000085396285,0.000034996418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048127666,0.000092317416,0.000112398586,0.00009425875,0.00052329106,0.00026215933,0.00039459585,0.000029207333,0.00025903413],"category_scores_gemma":[0.000012712006,0.00008243094,0.00006588052,0.00025065616,0.000005403628,0.0006128954,0.000059794416,0.00010665532,0.000008554913],"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.000077248485,0.00020711125,0.0000485967,0.000057076435,0.00006930881,0.0000017043051,0.004670815,0.21480155,0.017645793,0.5093053,0.085797265,0.16731822],"study_design_scores_gemma":[0.00057862693,0.0003201725,0.000027699187,0.0000069799603,0.0000035968887,0.000032985627,0.0005231545,0.5415637,0.0032156147,0.00500091,0.44851035,0.00021621521],"about_ca_topic_score_codex":0.00003852034,"about_ca_topic_score_gemma":0.000087906024,"teacher_disagreement_score":0.9661759,"about_ca_system_score_codex":0.00005302749,"about_ca_system_score_gemma":0.000041137857,"threshold_uncertainty_score":0.4024785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002174916,0.00019310943,0.9948248,0.00038706258,0.0001820836,0.0002764214,0.0000037505304,0.00009474129,0.0018630736],"genre_scores_gemma":[0.9762337,0.00017404697,0.022837812,0.000058540783,0.000022909173,0.000069428075,0.000011191669,0.0000044929266,0.0005878646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992111,0.00011564212,0.0002677534,0.00017651131,0.00010140568,0.00012759786],"domain_scores_gemma":[0.9980712,0.0010324678,0.000065846194,0.0006862491,0.00009284014,0.00005143282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825207,0.00006454488,0.00021769135,0.00026549675,0.00009886808,0.00009743469,0.00041375932,0.00003790749,0.000002030307],"category_scores_gemma":[0.00002566317,0.000050730385,0.00007904232,0.0009377271,0.000034865127,0.00007922891,0.00005501939,0.000039876268,0.000009471335],"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.000029966564,0.00015109201,0.00018589973,0.000039164795,0.00075993873,0.0000011401013,0.0011366938,0.02163473,0.0021224134,0.9591645,0.0016285238,0.01314593],"study_design_scores_gemma":[0.00022577778,0.0001509205,0.00012129745,0.000015579764,0.000054956017,0.0000014689583,0.00009853878,0.99515826,0.00034008952,0.0002030046,0.0035663499,0.00006379134],"about_ca_topic_score_codex":0.000019843917,"about_ca_topic_score_gemma":0.0000066925736,"teacher_disagreement_score":0.9740588,"about_ca_system_score_codex":0.000010804467,"about_ca_system_score_gemma":0.000012054041,"threshold_uncertainty_score":0.20687251},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5888866,0.009846617,0.35678342,0.0029246516,0.0023294324,0.00058410526,0.0000021113403,0.00051094044,0.03813211],"genre_scores_gemma":[0.9959302,0.00008004978,0.0035794897,0.00014409349,0.000085475454,0.000018153114,2.1796588e-7,0.0000063717152,0.00015597696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914736,0.000091988935,0.00014160131,0.00030550628,0.0001511987,0.00016237544],"domain_scores_gemma":[0.99964756,0.00003793406,0.00004830473,0.00020498158,0.000014434576,0.000046768826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044704648,0.00009558467,0.00013604679,0.000077624965,0.00046603483,0.00013825088,0.00017945141,0.000023811415,0.000004305328],"category_scores_gemma":[0.000001775584,0.00008118623,0.000019180463,0.00009164559,0.000018052611,0.00023114757,0.0002952322,0.00012781977,0.0000012205695],"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.000035612677,0.00008369682,0.0009311374,0.00072342093,0.00008317027,0.000026375796,0.01342166,0.14422095,0.000098496406,0.7363289,0.00045479432,0.103591785],"study_design_scores_gemma":[0.00013383475,0.00012185279,0.00016559269,0.00003770958,0.0000021428787,0.00022252856,0.0017345737,0.9963245,0.000036350677,0.000019270215,0.0010900348,0.00011162784],"about_ca_topic_score_codex":0.000021510248,"about_ca_topic_score_gemma":0.0000030217911,"teacher_disagreement_score":0.85210353,"about_ca_system_score_codex":0.000042841148,"about_ca_system_score_gemma":0.000011461814,"threshold_uncertainty_score":0.35844103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007483869,0.010021692,0.9733196,0.000096720076,0.008904303,0.0015662354,0.000009423645,0.00020739803,0.0057997727],"genre_scores_gemma":[0.98447716,0.00036965404,0.00047593465,0.0001829342,0.0043393844,0.00026945389,0.000044405693,0.00017510392,0.009665986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996051,0.00013889246,0.0013100925,0.0012202702,0.00035117302,0.0009285588],"domain_scores_gemma":[0.9965238,0.0020123387,0.0004967466,0.0006754151,0.00013983317,0.00015187994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016021739,0.00068303087,0.0012060496,0.00048482043,0.00020139867,0.00052364304,0.0006423095,0.0010936595,0.0000038049527],"category_scores_gemma":[0.00013025802,0.0006194263,0.00022716857,0.0003448009,0.00006730591,0.000059117014,0.00027307647,0.0011513148,0.0000068679155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023687622,0.00001060477,0.00009326011,0.00017619687,0.000036337686,0.0000760501,0.0002386624,0.94241774,3.1261678e-7,0.0441898,0.00036695602,0.012370398],"study_design_scores_gemma":[0.00055185985,0.00012667666,0.00004022776,0.0025470606,0.0000152507555,0.000088204004,0.000007934997,0.98821336,9.9287284e-8,0.0024161139,0.0053692874,0.0006239107],"about_ca_topic_score_codex":0.0001851573,"about_ca_topic_score_gemma":0.00072622404,"teacher_disagreement_score":0.9844023,"about_ca_system_score_codex":0.00020746485,"about_ca_system_score_gemma":0.000054476957,"threshold_uncertainty_score":0.9996257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18391702,0.00009807391,0.782414,0.0030108108,0.004729869,0.0005240097,0.00002773086,0.0006242892,0.024654165],"genre_scores_gemma":[0.99712765,0.0000020791044,0.0011944528,0.00045106534,0.000042147698,0.000044701672,0.000009410768,0.000005681814,0.0011228167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892616,0.00010031157,0.00024898816,0.00026299103,0.00029833236,0.00016320749],"domain_scores_gemma":[0.9989439,0.00007565021,0.000095774536,0.0007915306,0.000051088115,0.000042059084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036713775,0.00007771145,0.0001350115,0.00011130445,0.00025137208,0.000057173424,0.0008493891,0.000019467641,0.000519477],"category_scores_gemma":[0.000016364647,0.00006765664,0.0000755672,0.00043642323,0.000014066431,0.00017609827,0.0003948411,0.00012883167,0.000024622886],"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.000030275809,0.00022434139,0.0013196601,0.00002383164,0.00005687569,0.000027416505,0.0012405791,0.02040734,0.0007418065,0.8480696,0.12617257,0.0016857235],"study_design_scores_gemma":[0.0004891074,0.00056375016,0.00055541587,0.00003931632,0.000005047685,0.000036280366,0.00031029087,0.9547072,0.0009745604,0.008105011,0.033969983,0.00024404361],"about_ca_topic_score_codex":0.00013219797,"about_ca_topic_score_gemma":0.00004571523,"teacher_disagreement_score":0.9342998,"about_ca_system_score_codex":0.000029664729,"about_ca_system_score_gemma":0.000025107332,"threshold_uncertainty_score":0.5687909},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029230453,0.00009560772,0.96615374,0.00018679127,0.00080993044,0.00077269797,0.00001681054,0.0005519272,0.0021820564],"genre_scores_gemma":[0.46339682,0.000028977842,0.5331378,0.0004489829,0.0004834629,0.00021684889,0.00007012714,0.00013120972,0.002085789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790883,0.000015347689,0.0005733808,0.0005125643,0.00042704152,0.0005628378],"domain_scores_gemma":[0.9985534,0.0002456668,0.00024257711,0.0006744315,0.000097796175,0.00018616252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044046974,0.00030204965,0.00040862706,0.00026591425,0.00033817644,0.00026964617,0.000657662,0.00013138259,0.000019148054],"category_scores_gemma":[0.000029319726,0.00026255535,0.00025202258,0.0009203614,0.00005518824,0.00022615405,0.0002837884,0.00014441855,0.0001143823],"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.00001038563,0.0000415464,0.0000073360525,0.00014655384,0.00007909182,0.0000043025743,0.0013264851,0.0017400807,0.0058918926,0.9705197,0.0127979545,0.0074346517],"study_design_scores_gemma":[0.0007092685,0.000048695474,0.000007906916,0.00013584577,0.000031611835,0.000039623865,0.00044934606,0.7554195,0.0015213396,0.22943147,0.01173792,0.00046750993],"about_ca_topic_score_codex":0.000016220054,"about_ca_topic_score_gemma":0.000003156516,"teacher_disagreement_score":0.7536794,"about_ca_system_score_codex":0.000033781453,"about_ca_system_score_gemma":0.0000803552,"threshold_uncertainty_score":0.99998266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009015823,0.0015892349,0.8224046,0.06360464,0.0036052503,0.0009853946,0.000021720129,0.003900634,0.09487269],"genre_scores_gemma":[0.9657747,0.0012243667,0.03140067,0.000999027,0.00011586374,0.00010376345,0.000025307614,0.000016299735,0.00033998716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970886,0.0002456776,0.0013491348,0.00018619017,0.0006568709,0.00047351897],"domain_scores_gemma":[0.9946429,0.0003021601,0.0010989783,0.002987109,0.0008151388,0.00015367907],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001704977,0.00029277502,0.00036865106,0.00089977094,0.0011937267,0.0012941138,0.0052287476,0.0003481029,0.000016544525],"category_scores_gemma":[0.0006961205,0.00024414336,0.00020230903,0.0012302487,0.00017909177,0.004631394,0.0012781337,0.0015204658,0.00055300613],"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.0000443081,0.0002889458,0.00055436476,0.00003539485,0.00018577502,0.000008432722,0.008605516,0.009328505,0.00006666717,0.48773494,0.11527639,0.37787077],"study_design_scores_gemma":[0.0012152854,0.00050587056,0.0005542045,0.00034324554,0.00002200184,0.0008115136,0.012130555,0.18998995,0.0005196359,0.016189674,0.7770948,0.00062328036],"about_ca_topic_score_codex":0.00003524485,"about_ca_topic_score_gemma":0.000029207986,"teacher_disagreement_score":0.9567589,"about_ca_system_score_codex":0.00045291346,"about_ca_system_score_gemma":0.00023419294,"threshold_uncertainty_score":0.9997426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020411568,0.0001828534,0.9848923,0.00037108187,0.005734119,0.00032573997,0.0000018649938,0.00027760916,0.008010314],"genre_scores_gemma":[0.7812319,0.0001213455,0.20688784,0.002744202,0.0021907592,0.00005443029,0.000009342082,0.00016923899,0.006590962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960095,0.00004987033,0.0007362537,0.0015699394,0.00083500263,0.00079940713],"domain_scores_gemma":[0.9977005,0.00059466466,0.00026590523,0.0011378713,0.0001673881,0.0001336749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016021235,0.0004618643,0.00056484295,0.0015793669,0.00019529309,0.0006395694,0.0028149637,0.0003483756,0.000014123119],"category_scores_gemma":[0.00009643084,0.0004345826,0.0001558474,0.0014766471,0.0002896495,0.00050714315,0.001180418,0.0009876718,0.00014110112],"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.0000062132285,0.000021046444,0.00036545764,0.000066691464,0.000011582156,0.0003467138,0.0014310122,0.085135326,0.00003630259,0.21451269,0.0000969719,0.69797],"study_design_scores_gemma":[0.00020523887,0.00010602472,0.00027667693,0.0009223915,0.000001888921,0.00009294057,3.3660044e-7,0.7851579,0.000053274907,0.21158718,0.0010412663,0.00055484736],"about_ca_topic_score_codex":0.000111390524,"about_ca_topic_score_gemma":0.0005511287,"teacher_disagreement_score":0.78102773,"about_ca_system_score_codex":0.00027594317,"about_ca_system_score_gemma":0.00026424363,"threshold_uncertainty_score":0.9998106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031617913,0.000006542193,0.9519617,0.00046105438,0.000554059,0.00008278998,1.9814192e-7,0.000560477,0.014755272],"genre_scores_gemma":[0.99331284,0.0000021208064,0.0029085935,0.00024521974,0.00008517379,0.0000135824985,0.0000019916733,0.000004260974,0.0034261923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994732,0.000024870478,0.0000928088,0.00016548902,0.00011401151,0.00012961184],"domain_scores_gemma":[0.9996648,0.000022415084,0.000023658824,0.00021796986,0.000039882045,0.00003128166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011742368,0.000057153247,0.00006125664,0.000064959444,0.000065924134,0.00011920044,0.00019536825,0.00002346735,0.000027733833],"category_scores_gemma":[0.0000037665193,0.000036544225,0.000021080525,0.00035017362,0.000007088937,0.00015369033,0.00004076181,0.000040663603,0.0003664393],"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.0000349757,0.00008988362,0.0013938972,0.000028726005,0.00011877792,0.0002872482,0.0047666393,0.047077045,0.0027215309,0.5006721,0.07124805,0.37156114],"study_design_scores_gemma":[0.00012794968,0.0001379766,0.0003663115,0.00001876266,9.943733e-7,0.00010721833,0.000041142757,0.9875,0.0015469493,0.00040290432,0.009635423,0.000114332885],"about_ca_topic_score_codex":0.00003302496,"about_ca_topic_score_gemma":0.00013610597,"teacher_disagreement_score":0.96169496,"about_ca_system_score_codex":0.000012323316,"about_ca_system_score_gemma":0.00000986868,"threshold_uncertainty_score":0.4709958},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27638796,0.0000039080332,0.71536434,0.0020147006,0.0011084847,0.00015017946,9.786036e-7,0.00020496383,0.0047644554],"genre_scores_gemma":[0.9981473,0.0000018129977,0.001230664,0.0004872938,0.000090085676,0.000009488042,2.261168e-7,0.000004782512,0.000028311773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979888,0.0002152257,0.00025729262,0.00046682596,0.0006565693,0.00041528215],"domain_scores_gemma":[0.9974729,0.001343,0.00007602567,0.00083190436,0.00017343069,0.000102743244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883812,0.00012784141,0.00017990705,0.00017901583,0.00040022194,0.00021414897,0.0020543358,0.000036660567,0.000047851412],"category_scores_gemma":[0.00018176794,0.00007626572,0.000082753904,0.0020911957,0.0015400468,0.00025169892,0.00062331336,0.00016495991,0.00017762482],"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.0000050395133,0.000028066832,0.00002662231,0.0000034264756,0.000004347302,0.000004321846,0.0003104584,0.0011061311,0.0004659271,0.9920314,0.0006872949,0.0053269416],"study_design_scores_gemma":[0.000090941874,0.00019952355,0.0011375835,0.0000386697,0.0000012344937,0.00001327478,0.000014689876,0.82331187,0.0036981541,0.17130399,0.00009580761,0.00009426926],"about_ca_topic_score_codex":0.0000055304195,"about_ca_topic_score_gemma":6.4381373e-7,"teacher_disagreement_score":0.8222057,"about_ca_system_score_codex":0.000031966138,"about_ca_system_score_gemma":0.000057632413,"threshold_uncertainty_score":0.5674367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006751954,0.0000035028252,0.98773897,0.0005966904,0.0012389222,0.00021606006,5.0179e-7,0.00035506894,0.009175071],"genre_scores_gemma":[0.90816045,0.000009664812,0.06359251,0.00056884106,0.00029466106,0.00020559998,0.000013898119,0.000010463197,0.027143892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945116,0.0000147663595,0.00012886376,0.00017058081,0.000087648266,0.00014697315],"domain_scores_gemma":[0.9996465,0.00005529022,0.000031141604,0.00017078986,0.000068829715,0.000027487888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021011186,0.00004921289,0.00006261068,0.000057811434,0.00008629071,0.000093682,0.00018633543,0.00002610849,0.000057540903],"category_scores_gemma":[0.000012996839,0.000041105763,0.000036836325,0.0002686658,0.0000035321364,0.00015481329,0.000049478724,0.000018578063,0.00010956132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035223115,0.000007078877,0.000002995444,0.0000069457565,0.0000070380343,3.260329e-7,0.00018588206,0.8982999,0.00015668408,0.04910863,0.049511272,0.0027097748],"study_design_scores_gemma":[0.00018888991,0.00005298525,0.0000067983146,0.0000069161356,7.0783756e-7,8.0929834e-7,0.000055369685,0.990976,0.0012693624,0.00027925926,0.0071035884,0.000059362028],"about_ca_topic_score_codex":0.000005178991,"about_ca_topic_score_gemma":0.000006427104,"teacher_disagreement_score":0.9241465,"about_ca_system_score_codex":0.00002067112,"about_ca_system_score_gemma":0.000011705676,"threshold_uncertainty_score":0.16762443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007764989,0.000016709675,0.9863961,0.0023679323,0.0011916657,0.00028928704,0.0000012953672,0.00018171442,0.0017903212],"genre_scores_gemma":[0.9920178,0.000011180029,0.006991679,0.00026798103,0.0000998206,0.00005570477,0.000005626423,0.0000066759694,0.00054355344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905473,0.00006361976,0.00035761326,0.00022898517,0.00011505875,0.00018002233],"domain_scores_gemma":[0.99932563,0.0002589719,0.00007024533,0.0002286713,0.000087663364,0.000028823817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353782,0.000079353034,0.00018031105,0.00023029554,0.000032188764,0.00005450435,0.0003400233,0.000049260536,0.0000054304946],"category_scores_gemma":[0.000039881907,0.00006937592,0.0000793593,0.0006221353,0.000012626217,0.00065356446,0.00006837285,0.00004893959,0.000029037576],"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.000051357347,0.00009948336,0.00020576335,0.000084821724,0.000035598212,0.000009247059,0.008124768,0.016939558,0.00078287395,0.8782001,0.04207914,0.05338727],"study_design_scores_gemma":[0.00052105536,0.00025665126,0.00021756272,0.000064508014,0.0000015516929,0.00000505592,0.00054388866,0.9714564,0.0019633137,0.0075416295,0.017305223,0.00012316064],"about_ca_topic_score_codex":0.00007835339,"about_ca_topic_score_gemma":0.00017037787,"teacher_disagreement_score":0.9842528,"about_ca_system_score_codex":0.000024261217,"about_ca_system_score_gemma":0.000014373902,"threshold_uncertainty_score":0.28290677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005988512,0.00002079163,0.9767956,0.0012471863,0.0021130345,0.00044845854,0.00001940487,0.00068253174,0.012684457],"genre_scores_gemma":[0.96372765,0.000004566493,0.014116859,0.00034859707,0.0003895384,0.00009860254,0.00011680775,0.000021595888,0.02117577],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850184,0.000038435934,0.00030445095,0.0005804153,0.00018245052,0.00039238847],"domain_scores_gemma":[0.9982511,0.00032047828,0.00008142336,0.0011627246,0.00010156708,0.00008273268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009903031,0.00012555036,0.00019205734,0.00012357337,0.00021781273,0.0002476141,0.0011655283,0.000057746718,0.0000765681],"category_scores_gemma":[0.00008970325,0.00009974846,0.00006562002,0.00055267854,0.0000149754105,0.00015764959,0.00012684193,0.000067666835,0.000235257],"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.000060832408,0.00024172517,0.00009773004,0.00018427246,0.00024582894,0.00003608422,0.0025837123,0.058707308,0.026888775,0.25916818,0.5957264,0.05605919],"study_design_scores_gemma":[0.00035081978,0.000051852487,0.000018915294,0.000028257491,0.000003369514,0.000006709691,0.00014389024,0.95884347,0.00056443235,0.00038410787,0.039462272,0.00014188237],"about_ca_topic_score_codex":0.00011177638,"about_ca_topic_score_gemma":0.00009962068,"teacher_disagreement_score":0.9626788,"about_ca_system_score_codex":0.000028491278,"about_ca_system_score_gemma":0.000049218484,"threshold_uncertainty_score":0.4067624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48850608,0.000014266335,0.45833772,0.00048419903,0.0008578037,0.000082110084,1.8848198e-7,0.0002719136,0.05144572],"genre_scores_gemma":[0.99651206,0.0000014275815,0.00073574175,0.000043516353,0.00003067562,0.0000024503788,1.6524275e-7,0.0000015871809,0.0026723905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995941,0.00001536715,0.00013199932,0.00009216119,0.000065557906,0.00010084045],"domain_scores_gemma":[0.99978524,0.000043763117,0.000026100031,0.000113651244,0.000018296801,0.000012925252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027521208,0.000026955222,0.0000613688,0.000104517785,0.000014090733,0.000016230983,0.00017090587,0.000016041256,0.000013168722],"category_scores_gemma":[0.000015869742,0.000022994293,0.000018673689,0.0005267056,0.000004554707,0.00008733984,0.000076955694,0.00003143389,0.00008335433],"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.0000025223242,0.000032727236,0.022870919,0.000050357932,0.000009734769,0.000034323108,0.005681042,0.011383194,0.002835603,0.887517,0.011151881,0.058430735],"study_design_scores_gemma":[0.0000934406,0.000017635522,0.004890573,0.000033897813,1.2232634e-7,0.0000042627767,0.00012220533,0.9922297,0.0005947007,0.00041547106,0.0015546762,0.00004331776],"about_ca_topic_score_codex":0.00014907215,"about_ca_topic_score_gemma":0.0000626928,"teacher_disagreement_score":0.9808465,"about_ca_system_score_codex":0.000007480118,"about_ca_system_score_gemma":0.000006275926,"threshold_uncertainty_score":0.1071379},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017856402,0.000004884402,0.96197665,0.0007496783,0.001695417,0.00010051932,1.4700399e-7,0.00058464904,0.017031653],"genre_scores_gemma":[0.997461,0.0000016532998,0.0009897623,0.0008307133,0.00019713266,0.000034122542,0.0000034695106,0.000008367158,0.0004737467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988773,0.00010669207,0.0002652092,0.00031193232,0.00014027262,0.00029857864],"domain_scores_gemma":[0.9993624,0.00024232385,0.000053168973,0.00026053152,0.00003686242,0.00004469282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006640778,0.00009819248,0.00011652493,0.00028446445,0.00011713714,0.00017805852,0.00022758676,0.00006368875,0.00005277411],"category_scores_gemma":[0.000056360415,0.00009069437,0.000053973552,0.0010597293,0.000008645473,0.00025776107,0.000062216975,0.00016841474,0.00022338014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005696616,0.000017972226,0.0027680395,0.0000047647563,0.0000024505248,0.00001719256,0.00013858709,0.96920437,0.000027702981,0.014756389,0.003517249,0.009539616],"study_design_scores_gemma":[0.00021748623,0.000054024884,0.0023117885,0.00012720542,4.9000676e-7,0.000004661142,0.00006860975,0.9959285,0.00007017605,0.00022106334,0.00088716985,0.00010878308],"about_ca_topic_score_codex":0.0001189,"about_ca_topic_score_gemma":0.00017680298,"teacher_disagreement_score":0.9796046,"about_ca_system_score_codex":0.00006720434,"about_ca_system_score_gemma":0.000013652732,"threshold_uncertainty_score":0.3698409},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011774279,0.000028289416,0.81261784,0.039026454,0.0027370972,0.0004809703,0.0000015911008,0.0011564912,0.13217697],"genre_scores_gemma":[0.7034715,0.0000018271131,0.0055531403,0.0026420222,0.0005812225,0.000041467094,0.0000066279695,0.000013315324,0.2876889],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873555,0.00006817968,0.00020830202,0.0004138015,0.0002195218,0.00035466242],"domain_scores_gemma":[0.99913335,0.00009252445,0.00006160096,0.00045375663,0.00007081813,0.00018794379],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039912714,0.00012877888,0.00016063565,0.000398322,0.00016171036,0.00086015,0.00057245727,0.00004147286,0.00014529741],"category_scores_gemma":[0.000027949654,0.000110950205,0.00006991715,0.0018147804,0.0000053582385,0.0005219061,0.00009418791,0.00010902082,0.0019263433],"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.000006028645,0.00001236207,0.00018152788,0.000011626419,0.000020227868,0.000010085501,0.0010476906,0.0051742103,0.0015907435,0.024877978,0.8131248,0.15394272],"study_design_scores_gemma":[0.000313366,0.00018773755,0.0026556237,0.00006613867,0.0000031890268,0.000021534559,0.00015021523,0.13411522,0.0046891365,0.0026344794,0.85479254,0.00037080093],"about_ca_topic_score_codex":0.00018246663,"about_ca_topic_score_gemma":0.00286407,"teacher_disagreement_score":0.8070647,"about_ca_system_score_codex":0.000040928084,"about_ca_system_score_gemma":0.000064181186,"threshold_uncertainty_score":0.99885076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003108338,0.000027726715,0.9952115,0.0023579665,0.00056193076,0.00042548304,0.000038503815,0.00027407458,0.0010717463],"genre_scores_gemma":[0.8892309,0.00006838123,0.071702786,0.0037099333,0.0016596228,0.002557072,0.0004682074,0.00003545384,0.03056763],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927753,0.000021442285,0.00014819142,0.0002665862,0.00008435106,0.00020188969],"domain_scores_gemma":[0.99877423,0.00018376677,0.00003499149,0.00092054956,0.000056395394,0.000030048215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051829906,0.00005292832,0.00005798084,0.000028919108,0.00038672684,0.00018333262,0.0009917932,0.000024559678,0.00002167649],"category_scores_gemma":[0.000012489553,0.000034096363,0.000036972833,0.00029393632,0.000011158121,0.00025174784,0.00036440516,0.000046945606,0.00020930172],"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.000003436802,0.00013711612,0.0017110753,0.000028724135,0.0000666473,9.74107e-7,0.0010458006,0.0029559534,0.000038612525,0.2282552,0.7373783,0.028378142],"study_design_scores_gemma":[0.000115444374,0.00000354696,0.00029819997,0.0000032436783,0.0000014019921,0.000001810241,0.00011249259,0.6023683,0.000010535847,0.00015113901,0.3969004,0.000033484073],"about_ca_topic_score_codex":0.000014980494,"about_ca_topic_score_gemma":0.00025879944,"teacher_disagreement_score":0.9235087,"about_ca_system_score_codex":0.000007711168,"about_ca_system_score_gemma":0.000010465994,"threshold_uncertainty_score":0.29744294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4412116,0.000024801677,0.5553636,0.00003992089,0.0016947874,0.00081626815,0.00010338297,0.00028382282,0.0004618034],"genre_scores_gemma":[0.9985303,0.00003981243,0.0007310452,0.000015670075,0.000026465244,0.000006488874,0.00003998365,0.000016625687,0.0005935992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983449,0.00015098919,0.00036636536,0.0007547922,0.00009350807,0.00028946364],"domain_scores_gemma":[0.9984017,0.0002311708,0.0003789079,0.0006569411,0.00025864082,0.000072618415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029805707,0.00022853425,0.0004373452,0.00046741613,0.00007628709,0.00008494884,0.0008288146,0.00027854217,0.000008191713],"category_scores_gemma":[0.000054285887,0.0002570742,0.0002400224,0.0008201779,0.00006857608,0.0002081215,0.00045342007,0.0002600693,0.00001397944],"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.00025240838,0.00023136266,0.0075409943,0.0009520117,0.00041286237,0.00013714896,0.0031459692,0.10288006,0.00027419793,0.88058746,0.0024013796,0.0011841402],"study_design_scores_gemma":[0.0007768622,0.00006329777,0.0016851062,0.00025580276,0.000019062874,0.0000023559214,0.00016607333,0.9320305,0.00012158595,0.064383596,0.00019862986,0.00029715442],"about_ca_topic_score_codex":0.00042967623,"about_ca_topic_score_gemma":0.00048469403,"teacher_disagreement_score":0.82915044,"about_ca_system_score_codex":0.00020139411,"about_ca_system_score_gemma":0.000156952,"threshold_uncertainty_score":0.99998814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28800178,0.000039111244,0.70879763,0.000013725564,0.0008982104,0.00012701891,0.000015831674,0.000095236435,0.0020114416],"genre_scores_gemma":[0.9992276,0.000014122544,0.00038431914,0.000016904361,0.00009704879,5.3181463e-7,0.000010910513,0.000007646121,0.00024091828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816656,0.00029593206,0.0003498689,0.0007680863,0.00010270489,0.00031686167],"domain_scores_gemma":[0.99755335,0.00015958438,0.00049672613,0.0013971601,0.00026366895,0.00012950574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398288,0.00022256552,0.0005831701,0.0002496075,0.00009272952,0.00006331326,0.0011987136,0.00024815588,0.000101612946],"category_scores_gemma":[0.00003389633,0.00023827555,0.00057894905,0.0014208242,0.00005878387,0.0002612251,0.0011983671,0.00035822138,0.000016199701],"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.00002428195,0.00021548515,0.07165607,0.00013712364,0.0020972919,0.000036098634,0.0020365843,0.21796963,0.00011093044,0.7051678,0.0001261931,0.00042251445],"study_design_scores_gemma":[0.00011064233,0.000017613736,0.010013568,0.00004339432,0.00045664038,7.037324e-7,0.00013110889,0.98746693,0.00010091306,0.0013026693,0.00008737467,0.00026846005],"about_ca_topic_score_codex":0.00065395917,"about_ca_topic_score_gemma":0.00017178422,"teacher_disagreement_score":0.7694973,"about_ca_system_score_codex":0.00020260004,"about_ca_system_score_gemma":0.000083115476,"threshold_uncertainty_score":0.9716595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44800982,0.000020248774,0.5508622,0.000012781541,0.00010814872,0.00016643287,0.0000016338788,0.00025812004,0.00056065],"genre_scores_gemma":[0.99368614,0.000040638468,0.006046323,0.00005723964,0.000035859768,0.00008244107,0.000026685453,0.000006106772,0.000018584442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874324,0.00004405068,0.000558081,0.00015608703,0.00026491252,0.00023362848],"domain_scores_gemma":[0.999145,0.000030562987,0.00024326875,0.00030032833,0.00023434396,0.000046526413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305951,0.00013510627,0.00025688857,0.00091080804,0.00019494456,0.0002044296,0.00023610952,0.000086133114,0.0000026217624],"category_scores_gemma":[0.000026369644,0.00012133102,0.00008837727,0.002094663,0.000034790806,0.0019048881,0.00009806689,0.00008340156,0.00001110988],"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.000012374632,0.000012927321,0.0008548559,0.00023804315,0.00021157734,0.0000011148151,0.007182629,0.3085291,0.00018935434,0.0017894306,0.00005708271,0.6809215],"study_design_scores_gemma":[0.00006601485,0.00010772692,0.0012356875,0.00010960154,0.00003289802,0.000007600696,0.00023635832,0.9967842,0.0008400946,0.00015929191,0.0002866411,0.00013388859],"about_ca_topic_score_codex":0.00007180179,"about_ca_topic_score_gemma":0.0000058716646,"teacher_disagreement_score":0.6882551,"about_ca_system_score_codex":0.00007683258,"about_ca_system_score_gemma":0.00002075299,"threshold_uncertainty_score":0.49477354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09758103,0.00010582313,0.89738286,0.00006514634,0.0029034133,0.00029234728,0.0000012936433,0.00048580833,0.0011822908],"genre_scores_gemma":[0.9977817,0.00014006023,0.0003643824,0.000059620634,0.00021855417,0.000003079072,0.000008568934,0.000030094829,0.0013939685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737215,0.0002837988,0.00046083744,0.0012138542,0.00009785223,0.00057148724],"domain_scores_gemma":[0.9981616,0.00023917633,0.00040681934,0.0009528316,0.00010873147,0.00013082923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082639116,0.000348766,0.0005322976,0.0005930349,0.00018925125,0.00023229957,0.001529918,0.00040113117,0.000010111193],"category_scores_gemma":[0.00003187636,0.00039903552,0.00033334063,0.0013211292,0.000057144363,0.00035795063,0.0014982601,0.0009252525,0.000056131074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022819342,0.000024798015,0.010188471,0.000028140967,0.000054654964,0.0004804678,0.0002924305,0.95041907,0.00000467455,0.037505206,0.00032015535,0.0006591083],"study_design_scores_gemma":[0.0006053951,0.000025723457,0.0016791376,0.0003287898,0.000017345317,0.00000752996,0.000114760995,0.96634215,0.0000044262774,0.030401874,0.00007093507,0.00040194372],"about_ca_topic_score_codex":0.0010701357,"about_ca_topic_score_gemma":0.0012768458,"teacher_disagreement_score":0.90020066,"about_ca_system_score_codex":0.00017287162,"about_ca_system_score_gemma":0.00006720879,"threshold_uncertainty_score":0.99984616},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077490484,0.00009130914,0.9930726,0.00025849248,0.0043856394,0.00084808684,0.0000043355453,0.00022289588,0.0010391087],"genre_scores_gemma":[0.38341308,0.000041278563,0.6111177,0.0012661171,0.0016918497,0.00022506838,0.000025565632,0.00013491379,0.0020844357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967537,0.00003441817,0.00070514233,0.0013532306,0.0004930762,0.0006604563],"domain_scores_gemma":[0.99785674,0.0006679019,0.0003413001,0.0008003432,0.00024248945,0.00009123631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017514171,0.0003963621,0.00049412245,0.0011387826,0.0002124775,0.0005537704,0.0018180223,0.0003213288,0.0000025748311],"category_scores_gemma":[0.00014491871,0.00037129692,0.00016175598,0.00092191034,0.00016794198,0.0005330291,0.00055409153,0.0005494302,0.000012949904],"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.000012505271,0.000027109605,0.00005125366,0.00017512185,0.000012732359,0.000033085984,0.001743576,0.07286763,0.00031388504,0.13384685,0.00006484861,0.7908514],"study_design_scores_gemma":[0.00026293003,0.00012241329,0.000027320018,0.0004936004,0.0000020690663,0.00002195491,4.0758374e-7,0.8589591,0.00014978772,0.13932198,0.00027870742,0.0003597603],"about_ca_topic_score_codex":0.000052465526,"about_ca_topic_score_gemma":0.00024885283,"teacher_disagreement_score":0.79049164,"about_ca_system_score_codex":0.00025354332,"about_ca_system_score_gemma":0.00025893285,"threshold_uncertainty_score":0.9998739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540299,0.0006163736,0.02996707,0.010143164,0.0021955802,0.0011001275,0.0000045153706,0.00023264911,0.0017106141],"genre_scores_gemma":[0.9991035,0.00001717655,0.00008036346,0.00014372112,0.00027723427,0.000012893314,5.698643e-7,0.000013857986,0.00035070404],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713844,0.00010556747,0.000647099,0.0004248569,0.0013395488,0.00034448045],"domain_scores_gemma":[0.9969894,0.0002674137,0.0009984494,0.0008456733,0.00085073826,0.00004827944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049534915,0.00024510646,0.00058794435,0.00023337753,0.00047731027,0.0004326428,0.0031410353,0.00005991334,7.202294e-7],"category_scores_gemma":[0.00016993393,0.0001082994,0.00028902994,0.0020425462,0.00012743236,0.00014230197,0.0008858397,0.00023239349,0.0000021483124],"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.00036124862,0.0003895294,0.451561,0.0014101614,0.020981528,0.0000032795954,0.055684462,0.19169568,0.006640859,0.09335347,0.1688862,0.009032592],"study_design_scores_gemma":[0.000583105,0.00030778215,0.036812957,0.001724531,0.0008834464,0.000008764023,0.0048142276,0.94826496,0.000969106,0.00024497948,0.004996075,0.00039009715],"about_ca_topic_score_codex":0.0001159053,"about_ca_topic_score_gemma":0.00006663842,"teacher_disagreement_score":0.75656927,"about_ca_system_score_codex":0.00005805552,"about_ca_system_score_gemma":0.000028382763,"threshold_uncertainty_score":0.5836878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012114984,0.0000026184368,0.9870738,0.00004336522,0.00011903123,0.01086415,4.9438387e-7,0.00048916764,0.00019588825],"genre_scores_gemma":[0.8988382,2.7657745e-7,0.044128567,0.000010675661,0.00008091351,0.056868996,7.895534e-7,0.00002450747,0.000047043137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860257,0.00005315479,0.00041943375,0.00037274358,0.00013882306,0.0004132953],"domain_scores_gemma":[0.99920624,0.00033958064,0.000053782438,0.00027556368,0.0000331126,0.000091723836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009291444,0.00017545049,0.00027490626,0.00019369001,0.00009408565,0.00014198077,0.00024868257,0.00010660454,4.4530924e-7],"category_scores_gemma":[0.00002304389,0.00014598419,0.00004709261,0.00026695014,0.000010995002,0.00007111466,0.000043215583,0.00011552539,0.0000049395576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005311257,0.000026884174,3.7809474e-7,0.00028126824,0.0000038678145,0.0000019332879,0.00048095136,0.63769644,0.00004720767,0.36119172,0.0000078574985,0.0002561914],"study_design_scores_gemma":[0.0003850948,0.00016006287,5.580954e-7,0.0006130853,0.0000018250737,0.000012401187,0.000039920113,0.9872109,0.00012110479,0.011256584,0.000033423632,0.00016498499],"about_ca_topic_score_codex":0.000013676149,"about_ca_topic_score_gemma":8.000137e-7,"teacher_disagreement_score":0.94294524,"about_ca_system_score_codex":0.00004486964,"about_ca_system_score_gemma":0.000010072358,"threshold_uncertainty_score":0.5953062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006533145,0.00091357913,0.99498165,0.0003689015,0.0011431193,0.00035907977,0.000055750104,0.00027005537,0.0012545519],"genre_scores_gemma":[0.96820515,0.000050725397,0.029805625,0.00047528814,0.0007206716,0.00014908623,0.0004288514,0.00001306566,0.00015154718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998224,0.00020676955,0.0004899015,0.0005292074,0.00022413695,0.000325967],"domain_scores_gemma":[0.9965029,0.0021742433,0.00019538237,0.0007881376,0.00026507134,0.0000742981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041711144,0.00024869916,0.00059266604,0.00034215883,0.00021578404,0.00034873805,0.0008870039,0.00023380911,0.00008570142],"category_scores_gemma":[0.0000050169792,0.00019415212,0.00031448784,0.0013939899,0.00013627134,0.0002807652,0.00020078951,0.00048428532,0.000005522703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003579293,0.000043006155,0.00006073417,0.000012402976,0.0010643534,0.0000029875996,0.00034386804,0.7824703,2.1321546e-7,0.12490892,0.08393635,0.0071210945],"study_design_scores_gemma":[0.00018322814,0.0003846438,0.00094086636,0.00027722088,0.00014906465,0.000008638011,0.000037034875,0.985856,0.000004562426,0.000634044,0.011300943,0.00022373753],"about_ca_topic_score_codex":0.00001178996,"about_ca_topic_score_gemma":0.00007478251,"teacher_disagreement_score":0.9675518,"about_ca_system_score_codex":0.000060438393,"about_ca_system_score_gemma":0.000047951253,"threshold_uncertainty_score":0.7917294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012519135,0.0005221729,0.76830524,0.0018724,0.0021024575,0.00057604484,0.00007024009,0.00087893265,0.22566],"genre_scores_gemma":[0.44643912,0.00018140944,0.041451175,0.008849108,0.01528735,0.00050402735,0.00033519798,0.001073722,0.48587888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99664885,0.00009486552,0.0005294361,0.0014540281,0.0007489514,0.0005238797],"domain_scores_gemma":[0.9972924,0.0006909844,0.0002771117,0.0013645723,0.00018152871,0.00019341212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018107088,0.00093149557,0.0007748896,0.0007918103,0.0003500025,0.0007859146,0.0012703057,0.0005774279,0.00026915836],"category_scores_gemma":[0.000013392045,0.00067386683,0.00040834802,0.00021465393,0.00013713828,0.0001175616,0.00027908856,0.0013085185,0.0005241268],"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.000044186963,0.000044097535,0.0000012644429,0.00028326217,0.0008926044,0.00037199527,0.0006508689,0.08538452,0.000011388934,0.7360125,0.040907852,0.13539544],"study_design_scores_gemma":[0.00037155,0.0011251118,0.000021510094,0.0058385143,0.0003026211,0.0015511315,0.000005674595,0.11564184,0.00030829987,0.16471386,0.707636,0.0024839097],"about_ca_topic_score_codex":0.0000118253265,"about_ca_topic_score_gemma":0.00011435056,"teacher_disagreement_score":0.7268541,"about_ca_system_score_codex":0.00022100197,"about_ca_system_score_gemma":0.00016189882,"threshold_uncertainty_score":0.99957126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030575566,0.000017180884,0.964893,0.0010404054,0.0010524697,0.00022135713,0.0000016366146,0.00058433664,0.001614084],"genre_scores_gemma":[0.9939667,0.0000040789178,0.0036678857,0.00017681904,0.00020726328,0.0000947245,0.000003026765,0.0000061012847,0.0018734171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909735,0.00003955103,0.00016863053,0.0003062908,0.0001274371,0.00026073688],"domain_scores_gemma":[0.9992836,0.00023193641,0.000046067456,0.00027420756,0.00011104748,0.000053112613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004618666,0.0000762654,0.00010447703,0.00008718826,0.00021924032,0.00021475136,0.00027239608,0.000049099523,0.000008964749],"category_scores_gemma":[0.00007409642,0.000066858185,0.0000655664,0.00045701416,0.00001401612,0.0004497252,0.00007406962,0.00005421547,0.00012301169],"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.000009411044,0.00002529361,0.00057104655,0.000038666152,0.000015800662,0.000008760373,0.0005246691,0.014830579,0.0019508342,0.9488696,0.010851809,0.022303544],"study_design_scores_gemma":[0.00015263863,0.00006766322,0.00020923352,0.000024039471,0.0000013417487,0.000011580525,0.00028397262,0.9749385,0.0029758764,0.009928752,0.011285902,0.00012050523],"about_ca_topic_score_codex":0.0000365343,"about_ca_topic_score_gemma":0.00008299246,"teacher_disagreement_score":0.9633911,"about_ca_system_score_codex":0.000026939426,"about_ca_system_score_gemma":0.000025000134,"threshold_uncertainty_score":0.27263978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05508335,0.0150632365,0.92152494,0.00406338,0.003199492,0.00046193274,0.000006640831,0.000062356856,0.00053466205],"genre_scores_gemma":[0.99752086,0.00060696667,0.0014201707,0.00027670513,0.00005250202,0.000030553656,8.2335845e-7,0.0000041704343,0.00008723846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.00012431518,0.00027972148,0.00033730967,0.00018387634,0.00015153733],"domain_scores_gemma":[0.997591,0.0018174442,0.00013934584,0.00021895685,0.00019161392,0.000041615956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050274126,0.000118920165,0.00012259858,0.00003062624,0.00040186528,0.00035352408,0.00034476692,0.000042440268,0.000005140626],"category_scores_gemma":[0.00017814673,0.00006789653,0.00005936025,0.00033429536,0.00018810984,0.00095840986,0.0001140467,0.00014716625,0.0000014419234],"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.000060676262,0.00009932727,0.00047289458,0.00036178707,0.00012962299,0.0000085315705,0.09468284,0.0024396563,0.0004923598,0.6412616,0.00839188,0.25159883],"study_design_scores_gemma":[0.0002291349,0.00016392686,0.00044063304,0.00029858647,0.000034915192,0.00020588675,0.0042516007,0.89018583,0.0004944577,0.008145772,0.095334396,0.00021486217],"about_ca_topic_score_codex":0.000030747397,"about_ca_topic_score_gemma":0.0000059779463,"teacher_disagreement_score":0.9424375,"about_ca_system_score_codex":0.0000089001505,"about_ca_system_score_gemma":0.00007182293,"threshold_uncertainty_score":0.3409041},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27546176,0.06655357,0.6444492,0.006160777,0.0028571058,0.00044902117,0.0000019466445,0.0002871019,0.0037795734],"genre_scores_gemma":[0.993747,0.0030617295,0.00213568,0.00017987943,0.0003849581,0.0000050450103,0.0000017461197,0.00002734989,0.00045660546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736303,0.00028191783,0.00045069822,0.0005072796,0.00025502866,0.0011420344],"domain_scores_gemma":[0.9987306,0.0001850144,0.00029872192,0.00056803337,0.00011145536,0.00010616195],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002900348,0.00027767892,0.00033609362,0.00023505521,0.00046532304,0.0011644425,0.0008752714,0.0002009112,0.0000037815573],"category_scores_gemma":[0.00004255472,0.00024956555,0.0001002421,0.00009275372,0.00006551326,0.00013894452,0.001673488,0.005284114,0.00001150774],"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.000009212103,0.000024705954,0.000059351172,0.00010931882,0.00035948696,0.000010439055,0.0027697764,0.0046418877,0.000013029752,0.8947808,0.0006632794,0.096558705],"study_design_scores_gemma":[0.00023340137,0.00015525863,0.00003623555,0.00085429975,0.00002886985,0.0014519158,0.0007509275,0.28815007,0.000007101882,0.7077997,0.00023735795,0.0002948755],"about_ca_topic_score_codex":0.00017882366,"about_ca_topic_score_gemma":0.00030687527,"teacher_disagreement_score":0.71828526,"about_ca_system_score_codex":0.0007731504,"about_ca_system_score_gemma":0.0010635504,"threshold_uncertainty_score":0.99999565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050526797,0.0000049422374,0.88140345,0.0017429201,0.0020385056,0.03218422,5.495481e-7,0.002089841,0.07548292],"genre_scores_gemma":[0.8758278,0.0000010368184,0.035839193,0.001342386,0.0022231995,0.034358453,0.0000016693496,0.00006120938,0.050345056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848986,0.00006056927,0.0003572576,0.0004029991,0.0002557174,0.00043361145],"domain_scores_gemma":[0.9991673,0.000055589295,0.00009816969,0.00048034298,0.00011599669,0.00008259875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006512178,0.00013945218,0.00017349471,0.00014618118,0.0002616034,0.00036241027,0.00047610415,0.000097118944,0.00009938272],"category_scores_gemma":[0.000020747895,0.00010631538,0.00009002881,0.0009973325,0.000009801486,0.000450173,0.0002841753,0.00014788203,0.000681944],"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.00005388844,0.00019334909,0.006365401,0.00029502105,0.00018506775,0.00035644788,0.0061496315,0.034936935,0.024370898,0.6248021,0.28146878,0.020822473],"study_design_scores_gemma":[0.00025432598,0.00004023776,0.000058859685,0.000084908475,0.0000015987257,0.00002913086,0.000036362868,0.8790117,0.0030093351,0.0007033184,0.11660086,0.00016934684],"about_ca_topic_score_codex":0.00015807111,"about_ca_topic_score_gemma":0.00001721166,"teacher_disagreement_score":0.8707751,"about_ca_system_score_codex":0.000055197866,"about_ca_system_score_gemma":0.000060683436,"threshold_uncertainty_score":0.8765238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7742614,0.00024937448,0.22112979,0.001012707,0.0021087376,0.00027316643,6.237893e-7,0.00026319045,0.0007010005],"genre_scores_gemma":[0.9973749,0.00003253168,0.0000680676,0.0003036101,0.000097138174,0.000018852903,9.578061e-8,0.0000064646947,0.0020983499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991949,0.0000872209,0.0002083974,0.00020753822,0.00012852761,0.00017340684],"domain_scores_gemma":[0.9994858,0.000041246643,0.00006759606,0.0003206739,0.00005460481,0.000030087138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026765684,0.000092569135,0.00013630169,0.000075913274,0.00011783658,0.000085060055,0.0003668137,0.000053053984,0.0000059322715],"category_scores_gemma":[0.00001649373,0.000050415572,0.000072208626,0.00040003326,0.000062540166,0.00022107524,0.00023181703,0.00009028045,0.0000064987075],"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.000069742,0.00013046623,0.02496009,0.0002775265,0.0002952929,0.000004175931,0.008759436,0.011484285,0.021836292,0.8748398,0.017172018,0.040170908],"study_design_scores_gemma":[0.00023875521,0.0001051243,0.009825229,0.00021182952,0.0000062683407,0.000017115392,0.00042243398,0.9761318,0.004505799,0.006959074,0.0013824854,0.00019407502],"about_ca_topic_score_codex":0.00014469653,"about_ca_topic_score_gemma":0.00013396233,"teacher_disagreement_score":0.96464753,"about_ca_system_score_codex":0.000010192373,"about_ca_system_score_gemma":0.000009441808,"threshold_uncertainty_score":0.20558874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7319995,0.0005291846,0.23092923,0.0003721705,0.010457109,0.00051984045,0.000024808907,0.00034772238,0.024820423],"genre_scores_gemma":[0.9957126,0.000051286333,0.000078635945,0.00005839857,0.000097985976,5.975133e-7,9.966778e-7,0.000011020128,0.0039884965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987282,0.00015070543,0.00020189327,0.0006374099,0.00008767772,0.00019410085],"domain_scores_gemma":[0.9983125,0.00006069655,0.00016986571,0.0012690206,0.00013130267,0.00005662938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023555107,0.0001875251,0.00025093806,0.00015606226,0.00007924925,0.00007746965,0.0019041938,0.00021477256,0.000019198038],"category_scores_gemma":[0.000011396918,0.00014968074,0.00040631474,0.0007100509,0.000079863945,0.00008391376,0.002638959,0.000546399,0.000056912235],"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.0000076564165,0.00003649375,0.0009043036,0.00015816199,0.0001456641,0.00006912479,0.00042860757,0.11272219,0.00009149498,0.88194126,0.0031007526,0.00039429168],"study_design_scores_gemma":[0.00019394925,0.000035781828,0.0009417872,0.00043150116,0.00006616283,0.000017979752,0.000120315424,0.84152544,0.0003882099,0.15360844,0.002310974,0.00035945905],"about_ca_topic_score_codex":0.00025969636,"about_ca_topic_score_gemma":0.00009823039,"teacher_disagreement_score":0.7288032,"about_ca_system_score_codex":0.00007809465,"about_ca_system_score_gemma":0.0001256148,"threshold_uncertainty_score":0.6103803},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091715015,0.003027401,0.25083345,0.25230747,0.021189945,0.0050529274,0.0003828909,0.0019303255,0.37356058],"genre_scores_gemma":[0.9820414,0.00009557476,0.014756537,0.00019825056,0.00012984287,0.000011325105,0.000004184352,0.000009149996,0.0027537053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898756,0.0000057637976,0.0002443455,0.0003588547,0.00026544125,0.00013801253],"domain_scores_gemma":[0.9984293,0.000032610304,0.00010838901,0.0013575092,0.000052903302,0.000019279507],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00047920755,0.00008960267,0.0001308068,0.00007979763,0.000049119062,0.00010498369,0.007001912,0.000030617823,0.00001259059],"category_scores_gemma":[0.000024298202,0.000059134472,0.000056496294,0.00033059737,0.000039345854,0.0005341093,0.0057452363,0.000093094146,0.000018689021],"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.0000078899175,0.00004551466,0.00016760173,0.0006059698,0.00015199198,0.0000018639988,0.00014734306,0.000024728624,0.000099780365,0.6998387,0.28604934,0.0128592905],"study_design_scores_gemma":[0.0009627086,0.0006279115,0.0037733929,0.0046958015,0.00022464052,0.00004544316,0.0019694986,0.30975923,0.0029308605,0.19842307,0.4758537,0.000733732],"about_ca_topic_score_codex":0.000009351381,"about_ca_topic_score_gemma":7.655476e-7,"teacher_disagreement_score":0.89032644,"about_ca_system_score_codex":0.0000146000075,"about_ca_system_score_gemma":0.000006297796,"threshold_uncertainty_score":0.9983707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019483564,0.00025548847,0.96383065,0.0001287228,0.013668486,0.0015810123,0.00014106283,0.00047814767,0.00043289168],"genre_scores_gemma":[0.99660677,0.0000044864955,0.00037696294,0.000059306007,0.00025261298,0.00074825395,0.000011641768,0.000057640314,0.0018823309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672097,0.00026126276,0.0010159233,0.00087426923,0.00059208187,0.0005354652],"domain_scores_gemma":[0.9981247,0.0005388027,0.0002749511,0.0006458017,0.00026763664,0.00014807029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079928874,0.0003637696,0.0004969133,0.00052493275,0.00053032045,0.00033862222,0.0005225631,0.00021448008,0.00006606955],"category_scores_gemma":[0.000007718289,0.00036808997,0.00041015111,0.0006531355,0.00006396441,0.00038296133,0.00000632971,0.0002518703,0.00004844954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006559553,0.0003485986,0.000005579276,0.00078239647,0.0005208513,0.000013346949,0.018028673,0.8726783,0.02840992,0.0024688067,0.024010537,0.052667424],"study_design_scores_gemma":[0.0011714828,0.0005774931,0.000011825391,0.0008653001,0.00007849331,0.0001296074,0.003238326,0.9583236,0.024306739,0.00006213115,0.010679952,0.0005550313],"about_ca_topic_score_codex":0.00037081316,"about_ca_topic_score_gemma":0.000080257436,"teacher_disagreement_score":0.9771232,"about_ca_system_score_codex":0.00027315557,"about_ca_system_score_gemma":0.00022212807,"threshold_uncertainty_score":0.9998771},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018904174,0.0009793382,0.9691289,0.0003080882,0.007406055,0.00014093706,9.028043e-7,0.0006301426,0.0025014835],"genre_scores_gemma":[0.988125,0.0000080617165,0.010127124,0.00013050622,0.00027660755,0.000011322374,7.1823126e-7,0.0000064465044,0.0013142084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988983,0.000058699698,0.00023873437,0.00038652835,0.00018980086,0.0002279076],"domain_scores_gemma":[0.99947226,0.000082161794,0.000023973422,0.00027313098,0.000068824134,0.0000796279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004585369,0.00011032436,0.00012125423,0.00007992054,0.00009185901,0.0005044432,0.00035087654,0.000053217944,0.000049779974],"category_scores_gemma":[0.000018879007,0.00008329202,0.00009250584,0.0002909627,0.000018840536,0.00015153612,0.00013932989,0.00016774371,0.000387951],"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.0000017073515,0.00013211356,0.00011656634,0.00013906475,0.000056940728,0.000057678128,0.0031725792,0.021136899,0.0009107896,0.91104,0.00468273,0.058552925],"study_design_scores_gemma":[0.000093061426,0.000024245684,0.00003567954,0.0001077229,0.0000020857674,0.000022737977,0.00007984711,0.97550356,0.00034899783,0.00006634499,0.02359673,0.00011897279],"about_ca_topic_score_codex":0.000050596762,"about_ca_topic_score_gemma":0.000020382036,"teacher_disagreement_score":0.9692208,"about_ca_system_score_codex":0.000067714944,"about_ca_system_score_gemma":0.000060129772,"threshold_uncertainty_score":0.49864545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067010573,0.41000026,0.52267796,0.038799632,0.011108525,0.0042748917,0.000005648309,0.0004728252,0.0059591928],"genre_scores_gemma":[0.9195668,0.068846084,0.0007891072,0.0067521255,0.0011266177,0.000487656,0.000013296947,0.000038129485,0.0023801844],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656725,0.0005166129,0.00060450716,0.00054575404,0.0013720995,0.0003937529],"domain_scores_gemma":[0.99643195,0.00087074016,0.00027360552,0.0017571918,0.0006013257,0.00006520229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00844934,0.0002802779,0.000340376,0.00018191789,0.0004429734,0.0008087681,0.0022773119,0.00007220294,0.00013583251],"category_scores_gemma":[0.0003899737,0.00013165847,0.00015923993,0.0033717253,0.00007459394,0.00085861736,0.00041171449,0.00049364043,0.000361975],"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.000008568325,0.000027645854,0.0008771506,0.0009490636,0.00014663792,0.0000042539255,0.0012196737,0.0025677297,0.0000015966409,0.0058820844,0.23516677,0.75314885],"study_design_scores_gemma":[0.00013336139,0.00014536019,0.0007874874,0.0026596133,0.00009874105,0.00004712353,0.00003586821,0.4695918,0.000011138542,0.000088198016,0.52620125,0.00020009145],"about_ca_topic_score_codex":0.0000124298695,"about_ca_topic_score_gemma":0.000042994674,"teacher_disagreement_score":0.91286576,"about_ca_system_score_codex":0.00018516676,"about_ca_system_score_gemma":0.00025324366,"threshold_uncertainty_score":0.779897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031114183,0.0006154179,0.987236,0.0004211023,0.0039612716,0.00060234877,0.0000054168368,0.0019864673,0.0048608193],"genre_scores_gemma":[0.94999605,0.000008459302,0.03254703,0.00018713652,0.00057242817,0.00036930715,0.000003840178,0.000020454803,0.016295262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888235,0.000048833146,0.00029112233,0.00040095983,0.00012213289,0.00025457444],"domain_scores_gemma":[0.9992385,0.00018248193,0.000033447614,0.00034703722,0.00013737816,0.00006116568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042571756,0.00013328923,0.0001730399,0.00014413706,0.00010007097,0.00069571706,0.00042428562,0.00010294926,0.000010359076],"category_scores_gemma":[0.00002207182,0.00009974822,0.00011627477,0.00031573538,0.000013134281,0.00034325823,0.00006754798,0.0000945273,0.00007224042],"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.0000036603333,0.000034624984,0.000030753305,0.00021412435,0.00006816944,0.000018198709,0.000479575,0.00011666242,0.0016404986,0.8906571,0.09013909,0.016597513],"study_design_scores_gemma":[0.00008325747,0.000073603165,0.000009280661,0.00012752839,0.0000036422464,0.0000559427,0.000050215593,0.7741451,0.0016001065,0.00030416367,0.22339782,0.0001493281],"about_ca_topic_score_codex":0.0002684579,"about_ca_topic_score_gemma":0.00008369264,"teacher_disagreement_score":0.95468897,"about_ca_system_score_codex":0.0000624021,"about_ca_system_score_gemma":0.00004154058,"threshold_uncertainty_score":0.67088157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24183317,0.0058451863,0.74770445,0.0008819162,0.0026765878,0.00021699947,0.0000035379283,0.00009855469,0.00073962036],"genre_scores_gemma":[0.9968006,0.000115252806,0.0021719448,0.00021699852,0.00024009185,0.000010236596,5.1262765e-7,0.000017898687,0.00042644187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847835,0.00028307486,0.00046855662,0.00026578695,0.00021954073,0.0002846614],"domain_scores_gemma":[0.9981707,0.00088968215,0.00021895701,0.00024837497,0.000347109,0.00012521657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033437307,0.00016427043,0.00033789687,0.00053443364,0.00020904223,0.0005206658,0.00041747052,0.00010007197,0.000013753476],"category_scores_gemma":[0.00015186622,0.00012748153,0.00031562135,0.0005612532,0.00011014082,0.0007662627,0.0000658679,0.000250902,0.0000020285274],"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.000085709005,0.000029621335,0.00008433945,0.000098578945,0.00020185095,0.000068822614,0.00053633936,0.00003336001,0.0011241175,0.9857531,0.00360164,0.008382478],"study_design_scores_gemma":[0.0005783875,0.0007160833,0.00050882075,0.0002607142,0.000042584332,0.0012394717,0.0002487758,0.00970914,0.0005404827,0.96720815,0.018740034,0.00020738646],"about_ca_topic_score_codex":0.0000050794974,"about_ca_topic_score_gemma":0.000005572169,"teacher_disagreement_score":0.75496745,"about_ca_system_score_codex":0.00004188314,"about_ca_system_score_gemma":0.000108516644,"threshold_uncertainty_score":0.51985455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09466084,0.0014155192,0.88454765,0.0062866774,0.0026691463,0.00089966203,0.00002008747,0.008820182,0.0006802497],"genre_scores_gemma":[0.958539,0.000053246917,0.04080695,0.00007994159,0.00010602162,0.00015142688,0.000007792816,0.000030037596,0.00022558958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752975,0.000006912357,0.00043427924,0.0011718563,0.0003266103,0.0005305696],"domain_scores_gemma":[0.9984351,0.00021788698,0.00015106804,0.0009842973,0.00017529329,0.000036403402],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007997109,0.00028938925,0.00028121367,0.00039448377,0.00028633053,0.0012325051,0.0034187115,0.00022845267,0.0000029749986],"category_scores_gemma":[0.0010219811,0.00022618832,0.00008543549,0.0007254835,0.00007625689,0.0008090932,0.0016889535,0.00041161434,0.000029775098],"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.000023199562,0.00006491652,0.00003456116,0.00055576226,0.0000988527,0.000008847641,0.0011326924,0.0003307849,0.012270916,0.83163804,0.025628062,0.12821338],"study_design_scores_gemma":[0.00015493204,0.0002774507,0.000023130262,0.0004660512,0.000016456077,0.00007423906,0.00077055965,0.8471908,0.03206715,0.06059238,0.05795593,0.00041091957],"about_ca_topic_score_codex":0.000006679737,"about_ca_topic_score_gemma":0.0000050538033,"teacher_disagreement_score":0.86387813,"about_ca_system_score_codex":0.000191292,"about_ca_system_score_gemma":0.00006988951,"threshold_uncertainty_score":0.9998043},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005428962,0.00003692318,0.9818234,0.002634413,0.0041482244,0.00022427567,0.0000034306624,0.00039944827,0.0053009414],"genre_scores_gemma":[0.9727882,0.000004222739,0.004840558,0.0011680163,0.00034262173,0.000041667,0.000010605812,0.000009090999,0.020795004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991706,0.000026240332,0.00016891735,0.00033672623,0.00012606957,0.00017146228],"domain_scores_gemma":[0.9994736,0.000089973,0.0000222942,0.00027769987,0.00009891856,0.00003753567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031380382,0.00010055698,0.00011430176,0.0000829195,0.00011537072,0.0004494599,0.00022784414,0.00006409706,0.000034659202],"category_scores_gemma":[0.000019838872,0.00007326324,0.000077877776,0.00019093676,0.000007977172,0.0003379714,0.00004439659,0.00011852785,0.00015129545],"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.000006847477,0.000013245976,0.000008301232,0.000026221107,0.000011580471,0.000005493978,0.00023191511,0.00034294435,0.00016522562,0.8403467,0.14085153,0.01798997],"study_design_scores_gemma":[0.00012984949,0.0002283475,0.000093212446,0.00016215074,0.0000043233877,0.000015889898,0.00003872572,0.84372413,0.0076386826,0.011317686,0.13649283,0.00015415181],"about_ca_topic_score_codex":0.0001877542,"about_ca_topic_score_gemma":0.00017139841,"teacher_disagreement_score":0.97698283,"about_ca_system_score_codex":0.000060459504,"about_ca_system_score_gemma":0.000027191418,"threshold_uncertainty_score":0.43341523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004489867,0.00016346731,0.98750067,0.00063059747,0.004778766,0.00028581527,0.0000045898264,0.00069468375,0.0014515442],"genre_scores_gemma":[0.91962075,5.081337e-7,0.07787926,0.00031921515,0.0004943602,0.00005926565,0.0000034460875,0.000017008042,0.0016062012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985579,0.00006590766,0.00030788864,0.00047982569,0.0002141087,0.0003743402],"domain_scores_gemma":[0.9989889,0.00049877586,0.000042991673,0.00029748533,0.00009474208,0.00007707289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008388371,0.00014707126,0.00016523166,0.00013011316,0.00027425605,0.0007180916,0.00037558237,0.00006780418,0.000026474174],"category_scores_gemma":[0.000030021334,0.00011792698,0.00016025233,0.00038648967,0.000013109518,0.00015457754,0.00008106641,0.00014405399,0.00007366983],"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.0000058123014,0.000088857676,0.000019301095,0.0001380236,0.000081229184,0.00006226763,0.0011670974,0.04463379,0.0007020248,0.38515678,0.0132508185,0.554694],"study_design_scores_gemma":[0.0002201404,0.000060550054,0.0000094554525,0.000139799,0.0000052340056,0.000016973512,0.0000884059,0.99003536,0.0024397331,0.00046657116,0.006346771,0.00017098647],"about_ca_topic_score_codex":0.000090795045,"about_ca_topic_score_gemma":0.000005909231,"teacher_disagreement_score":0.9454016,"about_ca_system_score_codex":0.000112855785,"about_ca_system_score_gemma":0.000069355774,"threshold_uncertainty_score":0.6924574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25105286,0.00016776842,0.7455596,0.00002873932,0.002053638,0.0004887237,0.000048640624,0.00014107228,0.00045900006],"genre_scores_gemma":[0.994711,0.00006100227,0.004528911,0.000030824413,0.000053740703,0.000005903804,0.000006503956,0.000016540142,0.00058557844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983244,0.00013979965,0.00024992385,0.00096707477,0.00006293185,0.0002558461],"domain_scores_gemma":[0.99846864,0.0003196734,0.00021840748,0.0006959738,0.00018981018,0.00010749801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038856344,0.00026430227,0.00051718735,0.00027592265,0.00008792811,0.000129479,0.0006515469,0.00027733244,0.000005776146],"category_scores_gemma":[0.000029358378,0.00027842764,0.00032717094,0.00038508288,0.00010362403,0.00014596063,0.0012034976,0.00034021583,0.000006560733],"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.00010083506,0.00017325391,0.00018863629,0.0009221625,0.00077026885,0.00015589043,0.001204369,0.0072211847,0.00027505102,0.9599584,0.0019510381,0.027078943],"study_design_scores_gemma":[0.00048262652,0.000113027105,0.00005352702,0.00017408487,0.00006658211,0.000009504506,0.00006267004,0.80456257,0.00016164836,0.1938333,0.00023182326,0.00024862945],"about_ca_topic_score_codex":0.0001235881,"about_ca_topic_score_gemma":0.000028129713,"teacher_disagreement_score":0.7973414,"about_ca_system_score_codex":0.00006714763,"about_ca_system_score_gemma":0.000104472834,"threshold_uncertainty_score":0.9999668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044913328,0.0012470318,0.9919856,0.0012882274,0.00056697975,0.0016713162,0.000005270561,0.0009659618,0.0018204596],"genre_scores_gemma":[0.93612653,0.000020060932,0.060389087,0.0009097645,0.0005175731,0.001670311,0.00021962103,0.000047516587,0.000099512465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971952,0.0005679965,0.0006256417,0.00085050537,0.00027157582,0.0004890844],"domain_scores_gemma":[0.9956371,0.0009798611,0.00017829418,0.0028285063,0.00022209113,0.00015414259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001663918,0.0003224171,0.0003186083,0.00022184243,0.0006455265,0.00074851885,0.0022163102,0.00027951572,0.0000049780115],"category_scores_gemma":[0.000024427378,0.00029022715,0.00023039369,0.0009487231,0.00009807358,0.00026068088,0.00020218325,0.0005868981,0.0000062372815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002016916,0.00011528881,0.00006567192,0.00006967971,0.00003147023,1.7781112e-7,0.00022304944,0.8115265,0.000014772309,0.15464847,0.0023918988,0.030892888],"study_design_scores_gemma":[0.00024396022,0.00013401528,0.00007346,0.00012222184,0.000009511618,0.000008557614,0.00003222509,0.9693364,0.000017696353,0.004999853,0.024702685,0.00031941768],"about_ca_topic_score_codex":0.000019257966,"about_ca_topic_score_gemma":0.000040396775,"teacher_disagreement_score":0.9356774,"about_ca_system_score_codex":0.00013955084,"about_ca_system_score_gemma":0.00009358464,"threshold_uncertainty_score":0.999955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8887507,0.00100209,0.095166914,0.00024873434,0.014092539,0.00031615875,0.0000020892066,0.00007894007,0.00034184108],"genre_scores_gemma":[0.98957497,0.000039458748,0.009330666,0.000010225227,0.0010057434,0.0000016888802,2.9469555e-7,0.00002133715,0.000015630329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977729,0.00013236824,0.0010199072,0.00027816914,0.00053759746,0.00025910905],"domain_scores_gemma":[0.9975129,0.0009795388,0.00050182414,0.00029319327,0.0005529736,0.00015959346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016915625,0.00025342175,0.0007337959,0.00018203896,0.00016790164,0.0004036525,0.00046111245,0.00013657441,0.0000023658952],"category_scores_gemma":[0.00023310352,0.00016694149,0.0001292245,0.00038254468,0.00012110005,0.00043425662,0.00025529703,0.00040605487,6.794878e-7],"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.00016788921,0.00036885176,0.00067743595,0.0010138834,0.00022096584,0.00006845446,0.0044459812,0.00026509166,0.0002459414,0.98795414,0.0002577521,0.0043135905],"study_design_scores_gemma":[0.0054554567,0.0062336694,0.0007278709,0.0044092257,0.00022189213,0.0014698376,0.001038377,0.5703256,0.0014341593,0.40320143,0.0046949354,0.0007875156],"about_ca_topic_score_codex":0.000020652842,"about_ca_topic_score_gemma":0.0000037669834,"teacher_disagreement_score":0.58475274,"about_ca_system_score_codex":0.000049513015,"about_ca_system_score_gemma":0.00019784123,"threshold_uncertainty_score":0.6807676},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488386,0.0034024443,0.006991381,0.0013557546,0.024549596,0.00023829813,8.7417027e-7,0.00068054197,0.013942494],"genre_scores_gemma":[0.99918866,0.000020986166,0.0001799811,0.00009048431,0.000020101656,0.00001731101,7.440675e-7,0.00000929461,0.00047243532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990279,0.00007121304,0.00020253021,0.00031355838,0.00016299961,0.00022179147],"domain_scores_gemma":[0.99947613,0.000084007566,0.000015023673,0.0003444349,0.000031385483,0.00004899696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037128394,0.000101190744,0.00013313489,0.00018940736,0.00004606042,0.0002760957,0.00043043707,0.000066952416,0.000015877971],"category_scores_gemma":[0.000011833807,0.00009079847,0.000072828865,0.00071718614,0.000018561512,0.00037787508,0.00008510895,0.00015410976,0.00016032287],"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":[7.9749907e-7,0.000020391859,0.0007090955,0.000014315407,0.0000090478525,0.000069527836,0.00039586125,0.000027062017,0.00014287334,0.9908782,0.004831524,0.0029013043],"study_design_scores_gemma":[0.00030295385,0.00009244825,0.0016936782,0.00020537998,0.0000034047087,0.00007167087,0.00006697894,0.124861695,0.0006088996,0.8298427,0.041973084,0.00027714734],"about_ca_topic_score_codex":0.000078893885,"about_ca_topic_score_gemma":0.000020994337,"teacher_disagreement_score":0.16103554,"about_ca_system_score_codex":0.000050932023,"about_ca_system_score_gemma":0.000034135443,"threshold_uncertainty_score":0.37026542},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043336516,0.00013190309,0.9885842,0.0029472688,0.0003417359,0.0002601066,0.00003299763,0.00018193694,0.0031862033],"genre_scores_gemma":[0.59016764,0.000008861842,0.4033007,0.00062966096,0.00029308145,0.0000811722,0.000023329085,0.000027252532,0.0054682917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985268,0.00006125786,0.000366864,0.00036689916,0.0002791242,0.00039905385],"domain_scores_gemma":[0.99825114,0.00016987816,0.000101429956,0.00084173284,0.00035317772,0.00028262858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021486945,0.00019085845,0.00031218576,0.000095833726,0.00021600911,0.00046695402,0.00047440515,0.00007356735,0.00008198695],"category_scores_gemma":[0.00017528389,0.00014789111,0.00013775231,0.00078462687,0.000025025114,0.00028445042,0.00020361051,0.00014174922,0.0001854819],"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.000008105328,0.00011559063,0.00012776772,0.000036598023,0.00017034113,0.00008048005,0.002365527,0.0020896483,0.0008589502,0.9667956,0.02500337,0.0023479732],"study_design_scores_gemma":[0.0062320386,0.0016361553,0.002007127,0.0022593103,0.00042613523,0.0026820719,0.002765863,0.5418825,0.034341116,0.086840756,0.31470704,0.0042198575],"about_ca_topic_score_codex":0.000013561262,"about_ca_topic_score_gemma":0.00004190333,"teacher_disagreement_score":0.8799549,"about_ca_system_score_codex":0.00007248638,"about_ca_system_score_gemma":0.00016278162,"threshold_uncertainty_score":0.6030825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17700033,0.00008139629,0.7588428,0.00021769099,0.0017286353,0.00053610525,3.063905e-7,0.0003547577,0.061237954],"genre_scores_gemma":[0.99344635,0.0000017710807,0.0001955657,0.000018683657,0.00004986442,0.0000327865,7.497046e-7,0.0000031613808,0.006251068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989338,0.00009839917,0.00044512068,0.0002189785,0.00017792525,0.00012576285],"domain_scores_gemma":[0.9995965,0.00008091697,0.000048097296,0.00019200293,0.000053920092,0.00002856644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003931778,0.00007777028,0.0001841418,0.00018471155,0.000052811007,0.00011169477,0.00020934199,0.000026142277,0.000039754148],"category_scores_gemma":[0.000008274449,0.00006095598,0.000036970207,0.00046340856,0.000010965721,0.00031291408,0.000091532005,0.0001805771,0.000034797766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010768731,0.00033638312,0.037857495,0.00006318062,0.00013161908,0.000040236955,0.042593703,0.74285305,0.00010724084,0.17117846,0.0037930151,0.0010348164],"study_design_scores_gemma":[0.0001948139,0.00055981276,0.0026516747,0.00006278052,0.0000036007327,0.000007092476,0.0032111865,0.99066824,0.000043804088,0.000069096655,0.0024499244,0.00007800538],"about_ca_topic_score_codex":0.00047115915,"about_ca_topic_score_gemma":0.0005502675,"teacher_disagreement_score":0.816446,"about_ca_system_score_codex":0.000060541515,"about_ca_system_score_gemma":0.000023573337,"threshold_uncertainty_score":0.24857126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063808416,0.00033242913,0.98628134,0.000103495135,0.0013678985,0.0035407736,0.0000075496773,0.0002910395,0.0016946354],"genre_scores_gemma":[0.9951265,0.0000047667368,0.0030806453,0.000057278332,0.00020683504,0.00096714526,6.8226484e-7,0.000017956974,0.00053821056],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986595,0.00021322616,0.00040022374,0.00038903984,0.00012711852,0.00021087383],"domain_scores_gemma":[0.99918514,0.00022523015,0.000075472344,0.00039159154,0.00006169676,0.00006086922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068613,0.00015632702,0.00026760984,0.00016704973,0.000051908766,0.00033746805,0.00045407878,0.00007826805,0.000009318179],"category_scores_gemma":[0.000011332169,0.00012617979,0.00008390138,0.00021896692,0.00005097222,0.00026913534,0.000055382137,0.00015869724,0.00007470721],"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.00009262631,0.00010613369,0.00015062974,0.0037814078,0.0003275653,0.00029308104,0.011097999,0.00027752534,0.7580316,0.09140665,0.09257155,0.0418632],"study_design_scores_gemma":[0.000967395,0.0012260509,0.00006352271,0.00859097,0.00002833059,0.0017320117,0.0007792162,0.33872044,0.5828839,0.0010552758,0.06309549,0.000857439],"about_ca_topic_score_codex":0.000029581453,"about_ca_topic_score_gemma":0.000004477729,"teacher_disagreement_score":0.9887456,"about_ca_system_score_codex":0.000059249713,"about_ca_system_score_gemma":0.000047378257,"threshold_uncertainty_score":0.5145462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025979917,0.00020800105,0.9613852,0.00082303194,0.00044431427,0.00023405773,4.3757467e-7,0.00014738324,0.010777661],"genre_scores_gemma":[0.95329773,0.000004242706,0.0461116,0.00017310046,0.000043096894,0.000019554514,0.0000022614295,0.000005076438,0.00034331338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991209,0.00013103805,0.00027116836,0.00020084991,0.00008298585,0.00019306343],"domain_scores_gemma":[0.99950194,0.00008209073,0.000035074725,0.0003284729,0.000030215428,0.000022212123],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013630596,0.000056912086,0.00008391297,0.00008709198,0.00017014876,0.0011389877,0.0006653629,0.000026664395,0.00007281499],"category_scores_gemma":[0.000011185223,0.00005128229,0.00002601554,0.00021763441,0.0000061217715,0.0012805377,0.0007483782,0.00009730091,0.000025349575],"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.0000037121788,0.00005553283,0.0036880863,0.000063689964,0.000036113415,0.000025560634,0.018155586,0.0056577804,0.0023408404,0.91650546,0.0041208137,0.04934683],"study_design_scores_gemma":[0.00010132699,0.0000064246065,0.000106327454,0.00019345133,0.0000011208851,0.000010901797,0.00034764968,0.98534757,0.0002106118,0.0048380718,0.008761229,0.00007533365],"about_ca_topic_score_codex":0.002960705,"about_ca_topic_score_gemma":0.0013634947,"teacher_disagreement_score":0.9796898,"about_ca_system_score_codex":0.00006990939,"about_ca_system_score_gemma":0.000028339324,"threshold_uncertainty_score":0.9998979},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02498586,0.00010365571,0.9719836,0.001143819,0.00057880883,0.00025443346,0.0000015293939,0.00078393356,0.00016432276],"genre_scores_gemma":[0.9983944,0.00010415185,0.001044774,0.00007966256,0.000028085797,0.00009255243,0.0000022258698,0.000020972033,0.00023316372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829537,0.000132793,0.0004180551,0.0005390693,0.00023467577,0.0003800438],"domain_scores_gemma":[0.99932075,0.000125531,0.00009427338,0.00031699482,0.00008308328,0.000059347338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048931997,0.00023427438,0.00031618707,0.0006588311,0.00030689753,0.00016488103,0.00026944923,0.00028030312,0.000014745339],"category_scores_gemma":[0.0000041757467,0.00021131508,0.000060233266,0.0006572454,0.00012830044,0.00032578918,0.00001186089,0.0008453954,0.00000980607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009256219,0.00009490711,0.00012663646,0.00020657983,0.00034455824,0.0007892284,0.0028529102,0.5134294,0.002659083,0.25632447,0.00003029538,0.22304937],"study_design_scores_gemma":[0.00041412405,0.00055416767,0.00002618649,0.00044357407,0.000022356453,0.00028791872,0.002031178,0.9887415,0.0058170967,0.00077385065,0.0005546793,0.00033334503],"about_ca_topic_score_codex":0.0002457089,"about_ca_topic_score_gemma":0.00027480812,"teacher_disagreement_score":0.9734086,"about_ca_system_score_codex":0.00017253152,"about_ca_system_score_gemma":0.00005292083,"threshold_uncertainty_score":0.86171794},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046522366,0.00059170264,0.9870826,0.00071427005,0.0042799953,0.0015546869,0.00036207872,0.0000537761,0.0007086348],"genre_scores_gemma":[0.9982773,0.0000041556905,0.0006205867,0.00006193284,0.00029817785,0.00025855185,0.000013321514,0.000009849006,0.00045613738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969044,0.00029766472,0.001000227,0.0006980059,0.00052777125,0.0005719823],"domain_scores_gemma":[0.9960797,0.0008163131,0.0006499104,0.0015877625,0.0007214757,0.00014484297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018670147,0.00037175033,0.00067393866,0.00029135754,0.00091879687,0.0008188401,0.002335286,0.00022952534,0.000006590666],"category_scores_gemma":[0.00009614382,0.00021421297,0.00052332337,0.0018270804,0.00023288536,0.000037806643,0.0003407899,0.00038294648,0.00001198516],"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.000020871981,0.000018679431,0.0001762569,0.000098184086,0.00070777046,0.000004613597,0.0009500848,0.8497115,0.0000018505319,0.14119896,0.0001286484,0.00698263],"study_design_scores_gemma":[0.00002000319,0.00008823421,0.00017568255,0.00030588947,0.0003626595,0.000012390836,0.00080070226,0.9958689,0.00006741175,0.0009401348,0.0011088037,0.0002491595],"about_ca_topic_score_codex":0.15382695,"about_ca_topic_score_gemma":0.6239799,"teacher_disagreement_score":0.99362504,"about_ca_system_score_codex":0.00014073864,"about_ca_system_score_gemma":0.00076262606,"threshold_uncertainty_score":0.8735351},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008055448,0.00041051075,0.9831081,0.0032789658,0.0020464542,0.00031225226,0.000002595806,0.00016189889,0.0026237692],"genre_scores_gemma":[0.99271625,0.000020465139,0.00065489113,0.00016963165,0.00023877448,0.00006132452,0.0000012831358,0.0000063665566,0.0061310157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923533,0.000040387822,0.0001818414,0.0002465221,0.0001055972,0.00019030353],"domain_scores_gemma":[0.99938923,0.00031386924,0.00002624304,0.00016989326,0.000059565707,0.00004119138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005885958,0.00008440988,0.0000840788,0.000024806806,0.00029105728,0.0007566041,0.00019209499,0.000037000067,0.0000064536603],"category_scores_gemma":[0.000015534328,0.000050758015,0.000043874,0.00009174616,0.000019401294,0.00014559473,0.000061755716,0.00006830659,0.00000910244],"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.000010013635,0.000010563172,0.00007179691,0.00006095018,0.000065316905,0.0000052009113,0.0020879065,0.00070533983,0.00004608541,0.6977982,0.03118856,0.2679501],"study_design_scores_gemma":[0.00014713992,0.000063003026,0.00011099701,0.00008434156,0.000004439409,0.00003011755,0.0009821878,0.9707464,0.00013205629,0.0007534175,0.026846033,0.000099870595],"about_ca_topic_score_codex":0.000047328467,"about_ca_topic_score_gemma":0.00016295479,"teacher_disagreement_score":0.9846608,"about_ca_system_score_codex":0.000028363467,"about_ca_system_score_gemma":0.00002795072,"threshold_uncertainty_score":0.72959507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01659122,0.000102759936,0.97596896,0.0006263432,0.0030378897,0.0001286018,0.0000016416097,0.00044678908,0.0030957775],"genre_scores_gemma":[0.96654177,0.000004542288,0.02476434,0.00020947185,0.0005297787,0.000034982793,0.0000016535721,0.000008079273,0.007905388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924785,0.0000108548165,0.00016893455,0.00024027989,0.0000891292,0.00024297093],"domain_scores_gemma":[0.999639,0.00007076141,0.0000160674,0.00019747182,0.000041410993,0.00003529174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003810749,0.00007679858,0.00009615289,0.000054682045,0.000100155965,0.0002515146,0.00024087758,0.000038033606,0.00003084249],"category_scores_gemma":[0.0000057438265,0.000058576163,0.000054566535,0.0002120949,0.0000033413314,0.00034466828,0.00006294377,0.0000689421,0.000092506605],"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.000004854313,0.000030114581,0.000075705706,0.00014514291,0.000039985684,0.000006070872,0.0015440393,0.00981248,0.0003097193,0.8952192,0.04020527,0.052607395],"study_design_scores_gemma":[0.00010050669,0.0000543523,0.000026250238,0.00005926954,0.0000017995908,0.00001425854,0.000027913235,0.9385911,0.0014979049,0.0002825213,0.059260115,0.00008397441],"about_ca_topic_score_codex":0.000012858587,"about_ca_topic_score_gemma":0.000015747213,"teacher_disagreement_score":0.95120466,"about_ca_system_score_codex":0.00002624752,"about_ca_system_score_gemma":0.000018578115,"threshold_uncertainty_score":0.2425361},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017283233,0.0033741759,0.9561255,0.00059906027,0.037520852,0.0004179883,0.000012975137,0.000059627884,0.00016148153],"genre_scores_gemma":[0.8381938,0.0001693944,0.15712409,0.00024038316,0.003964918,0.00002605929,0.0000025806003,0.00003969733,0.0002391158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969992,0.00021937623,0.0014339137,0.0002649432,0.0008558886,0.00022665113],"domain_scores_gemma":[0.99463254,0.0026930158,0.00081076956,0.0004751422,0.0013121597,0.00007638245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034290883,0.0002426834,0.00048626622,0.00029516753,0.00007683003,0.0007938691,0.0026912536,0.00007393473,0.000006303992],"category_scores_gemma":[0.00002555673,0.0001542858,0.00049935404,0.0002768268,0.00007302441,0.00048476647,0.00030971767,0.000236361,0.000007811698],"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.000031031275,0.00014335752,0.00001157833,0.00035135043,0.0011795089,0.000043670017,0.0035699767,0.033229634,0.00007919311,0.905991,0.027957158,0.027412517],"study_design_scores_gemma":[0.00038318252,0.00027743354,0.000012822605,0.0020854734,0.000042678003,0.0010030499,0.00009699543,0.9414219,0.000102399135,0.031405542,0.022995258,0.00017325125],"about_ca_topic_score_codex":0.0000041517765,"about_ca_topic_score_gemma":6.990331e-7,"teacher_disagreement_score":0.9081923,"about_ca_system_score_codex":0.00008317826,"about_ca_system_score_gemma":0.00011304029,"threshold_uncertainty_score":0.76552975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13244283,0.0003814763,0.8449157,0.00009549408,0.006672024,0.00046078104,0.0000069679136,0.00061680505,0.014407936],"genre_scores_gemma":[0.9970761,0.000013023356,0.0018328488,0.0002074916,0.00066846365,0.0000053150993,0.000019717658,0.000012050033,0.00016501397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807876,0.00015093155,0.00080019125,0.0001730209,0.00039402372,0.0004030432],"domain_scores_gemma":[0.9986968,0.00027092386,0.000396549,0.00030036634,0.00027846516,0.00005688152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575572,0.00018145122,0.00026682316,0.00018625017,0.0002421861,0.00059187855,0.00029831208,0.00019972584,0.000021101392],"category_scores_gemma":[0.00010370755,0.00016569442,0.00013143464,0.0010871701,0.000023862665,0.002462981,0.00008063281,0.00020725156,0.000093956194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002026259,0.0000096827725,0.000980258,0.00019208658,0.00010223788,0.0000022275065,0.0023025882,0.9044149,0.000025460246,0.07096279,0.0069755707,0.014011958],"study_design_scores_gemma":[0.00015175244,0.00011735613,0.0006598852,0.00081865565,0.000014137536,0.000014742599,0.000045777513,0.9814088,0.00009772659,0.0070015923,0.009483221,0.00018638128],"about_ca_topic_score_codex":0.00008184925,"about_ca_topic_score_gemma":0.000007439027,"teacher_disagreement_score":0.86463326,"about_ca_system_score_codex":0.0005784186,"about_ca_system_score_gemma":0.000096937336,"threshold_uncertainty_score":0.67568225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010761115,0.00066044135,0.9818124,0.0006345423,0.0045986795,0.00071948115,0.00000193461,0.00042284015,0.00038854918],"genre_scores_gemma":[0.99640393,0.00007050679,0.0023438921,0.00030017187,0.00048781434,0.00027684853,0.0000053759204,0.000027305055,0.00008414454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978427,0.00017343422,0.00042288328,0.0006196924,0.000541256,0.000399994],"domain_scores_gemma":[0.9991499,0.00020979074,0.000086451284,0.00034465423,0.00011884698,0.000090310765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013996147,0.00022485599,0.00017737287,0.0003235457,0.00050128845,0.00087294134,0.00021163751,0.00009063543,0.00005662697],"category_scores_gemma":[0.0000022975287,0.00021272888,0.0001126056,0.00074823335,0.000027724804,0.00056063716,0.0000027802769,0.00027973956,0.000027654878],"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.000033283985,0.000075059506,0.00003745934,0.00006537792,0.00011901508,0.0000061358787,0.00060622365,0.2133389,0.0004935016,0.0021167824,0.00043030674,0.78267795],"study_design_scores_gemma":[0.0007682334,0.00024893563,0.000016863536,0.0005515946,0.000057476605,0.00001093099,0.00018907401,0.98249394,0.0040117353,0.0005931726,0.010797049,0.000261021],"about_ca_topic_score_codex":0.00007103668,"about_ca_topic_score_gemma":0.00012734115,"teacher_disagreement_score":0.98564285,"about_ca_system_score_codex":0.00022456406,"about_ca_system_score_gemma":0.00012328931,"threshold_uncertainty_score":0.86748314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39697754,0.05596901,0.5137274,0.009132031,0.018866673,0.0003317559,9.740118e-7,0.00008945048,0.0049050963],"genre_scores_gemma":[0.998952,0.00038575803,0.000006637412,0.00006540432,0.00013101398,9.72985e-7,2.6414215e-8,0.0000073996925,0.00045082104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868345,0.0001920322,0.00038010598,0.00008560169,0.000382623,0.00027615664],"domain_scores_gemma":[0.999006,0.00020358476,0.00020619883,0.00036058744,0.00019465486,0.000028989589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014361773,0.00008690368,0.00017046716,0.00008066779,0.00009183996,0.00008555874,0.001360765,0.00004333538,0.000004597553],"category_scores_gemma":[0.000031819516,0.000042031512,0.00024349119,0.0008170176,0.000039629085,0.00018991792,0.00008951074,0.0005854988,0.0000039185406],"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.0000043178907,0.000021957147,0.000042330183,0.0000101562255,0.00007105881,0.0000032394687,0.0003990108,0.0001885426,0.00033232145,0.99564314,0.002193091,0.0010908614],"study_design_scores_gemma":[0.00034258512,0.0005281195,0.00033305347,0.00018106494,0.000042908938,0.0011527579,0.00012601409,0.02128077,0.00333795,0.9358885,0.036656894,0.00012936501],"about_ca_topic_score_codex":0.000008435213,"about_ca_topic_score_gemma":0.0000048309735,"teacher_disagreement_score":0.6019744,"about_ca_system_score_codex":0.00012591269,"about_ca_system_score_gemma":0.00035775994,"threshold_uncertainty_score":0.25437337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54750836,0.04879094,0.23087697,0.019189421,0.049906444,0.0025947704,0.00002645991,0.0020388064,0.09906786],"genre_scores_gemma":[0.9872429,0.0015264171,0.000102654594,0.00023371195,0.0010147638,0.000028320312,0.0000075227745,0.000055354954,0.009788359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947695,0.00037558345,0.00079428824,0.0008484006,0.00053729076,0.0026748958],"domain_scores_gemma":[0.99858165,0.00010595347,0.00032616156,0.00072454894,0.00013309556,0.00012859024],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003060295,0.00046424608,0.0005521328,0.00094263756,0.00017822729,0.0010269709,0.0016759221,0.0004557011,0.000057571553],"category_scores_gemma":[0.000034256496,0.00040799766,0.00044209606,0.00068532745,0.000036080117,0.00015871969,0.0007297143,0.012036418,0.0009464352],"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.00005131791,0.00012511901,0.00005747176,0.000051799372,0.00040191918,0.00014332889,0.0006236964,0.004199754,0.0000808238,0.9690933,0.00533095,0.01984047],"study_design_scores_gemma":[0.00044795475,0.00045138918,0.00003388855,0.00070780684,0.000022451408,0.0014043272,0.00012014088,0.08683024,0.000030370138,0.9038441,0.0055686207,0.00053868437],"about_ca_topic_score_codex":0.00019714236,"about_ca_topic_score_gemma":0.00074148865,"teacher_disagreement_score":0.43973458,"about_ca_system_score_codex":0.0021243833,"about_ca_system_score_gemma":0.0031920671,"threshold_uncertainty_score":0.99983716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028401256,0.000106229134,0.9694152,0.00025535555,0.00062743254,0.0000984088,0.00004386369,0.00008149434,0.00097079534],"genre_scores_gemma":[0.9873055,0.000011422532,0.011909441,0.000057767087,0.00014732563,0.00000414329,0.00006794764,0.0000036390404,0.00049277785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919987,0.00001733973,0.00024023748,0.00029870984,0.00011663338,0.00012724017],"domain_scores_gemma":[0.9991399,0.00011500959,0.00003926331,0.00063288625,0.000042622498,0.000030303021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765963,0.000067907866,0.0001868061,0.00019325699,0.000040292078,0.00012075776,0.0008795271,0.00006133054,0.000022341956],"category_scores_gemma":[0.00000615392,0.00004897577,0.00009840928,0.00055462535,0.000013108781,0.0003472867,0.00018203356,0.000076945216,0.0000030451913],"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.000035220448,0.000050241455,0.08164453,0.0008489084,0.010947037,0.00000583086,0.0028291845,0.0794908,0.00022812418,0.38781813,0.11473577,0.32136622],"study_design_scores_gemma":[0.000048025162,0.000034031564,0.005506779,0.000016823024,0.00011274172,6.609915e-7,0.00001486026,0.982376,0.000053483745,0.00015829566,0.011615469,0.00006282114],"about_ca_topic_score_codex":0.00004987029,"about_ca_topic_score_gemma":0.00003285175,"teacher_disagreement_score":0.95890427,"about_ca_system_score_codex":0.000010722094,"about_ca_system_score_gemma":0.00001879402,"threshold_uncertainty_score":0.19971739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8711174,0.0042820955,0.042707715,0.0014999537,0.050317973,0.00049009174,0.00000839552,0.0010371013,0.028539265],"genre_scores_gemma":[0.9986007,0.000029076362,0.00034802489,0.00011281819,0.000065507964,0.000018954128,0.0000016941791,0.000016420046,0.0008067643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998383,0.00010891853,0.00044543654,0.00043163123,0.00032476423,0.00030626162],"domain_scores_gemma":[0.9989027,0.00018565835,0.00007981221,0.00060512306,0.00013404919,0.00009267339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004503435,0.00017782293,0.00030498448,0.00014138047,0.000099306635,0.0002132843,0.0007302573,0.00010956254,0.000029619672],"category_scores_gemma":[0.000030276433,0.00015493689,0.00017233007,0.00060711184,0.0000485897,0.00042322208,0.0001821772,0.00022498924,0.00014647409],"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.0000038848407,0.000068098125,0.00027713517,0.00007477009,0.00005017061,0.00003349607,0.00084429875,0.000106426276,0.0004901395,0.9754847,0.017929016,0.004637855],"study_design_scores_gemma":[0.00078776927,0.00038924292,0.0012299112,0.000687939,0.000029896528,0.00011921236,0.00011133331,0.46751025,0.008927081,0.41523248,0.10433552,0.0006393683],"about_ca_topic_score_codex":0.00012944898,"about_ca_topic_score_gemma":0.000010328231,"teacher_disagreement_score":0.56025225,"about_ca_system_score_codex":0.000059046513,"about_ca_system_score_gemma":0.000073678486,"threshold_uncertainty_score":0.6318143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37784997,0.0021587424,0.5702288,0.00037401795,0.047519244,0.00036755786,0.0000022696713,0.00015747796,0.0013419145],"genre_scores_gemma":[0.98657143,0.00003754924,0.011986073,0.00002132996,0.0013441234,0.0000022710763,9.90723e-7,0.000028761724,0.000007473475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966712,0.00019139078,0.0016986185,0.0003135418,0.0007795073,0.00034573002],"domain_scores_gemma":[0.99700767,0.0008466017,0.00094843225,0.0003651213,0.0006308545,0.0002012978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020820869,0.00031169772,0.0008987094,0.00045915396,0.00023944779,0.00065651676,0.0007982993,0.00017821524,0.000004900541],"category_scores_gemma":[0.00013207615,0.00026660503,0.0003766777,0.00070281327,0.000099624485,0.0005778624,0.00035089478,0.00050525035,0.0000056226204],"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.00003541409,0.00024158531,0.000028131662,0.00045999198,0.00017823347,0.00006594146,0.002930722,0.000111309295,0.0021122114,0.9883534,0.0005294196,0.00495366],"study_design_scores_gemma":[0.001831709,0.0012759618,0.000036540067,0.0016828579,0.00008620639,0.0005379302,0.00016144422,0.20265538,0.0009446887,0.7886471,0.0018017858,0.00033839417],"about_ca_topic_score_codex":0.000027219376,"about_ca_topic_score_gemma":0.00000180206,"teacher_disagreement_score":0.60872144,"about_ca_system_score_codex":0.00010365612,"about_ca_system_score_gemma":0.00015150504,"threshold_uncertainty_score":0.9999786},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12269267,0.0025565173,0.85887635,0.011527797,0.0038103247,0.000063146734,4.6195308e-7,0.0001722345,0.00030048093],"genre_scores_gemma":[0.98484963,0.00008855972,0.014434282,0.00022248457,0.0002737343,0.0000014120042,6.990585e-8,0.000005201439,0.00012460935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984525,0.000025717185,0.00043504138,0.0003556091,0.00040513766,0.00032599916],"domain_scores_gemma":[0.9989652,0.000053311076,0.00017126865,0.00027479438,0.00043439455,0.00010100482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014140086,0.000120700985,0.00023346441,0.00091328495,0.00021343437,0.0006669146,0.0012500088,0.00007700244,0.0000035183602],"category_scores_gemma":[0.00003657335,0.00009129779,0.000053715663,0.0016608904,0.0003134765,0.0011303972,0.00035386774,0.00040070032,0.000009996079],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027789977,0.000049164322,0.00016743343,0.000041487914,0.00005032284,0.00038612218,0.00080023514,0.00014751674,0.013726539,0.08681196,0.059063375,0.83875304],"study_design_scores_gemma":[0.00029335113,0.00089515175,0.000076830605,0.000535663,0.000013128811,0.012546745,0.00006717357,0.8108593,0.0106861815,0.023377864,0.1403098,0.00033876224],"about_ca_topic_score_codex":0.000008514768,"about_ca_topic_score_gemma":4.7052808e-7,"teacher_disagreement_score":0.862157,"about_ca_system_score_codex":0.00008357796,"about_ca_system_score_gemma":0.0002522169,"threshold_uncertainty_score":0.64310735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023473011,0.0002770777,0.9480725,0.00029076883,0.024962964,0.00023347957,0.0000016473704,0.0001198009,0.0025687446],"genre_scores_gemma":[0.93111485,0.000017024853,0.06621441,0.00070769945,0.0015758984,0.000012130114,0.0000016341062,0.000025968226,0.0003303654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961728,0.0005483546,0.0017506512,0.00036411916,0.00084195146,0.00032214864],"domain_scores_gemma":[0.99577665,0.0016890729,0.000951658,0.0005029146,0.0009830319,0.000096657386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024296842,0.00032274288,0.0006965225,0.001432872,0.00007920858,0.0007056542,0.002444328,0.00014373586,0.000007553816],"category_scores_gemma":[0.00007477655,0.00026723195,0.00030752816,0.0005545792,0.00004608549,0.00050138833,0.000418765,0.00048545902,0.000020287609],"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.00004886797,0.0003960129,0.00016072275,0.00008556484,0.00040910603,0.00018161151,0.0014640779,0.036726397,0.00003206204,0.9345823,0.0054001985,0.020513086],"study_design_scores_gemma":[0.0014284388,0.00020259425,0.00043088678,0.0032288122,0.000014520585,0.0008375004,0.00007124393,0.90087146,0.000048501544,0.09055754,0.0020189115,0.00028958998],"about_ca_topic_score_codex":0.000009158715,"about_ca_topic_score_gemma":0.0000022568352,"teacher_disagreement_score":0.9076418,"about_ca_system_score_codex":0.00022735968,"about_ca_system_score_gemma":0.00012559835,"threshold_uncertainty_score":0.999978},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.0029026e-8,0.00027335435,0.00087147235,0.00020267333,0.00005514668,0.00036029768,0.00001964508,0.00040913682,0.9978082],"genre_scores_gemma":[0.0000031330862,5.973152e-7,0.00039008775,0.00012223754,0.001050252,0.000023160059,0.000019071222,0.0000704473,0.998321],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977275,0.000041808973,0.00054027553,0.0007912535,0.0004560827,0.00044307433],"domain_scores_gemma":[0.99817497,0.000085713174,0.0001813667,0.0011588014,0.00014439427,0.00025475846],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027283304,0.00047379942,0.000558376,0.00029179628,0.00015151652,0.00031434608,0.0013501216,0.00040244078,0.9859563],"category_scores_gemma":[0.000008832718,0.00046335222,0.00029245735,0.00009728812,0.00003815769,0.00021167818,0.00028571248,0.00041840057,0.9951956],"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.000014488101,0.0000104313485,1.1906222e-9,0.000009775394,0.000051626317,0.000032278123,0.000023421346,0.000114578135,8.860779e-7,0.0057017584,0.49901485,0.4950259],"study_design_scores_gemma":[0.00012968623,0.00019922903,1.2285197e-7,0.00020693435,0.000016097387,0.00007957469,1.5266497e-7,0.0027535202,0.0000033327499,0.0010185376,0.9950418,0.0005510312],"about_ca_topic_score_codex":0.000024634652,"about_ca_topic_score_gemma":9.081501e-7,"teacher_disagreement_score":0.49602693,"about_ca_system_score_codex":0.00012384269,"about_ca_system_score_gemma":0.000081522034,"threshold_uncertainty_score":0.99978185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016126742,0.00011733614,0.9924869,0.0004960706,0.003488322,0.0003095801,0.0000014679863,0.00040833486,0.001079341],"genre_scores_gemma":[0.90042484,0.0000024571073,0.09809228,0.0002908823,0.00065632904,0.000040166215,0.0000035614933,0.000013252938,0.00047625526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987675,0.00005215174,0.00035362682,0.0004026411,0.000103590064,0.00032047703],"domain_scores_gemma":[0.99899983,0.00053998013,0.00003470466,0.00031304173,0.00005852803,0.000053881795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053566496,0.00012533885,0.00016668928,0.00016359822,0.00011330268,0.00057603105,0.00049590616,0.00007145604,0.000007302014],"category_scores_gemma":[0.000017735856,0.000109856344,0.0001013625,0.00044356566,0.0000123302425,0.0004017079,0.00019530058,0.00014836021,0.00001830068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024881565,0.000026522024,0.0003889051,0.00003904925,0.000024603121,0.000020103287,0.00086671097,0.55861604,0.000007705234,0.35664386,0.011945791,0.07141821],"study_design_scores_gemma":[0.00025807146,0.000041253184,0.00013907319,0.00019497391,0.0000023204368,0.000023165843,0.00002902938,0.99620306,0.000009037535,0.0017125866,0.001244011,0.00014340204],"about_ca_topic_score_codex":0.000079572324,"about_ca_topic_score_gemma":0.00015434716,"teacher_disagreement_score":0.8988121,"about_ca_system_score_codex":0.00006942691,"about_ca_system_score_gemma":0.000026462229,"threshold_uncertainty_score":0.5554681},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009010795,0.00018374629,0.9714018,0.00044825333,0.012232334,0.0008846977,0.00009104966,0.00064556446,0.005101742],"genre_scores_gemma":[0.98830044,0.000015701418,0.0010921708,0.00032274655,0.0002721707,0.0003571529,0.000010947917,0.000029009778,0.009599666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965534,0.0005289083,0.00092710013,0.00085166225,0.00055534753,0.0005835684],"domain_scores_gemma":[0.9979511,0.00026306164,0.00022067875,0.0010437046,0.00035437127,0.00016707943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006554694,0.00044733856,0.00055350736,0.0007099768,0.0007005922,0.00069949246,0.00084049033,0.00032330357,0.000051496412],"category_scores_gemma":[0.000015823443,0.00038577252,0.0003893874,0.0009833043,0.00005620495,0.00047302316,0.0000050898557,0.0006804124,0.00019137526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051063614,0.0032386933,0.0005396813,0.0011975844,0.0017646742,0.000111237365,0.018819872,0.6846668,0.053261124,0.069411576,0.04549623,0.12098187],"study_design_scores_gemma":[0.0022128145,0.00041305233,0.00039523712,0.0020705129,0.000091881564,0.00023011703,0.0034651936,0.8792476,0.05906247,0.00044142763,0.051136862,0.001232813],"about_ca_topic_score_codex":0.00046243376,"about_ca_topic_score_gemma":0.0016803595,"teacher_disagreement_score":0.97928965,"about_ca_system_score_codex":0.00030957433,"about_ca_system_score_gemma":0.00015170347,"threshold_uncertainty_score":0.9998594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083105616,0.00019597821,0.9116311,0.00007777186,0.00071465777,0.00012396925,0.000007850263,0.000086771004,0.0040562726],"genre_scores_gemma":[0.9988975,0.0000029537748,0.000676713,0.00003117799,0.00003077706,0.0000032999096,0.0000025235681,0.0000041020658,0.0003509436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915284,0.000019662839,0.00024586773,0.00026842018,0.00016360717,0.00014963212],"domain_scores_gemma":[0.9996041,0.000050164515,0.00004752242,0.0001679278,0.0000850605,0.000045202145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021376227,0.00009274929,0.00012239967,0.00005466874,0.00006207958,0.00022664304,0.00013750576,0.000040826424,0.000012385993],"category_scores_gemma":[0.000008804496,0.000069324306,0.000051742983,0.00028758598,0.0000354381,0.00035224025,0.00012109855,0.000058862803,0.0000043569876],"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.000037719994,0.00033467924,0.000486196,0.00021485005,0.0002362587,0.000054019114,0.0024214718,0.002458028,0.028323563,0.83183223,0.004304754,0.12929621],"study_design_scores_gemma":[0.00016961344,0.00042935708,0.0006438441,0.00016282346,0.000007805701,0.000042285716,0.00011707062,0.9923785,0.003151736,0.0006681906,0.0020796307,0.00014914392],"about_ca_topic_score_codex":0.00005737482,"about_ca_topic_score_gemma":0.0000071521713,"teacher_disagreement_score":0.9899205,"about_ca_system_score_codex":0.00006751738,"about_ca_system_score_gemma":0.00004458362,"threshold_uncertainty_score":0.2826963},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081127256,0.003525572,0.89678824,0.0019880626,0.013124307,0.0012044951,0.00031294185,0.00014247405,0.0017866499],"genre_scores_gemma":[0.9708089,0.00010303811,0.015226041,0.0006278046,0.0010636494,0.000021625876,0.000005182715,0.000058962854,0.012084798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465936,0.001173978,0.0019965393,0.0005354257,0.0008325071,0.0008021718],"domain_scores_gemma":[0.99462515,0.001052219,0.0015377266,0.00064245454,0.0018745379,0.00026790786],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026636997,0.00049760804,0.0011815401,0.0005240751,0.00063278124,0.0011068647,0.0009147961,0.0003027767,0.00020321453],"category_scores_gemma":[0.00036256833,0.0004668468,0.0007490802,0.0006818892,0.0003525271,0.000913707,0.00007900002,0.000506211,0.00004149482],"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.0028663527,0.0013533811,0.008908472,0.007655196,0.003440026,0.0005152386,0.00408982,0.2519434,0.021166263,0.2048737,0.16493848,0.32824966],"study_design_scores_gemma":[0.0057428577,0.0010751318,0.021469016,0.0035022248,0.00022081417,0.00029485367,0.00010404406,0.9423541,0.0019051004,0.0041910894,0.018710384,0.0004303983],"about_ca_topic_score_codex":0.00007310745,"about_ca_topic_score_gemma":0.00003518042,"teacher_disagreement_score":0.88968164,"about_ca_system_score_codex":0.00075428706,"about_ca_system_score_gemma":0.0008561472,"threshold_uncertainty_score":0.9999301},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88493013,0.00044838485,0.05730965,0.00015710422,0.0013894944,0.0001764417,3.4552116e-7,0.000093453404,0.05549499],"genre_scores_gemma":[0.99834126,0.000016449141,0.0010934104,0.00007273836,0.00011571146,0.000008680711,6.7224e-7,0.0000030582626,0.00034803074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926835,0.000046787576,0.00016705476,0.00020222068,0.00022775534,0.00008781767],"domain_scores_gemma":[0.99963623,0.0000790218,0.00003342814,0.00015353199,0.0000766407,0.000021169519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007260884,0.000060844228,0.00007942223,0.000083936706,0.000046962337,0.00013309627,0.000112852766,0.000030392644,0.00008071554],"category_scores_gemma":[0.0000069516695,0.000044852302,0.000024348741,0.0001762935,0.000010777362,0.00033452653,0.000041446587,0.00004916217,0.000011833928],"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.000013551697,0.000044620607,0.002862586,0.00036387393,0.00008949509,0.0000047200583,0.0075286604,0.011279789,0.0016256066,0.14025655,0.006027741,0.8299028],"study_design_scores_gemma":[0.00005958014,0.000089913185,0.0016439289,0.00018960627,0.0000042057172,0.000009110179,0.00006244621,0.99487257,0.0005221651,0.00012315396,0.0023637968,0.000059533086],"about_ca_topic_score_codex":0.000013445436,"about_ca_topic_score_gemma":0.0000136589115,"teacher_disagreement_score":0.98359275,"about_ca_system_score_codex":0.000019748815,"about_ca_system_score_gemma":0.000024296736,"threshold_uncertainty_score":0.18290238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9301136,0.0002005824,0.0017059013,0.001217237,0.022726044,0.0003107381,0.000004341645,0.00016485881,0.043556668],"genre_scores_gemma":[0.9950798,0.000030502524,0.00011602313,0.00015318858,0.000008321339,0.000016410873,0.0000011268014,0.0000065661025,0.0045880335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987091,0.00017373332,0.00039805367,0.00026474893,0.0002123191,0.00024208507],"domain_scores_gemma":[0.99855274,0.0003061781,0.00023744484,0.0005375001,0.00032486935,0.000041263585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735978,0.00012708768,0.00020741328,0.000071409675,0.00040566013,0.00010775868,0.00060617056,0.00012313917,0.000020647552],"category_scores_gemma":[0.00010973557,0.00009860489,0.00012386848,0.0009227699,0.0000739142,0.00018292463,0.00020642945,0.00014719831,0.000039401995],"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.000010436155,0.00003212177,0.030977102,0.000007924037,0.00011342556,0.0000018209596,0.00017977017,0.0000035500943,0.000109463384,0.91284627,0.04263986,0.013078255],"study_design_scores_gemma":[0.0018408854,0.00010414035,0.028507108,0.00027709658,0.0000358608,0.00006970337,0.00015220468,0.02992137,0.0031790691,0.921807,0.013729848,0.0003757058],"about_ca_topic_score_codex":0.00016192075,"about_ca_topic_score_gemma":0.00011686007,"teacher_disagreement_score":0.0649662,"about_ca_system_score_codex":0.00013503425,"about_ca_system_score_gemma":0.00006504069,"threshold_uncertainty_score":0.40209907},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009553361,0.0008650206,0.9957238,0.0009868715,0.0006310736,0.0002911687,8.855995e-7,0.00010333621,0.00044250433],"genre_scores_gemma":[0.6494267,0.000025725163,0.34990767,0.0004064512,0.000055431075,0.0001005625,0.000002832663,0.000005658244,0.00006899392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987603,0.00015061567,0.0004222104,0.0003303424,0.00006893531,0.00026760466],"domain_scores_gemma":[0.99754506,0.0008905197,0.00010135852,0.0012558879,0.00016196312,0.00004523551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077254226,0.0001312383,0.00019241171,0.00017839964,0.0004934112,0.00047834634,0.001402035,0.000089721194,4.7773216e-7],"category_scores_gemma":[0.000028286811,0.00013481434,0.00006057905,0.000528342,0.00006593635,0.00016314271,0.0011053303,0.00018833489,8.136505e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003529441,0.0000785111,0.00034697124,0.0000063794273,0.000017057204,2.2829559e-7,0.0002873781,0.5209474,0.000042300682,0.4632412,0.00020409013,0.01482493],"study_design_scores_gemma":[0.00048668456,0.000022353934,0.0009318202,0.00016076707,0.0000037008513,0.0000079791935,0.000016567856,0.99528235,0.000020960713,0.0008599834,0.0020779567,0.000128873],"about_ca_topic_score_codex":0.00007145611,"about_ca_topic_score_gemma":0.000060132723,"teacher_disagreement_score":0.64847136,"about_ca_system_score_codex":0.000064400796,"about_ca_system_score_gemma":0.000060192233,"threshold_uncertainty_score":0.54975694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115483664,0.00018271916,0.87809867,0.00044867053,0.0022939113,0.00022574452,0.000008914274,0.0002396401,0.0030180723],"genre_scores_gemma":[0.981625,0.000020876629,0.017371716,0.00018127762,0.00045166252,0.0000031205695,0.00001834193,0.000019977067,0.00030798122],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973499,0.00033128713,0.00052989303,0.00071678084,0.00043985865,0.0006322648],"domain_scores_gemma":[0.99706596,0.00040450296,0.00045718634,0.0005882449,0.0012313833,0.0002527198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074927555,0.0003013977,0.00044962,0.00059185567,0.0006734767,0.0002720994,0.00090306514,0.000162537,0.000056350804],"category_scores_gemma":[0.00011887611,0.0003143907,0.00019643607,0.0021680326,0.00025682428,0.0008386745,0.0003244917,0.00023299696,0.000052385156],"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.0013561022,0.0015451007,0.055416703,0.00039027323,0.0021244977,0.00063959573,0.025066037,0.24200463,0.011461456,0.2021344,0.3390249,0.118836306],"study_design_scores_gemma":[0.0011329543,0.0006555028,0.008001104,0.000085997744,0.000053211083,0.00025591522,0.00022450206,0.9724583,0.0012506923,0.00060974504,0.014830119,0.00044197595],"about_ca_topic_score_codex":0.00020148262,"about_ca_topic_score_gemma":0.00013518767,"teacher_disagreement_score":0.8661414,"about_ca_system_score_codex":0.00019453837,"about_ca_system_score_gemma":0.00017921055,"threshold_uncertainty_score":0.9999308},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018836748,0.000045159755,0.9720855,0.0014293113,0.0010223977,0.00018182794,2.3969866e-7,0.00018179482,0.0062170303],"genre_scores_gemma":[0.99380803,0.000002515418,0.003499605,0.00019872955,0.00007356463,0.000031887346,0.0000010662068,0.000002817276,0.0023817818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933994,0.000050056467,0.00015977291,0.00026046654,0.00008427978,0.00010550953],"domain_scores_gemma":[0.9995133,0.00006983388,0.0000455577,0.0002823416,0.000057956015,0.0000309709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015089165,0.00007481559,0.000088125846,0.00014693673,0.000114670234,0.000118157805,0.00014580297,0.00004903741,0.000005182168],"category_scores_gemma":[0.000018287004,0.00006243369,0.000028427772,0.00027656596,0.000015057377,0.00010670445,0.00001740651,0.00006320607,0.000038170663],"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.000034243545,0.000108730084,0.00040415567,0.00010348536,0.00003001067,0.0000012726306,0.00023411929,0.010915866,0.013980363,0.94279385,0.009543592,0.021850344],"study_design_scores_gemma":[0.0005950778,0.00013582813,0.0022575534,0.00020314436,0.0000091172005,0.00002323705,0.00007871746,0.9753173,0.0086778365,0.0023005747,0.010202937,0.00019869016],"about_ca_topic_score_codex":0.000051728784,"about_ca_topic_score_gemma":0.000008505514,"teacher_disagreement_score":0.9749713,"about_ca_system_score_codex":0.000047895148,"about_ca_system_score_gemma":0.000026112777,"threshold_uncertainty_score":0.2545972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011790646,0.0024115958,0.9700229,0.007048804,0.009043184,0.00012152443,0.0000017342611,0.000037561833,0.010133603],"genre_scores_gemma":[0.9895906,0.00009283591,0.008197478,0.0010350134,0.00043339783,0.000012344154,0.0000033908277,0.000005661594,0.000629312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800646,0.00033413057,0.0009543925,0.00012860025,0.0004246864,0.00015169926],"domain_scores_gemma":[0.99668866,0.00044451875,0.0008090934,0.00063479546,0.0013703819,0.000052551422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948958,0.000110947956,0.0002674624,0.00032522928,0.00011940504,0.00036285966,0.003028292,0.000087835375,0.000012355525],"category_scores_gemma":[0.00008362589,0.00009852158,0.00015679581,0.00032685173,0.000047037713,0.0004210037,0.0002508349,0.00026168287,0.000012922906],"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.00007046973,0.00018460174,0.0020686197,0.0000073498445,0.00040671477,0.000011759007,0.00027215824,0.13690715,0.00039856014,0.8225834,0.032743756,0.0043454976],"study_design_scores_gemma":[0.002148314,0.00012014156,0.0016975065,0.0011230231,0.000022508904,0.00048334769,0.000297969,0.44433188,0.00022056817,0.0037300687,0.5455891,0.00023557685],"about_ca_topic_score_codex":0.000118585755,"about_ca_topic_score_gemma":0.000027051525,"teacher_disagreement_score":0.9884115,"about_ca_system_score_codex":0.00018871391,"about_ca_system_score_gemma":0.00020106028,"threshold_uncertainty_score":0.56273705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022227291,0.00003465549,0.8315001,0.0012322937,0.0005740511,0.000121249584,4.0393715e-7,0.0002610912,0.14404882],"genre_scores_gemma":[0.98946387,0.0000010300439,0.0023307267,0.000509985,0.000030108444,0.0000073207316,0.0000012236877,0.000002611237,0.007653104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929726,0.0000441179,0.00014074569,0.00024104162,0.000105785024,0.00017106181],"domain_scores_gemma":[0.9994466,0.00003614113,0.000029265444,0.0003731258,0.00007739844,0.000037484133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013947062,0.00008767435,0.00012839795,0.000056312783,0.00010882687,0.00017308188,0.00036832428,0.000039524617,0.00003927828],"category_scores_gemma":[0.000002517487,0.00005641982,0.00003334377,0.00041477772,0.000020158937,0.00022484983,0.0001023524,0.00008285365,0.000034683344],"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.000022475653,0.00005974633,0.0051317415,0.00002620225,0.000072943476,0.000013555231,0.00033346046,0.002692353,0.000106685446,0.95278233,0.037442606,0.0013158883],"study_design_scores_gemma":[0.000404932,0.00009002075,0.001610779,0.00007833616,0.000004173881,0.000013228195,0.000056969202,0.9646735,0.001149596,0.006009727,0.02573897,0.00016972818],"about_ca_topic_score_codex":0.00021330992,"about_ca_topic_score_gemma":0.00014232416,"teacher_disagreement_score":0.9672366,"about_ca_system_score_codex":0.000024737537,"about_ca_system_score_gemma":0.000031455183,"threshold_uncertainty_score":0.23007335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020217514,0.0009803999,0.9747488,0.0016495198,0.0006606376,0.00012892025,0.0000010884875,0.00006601644,0.019742876],"genre_scores_gemma":[0.98365825,0.00013064437,0.015411838,0.0002918913,0.000021421298,0.000040160172,0.000014325364,0.0000020965253,0.0004293817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999139,0.00025548597,0.00033259887,0.00014225562,0.000023478588,0.00010714127],"domain_scores_gemma":[0.997669,0.0003395307,0.00011023775,0.0016863736,0.00017900315,0.000015900669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031612004,0.00006659507,0.0001432484,0.00012312616,0.00012512255,0.000024549201,0.0015608224,0.00010472415,0.0000068767604],"category_scores_gemma":[0.00007119093,0.000057210367,0.00005673586,0.00039174088,0.00011215253,0.000094345545,0.00037992478,0.00014517675,0.000008929844],"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.000002359234,0.00004196913,0.0016758896,0.0000023851642,0.000019758034,4.2401602e-8,0.0001659342,0.00019616666,0.00075764727,0.9331811,0.0016770089,0.062279735],"study_design_scores_gemma":[0.00019601484,0.00005461497,0.0026623358,0.000058154154,0.0000063851303,0.0000032854525,0.000083168066,0.9216666,0.00081035926,0.006278031,0.06808278,0.00009823591],"about_ca_topic_score_codex":0.000106135194,"about_ca_topic_score_gemma":0.00019940954,"teacher_disagreement_score":0.98163646,"about_ca_system_score_codex":0.00002764668,"about_ca_system_score_gemma":0.000036607093,"threshold_uncertainty_score":0.29004222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064515267,0.0023429357,0.9892216,0.00057810295,0.00019212937,0.00007899428,0.0000016218702,0.00000885068,0.0011242721],"genre_scores_gemma":[0.9557125,0.0006525176,0.04294762,0.00015114273,0.00020084297,0.000016854827,3.6090626e-7,0.000003565279,0.00031461427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993982,0.000016988719,0.0003334423,0.00008517884,0.00009644227,0.000069799804],"domain_scores_gemma":[0.9993371,0.000054925084,0.00018122105,0.0001518882,0.00023575034,0.000039114955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020838101,0.000053152256,0.0001518013,0.00018535614,0.00008482754,0.000048053767,0.00025691724,0.000032173368,0.0000024386172],"category_scores_gemma":[0.000005595731,0.000041355925,0.00008176169,0.0004239293,0.00004271199,0.00015019583,0.000040706578,0.00008593594,5.9851925e-7],"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.0000035905166,0.00012379227,0.0010252832,0.00003842445,0.00010309586,0.0000015149951,0.00016022281,0.00008943706,0.0019475342,0.5727456,0.0027496638,0.42101184],"study_design_scores_gemma":[0.001547764,0.00041671167,0.0077353576,0.00046426995,0.00009897386,0.0005199153,0.0009373401,0.05073174,0.008214965,0.10770752,0.8212315,0.00039393405],"about_ca_topic_score_codex":0.000007678017,"about_ca_topic_score_gemma":8.908151e-7,"teacher_disagreement_score":0.94926095,"about_ca_system_score_codex":0.000006245716,"about_ca_system_score_gemma":0.00003428754,"threshold_uncertainty_score":0.16864456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049251236,0.00083326286,0.9468481,0.00030148323,0.0017279747,0.0001729523,9.878368e-7,0.00025362297,0.000610385],"genre_scores_gemma":[0.9949535,0.000013643146,0.0029397423,0.00010159304,0.00012431582,0.000033284974,0.000004691199,0.000009233432,0.0018200114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990131,0.000040615127,0.0003069707,0.00032274623,0.00019447044,0.000122044185],"domain_scores_gemma":[0.9993817,0.00003759737,0.000066850735,0.0002831045,0.00019183606,0.00003887432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016047302,0.00012315212,0.00014296536,0.0001726719,0.000057638197,0.000203099,0.00034527786,0.00008319216,0.00003928051],"category_scores_gemma":[0.000013766967,0.0000859047,0.00008864959,0.00059477007,0.000027986647,0.0006360943,0.000038172006,0.000098854325,0.000015360785],"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.000022536598,0.00012082179,0.0005725708,0.000989477,0.00017716369,0.000007469554,0.02698645,0.0012804453,0.43839467,0.42727008,0.0036702594,0.10050805],"study_design_scores_gemma":[0.00019452379,0.000085055806,0.00036198914,0.0002145244,0.0000114095965,0.00003186086,0.00048985047,0.56793827,0.42459184,0.0030821175,0.0027468277,0.00025175395],"about_ca_topic_score_codex":0.00019571143,"about_ca_topic_score_gemma":0.00014118143,"teacher_disagreement_score":0.94570225,"about_ca_system_score_codex":0.000020674417,"about_ca_system_score_gemma":0.000029094372,"threshold_uncertainty_score":0.3503092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8864868,0.00070891436,0.09735316,0.00019515236,0.014560826,0.00019599551,6.514238e-7,0.00003137856,0.000467111],"genre_scores_gemma":[0.98567384,0.000070912116,0.0139571,0.00002667793,0.00025620125,0.000001088262,3.3053115e-7,0.000010110657,0.0000037335317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997858,0.00015026415,0.0011845835,0.00021167478,0.0003891478,0.00020633555],"domain_scores_gemma":[0.9975011,0.00066521065,0.0008904172,0.00024711274,0.0005864213,0.0001097845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001488648,0.00021063734,0.0006957214,0.00033418823,0.00024158394,0.00023524369,0.00046083741,0.00013699089,8.869946e-7],"category_scores_gemma":[0.00018247434,0.0001849065,0.00014955836,0.00038522665,0.00008586607,0.00032915134,0.00031389092,0.0003009137,2.844389e-7],"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.00003336581,0.0002401742,0.00037576887,0.00024631346,0.00010011187,0.000008062993,0.0016011314,0.000046368034,0.0018494728,0.98930717,0.00017776944,0.006014297],"study_design_scores_gemma":[0.0030513324,0.00064731546,0.00046296685,0.0010567466,0.000062311934,0.000099382574,0.0005012897,0.061713867,0.0018167708,0.9300168,0.00033328496,0.00023793762],"about_ca_topic_score_codex":0.000032295487,"about_ca_topic_score_gemma":8.48985e-7,"teacher_disagreement_score":0.09918703,"about_ca_system_score_codex":0.000051045557,"about_ca_system_score_gemma":0.000099774436,"threshold_uncertainty_score":0.75402683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009598521,0.000017655608,0.96729535,0.010030315,0.0011440413,0.0003748085,0.000026493875,0.000079531535,0.011433274],"genre_scores_gemma":[0.9946579,0.0000029734633,0.003662042,0.0002975486,0.0003784243,0.00005555473,0.0000026202172,0.000008094349,0.0009348716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888515,0.000065906555,0.00029913106,0.00021412072,0.0002752266,0.00026043624],"domain_scores_gemma":[0.9979606,0.00021499622,0.000238938,0.0012606046,0.00023954346,0.000085297055],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007961494,0.00013054273,0.00017024938,0.000058399957,0.0015256278,0.0011807571,0.0012473688,0.000057786965,0.000012139025],"category_scores_gemma":[0.0006878565,0.00008458399,0.000110130015,0.00009160757,0.00005609349,0.00030811693,0.0002536807,0.00015231059,0.00022578337],"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.000003562497,0.00003116324,0.00002776213,0.000007937544,0.000020853926,0.000003450149,0.0007777322,0.0002523401,0.00019241769,0.99172467,0.004132642,0.002825467],"study_design_scores_gemma":[0.0011791812,0.00033903084,0.0028559112,0.0007196052,0.000051302493,0.00011932952,0.0003070104,0.82160795,0.0040835845,0.13067003,0.037411943,0.0006551205],"about_ca_topic_score_codex":0.00001769411,"about_ca_topic_score_gemma":0.000016298409,"teacher_disagreement_score":0.9850593,"about_ca_system_score_codex":0.000108178174,"about_ca_system_score_gemma":0.000028643217,"threshold_uncertainty_score":0.9998561},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033703733,0.00012721661,0.9622593,0.002255351,0.00008532659,0.00038753147,0.000010040361,0.00010673902,0.0010647953],"genre_scores_gemma":[0.9810189,0.00038386357,0.018391892,0.0000832108,0.0000036747401,0.00005326572,0.000017119324,0.000006832347,0.000041232226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987745,0.00027720025,0.00039675366,0.00027992215,0.00010562158,0.00016600345],"domain_scores_gemma":[0.998633,0.00036618128,0.00010847123,0.00078435673,0.000058659938,0.000049321934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033486585,0.00014863996,0.00021114585,0.00029927364,0.00060587475,0.00023659489,0.0005633876,0.00005787358,0.000001274645],"category_scores_gemma":[0.0000011958228,0.00014866286,0.000028191213,0.00058902317,0.00016163576,0.00028195867,0.000047305235,0.00035750878,0.0000014945973],"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.000072043695,0.0008390202,0.003961346,0.00026092638,0.0005238255,0.000005103164,0.007962692,0.01360596,0.00028019884,0.17923199,0.00019565386,0.79306126],"study_design_scores_gemma":[0.0012969604,0.00012362935,0.015626473,0.0010731651,0.000048389746,0.000019360241,0.0017972608,0.97755164,0.00034458732,0.0016247771,0.00020704189,0.0002867399],"about_ca_topic_score_codex":0.00012573291,"about_ca_topic_score_gemma":0.00031958503,"teacher_disagreement_score":0.9639456,"about_ca_system_score_codex":0.00013338182,"about_ca_system_score_gemma":0.000020250749,"threshold_uncertainty_score":0.60622954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019473693,0.00012934509,0.98973143,0.0023313877,0.0027899856,0.0004354907,0.0000014781252,0.0008449663,0.0017885222],"genre_scores_gemma":[0.9426692,0.0000030662734,0.053100348,0.00045597221,0.00033111777,0.00008852661,0.0000026179966,0.000015969568,0.0033331865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881727,0.000042790372,0.0002980364,0.0004473346,0.00009397336,0.00030061178],"domain_scores_gemma":[0.9991955,0.00023894265,0.000041669267,0.00035514863,0.0000988603,0.000069878704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615265,0.00013826483,0.00016232999,0.00007263333,0.00013680993,0.0004903255,0.0003707943,0.000098217155,0.000016539962],"category_scores_gemma":[0.00005438961,0.00011152838,0.0001484939,0.00022193632,0.00001228456,0.00028975305,0.000075499585,0.00014517849,0.000024620276],"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.000057218946,0.00014823848,0.00009178268,0.00040786056,0.0001502339,0.000029728702,0.0022542167,0.006724982,0.010214234,0.77792144,0.025840739,0.17615934],"study_design_scores_gemma":[0.00029482885,0.00007263626,0.000028618933,0.00005946804,0.000003304756,0.0000060207776,0.000019243516,0.9327342,0.0015643246,0.00085124344,0.06420819,0.0001579569],"about_ca_topic_score_codex":0.0001357915,"about_ca_topic_score_gemma":0.00008758097,"teacher_disagreement_score":0.9407218,"about_ca_system_score_codex":0.00006502783,"about_ca_system_score_gemma":0.000091304086,"threshold_uncertainty_score":0.472822},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74869514,0.000055534652,0.25045818,0.00012345695,0.00030324064,0.00006164951,0.0000016032152,0.0000061841056,0.00029504584],"genre_scores_gemma":[0.96098137,0.000023010787,0.038654063,0.00005343929,0.00025722274,0.0000010587106,7.3704695e-7,0.0000042086685,0.000024885972],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991435,0.00005268605,0.00044370946,0.0001003134,0.00015225745,0.00010755783],"domain_scores_gemma":[0.9992459,0.000066755216,0.0002660602,0.00013932538,0.0002462571,0.000035695524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032170324,0.000098003344,0.00029845416,0.000061972154,0.000037698752,0.00016618677,0.00023122689,0.000041781248,0.000002830373],"category_scores_gemma":[0.000011007058,0.00006311623,0.00003640535,0.0001423571,0.000061021456,0.00025002184,0.00005247252,0.000120529025,7.2943055e-7],"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.0005423914,0.00027474848,0.0001733126,0.00048687644,0.00019215983,0.000014976782,0.0006984748,0.0022903155,0.8066388,0.15410975,0.00019437543,0.034383852],"study_design_scores_gemma":[0.0017907668,0.002478468,0.004179878,0.00270518,0.00008411159,0.0003168697,0.00028445758,0.03496218,0.9368714,0.014926877,0.0010358214,0.0003640069],"about_ca_topic_score_codex":0.00000581008,"about_ca_topic_score_gemma":0.0000020309199,"teacher_disagreement_score":0.21228626,"about_ca_system_score_codex":0.000015933152,"about_ca_system_score_gemma":0.00011132951,"threshold_uncertainty_score":0.25738055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032118477,0.000019321275,0.9211847,0.0017104184,0.0007064352,0.00016810342,9.608797e-7,0.00037496284,0.043716583],"genre_scores_gemma":[0.9919524,0.0000017053208,0.004778806,0.0008268405,0.000043587057,0.000012768144,0.000005615648,0.000004225729,0.00237402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989489,0.00005033133,0.00037376763,0.00019527841,0.00015370017,0.00027806102],"domain_scores_gemma":[0.9990609,0.00008108746,0.0001348248,0.00043062217,0.00024970787,0.000042826126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004456981,0.00013056802,0.00016788354,0.00018030273,0.00024105157,0.0005446201,0.00056868384,0.000053286713,0.00000887194],"category_scores_gemma":[0.00005702597,0.000099960314,0.00003700661,0.0006605475,0.000018249746,0.0013088833,0.00025702803,0.00014157507,0.00002823917],"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.0000992025,0.000053209165,0.039989755,0.00024073863,0.0004439497,0.000051865944,0.015708594,0.053596176,0.00033906326,0.56819826,0.054963768,0.26631543],"study_design_scores_gemma":[0.0008210678,0.000082647966,0.00071519957,0.00026456878,0.0000071205186,0.00002388294,0.0009567317,0.98830265,0.00089590705,0.00078518747,0.0068947226,0.00025031218],"about_ca_topic_score_codex":0.00016944508,"about_ca_topic_score_gemma":0.00007828783,"teacher_disagreement_score":0.959834,"about_ca_system_score_codex":0.00006124291,"about_ca_system_score_gemma":0.000070078735,"threshold_uncertainty_score":0.52517843},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035077662,0.00091252924,0.99070436,0.0018244977,0.0015122299,0.0013646614,0.000024362032,0.00052626454,0.0027803262],"genre_scores_gemma":[0.9615162,0.00087870413,0.02837057,0.0003687037,0.000033029624,0.0009366776,0.000083172796,0.00003823643,0.0077747214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974101,0.00055820413,0.00085086084,0.0006018954,0.00013520064,0.0004437369],"domain_scores_gemma":[0.99357074,0.00085626054,0.00028873226,0.004486779,0.0006868063,0.000110679604],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000995222,0.00032734306,0.00038544045,0.00049663783,0.0020172428,0.00038330702,0.002980797,0.000172093,0.000014761571],"category_scores_gemma":[0.000026590642,0.00035498742,0.00027801105,0.0013139338,0.0001334485,0.00059673114,0.00007571807,0.00059711235,0.00005912185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020074847,0.007051784,0.00013827016,0.00045472002,0.00077477185,0.0000025147026,0.0036087881,0.7888086,0.0015644003,0.144306,0.016881606,0.03620781],"study_design_scores_gemma":[0.0014497814,0.00006950051,0.000057088975,0.00026926686,0.00008841953,0.000006189737,0.00011836107,0.9814906,0.0013316055,0.00063275016,0.014173628,0.00031277438],"about_ca_topic_score_codex":0.00013456841,"about_ca_topic_score_gemma":0.00077711587,"teacher_disagreement_score":0.9623338,"about_ca_system_score_codex":0.00023239962,"about_ca_system_score_gemma":0.000134175,"threshold_uncertainty_score":0.9998902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021771543,0.000094305295,0.9649409,0.0013066239,0.00089842203,0.00031571902,0.0000014537618,0.00009188459,0.010579143],"genre_scores_gemma":[0.9935334,0.000011976287,0.0033292708,0.00050176773,0.00004418201,0.000064540196,0.0000036712845,0.0000031349275,0.0025080778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918866,0.000031778465,0.00026296638,0.00026315538,0.00006917714,0.00018428163],"domain_scores_gemma":[0.99959517,0.00008391096,0.000042682557,0.00017693902,0.00007198965,0.000029294732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037089305,0.00007562112,0.00014591472,0.00012193429,0.00012734103,0.00012974117,0.00014955737,0.000051650353,0.000012614327],"category_scores_gemma":[0.000021773227,0.000067969275,0.00003278798,0.00028039885,0.000012999159,0.00027063148,0.0000450868,0.000055900065,0.000010033917],"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.000024932971,0.00007461134,0.0023399561,0.00011907044,0.000021656979,0.0000029075395,0.00048944046,0.0022980815,0.003976818,0.9506873,0.035196707,0.00476855],"study_design_scores_gemma":[0.00075690117,0.00007310223,0.002408885,0.00021941973,0.0000039111756,0.000005417801,0.00008267095,0.95178133,0.0008932172,0.021471765,0.02214948,0.00015390228],"about_ca_topic_score_codex":0.00027189616,"about_ca_topic_score_gemma":0.00022744086,"teacher_disagreement_score":0.9717618,"about_ca_system_score_codex":0.00004443827,"about_ca_system_score_gemma":0.000022404058,"threshold_uncertainty_score":0.27717066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011966949,0.00022599091,0.9811581,0.0010552367,0.0037281008,0.00028359218,0.0000036097017,0.00015807364,0.0014203516],"genre_scores_gemma":[0.75320405,0.0000066354937,0.24159741,0.0008797441,0.001045416,0.0001038689,0.0000076262877,0.00001563236,0.0031396146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988652,0.00010450118,0.00028894923,0.00039739668,0.00007874583,0.00026524608],"domain_scores_gemma":[0.99931425,0.00011986665,0.00006375707,0.0003641119,0.000104771214,0.000033255063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000609621,0.00014868619,0.00020189754,0.00012381338,0.00028490723,0.00016360336,0.0004043268,0.00007992498,0.000002801703],"category_scores_gemma":[0.000027966567,0.00012666675,0.00013955514,0.00033750563,0.000008316313,0.00014460686,0.00008393848,0.0001126606,0.0000092597365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091020884,0.00009955774,0.00006035291,0.000111629866,0.00013022697,0.0000021399096,0.00057402684,0.5803684,0.017056173,0.22505376,0.051526338,0.12492637],"study_design_scores_gemma":[0.00028160572,0.000040701154,0.000019646397,0.00011816321,0.00000682522,0.000019097764,0.000014612938,0.9744733,0.001027244,0.020006357,0.0038623144,0.00013014984],"about_ca_topic_score_codex":0.00010870934,"about_ca_topic_score_gemma":0.0000264771,"teacher_disagreement_score":0.7412371,"about_ca_system_score_codex":0.000040683204,"about_ca_system_score_gemma":0.000035206584,"threshold_uncertainty_score":0.516532},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008973337,0.0008767336,0.97326016,0.0032845736,0.00044563616,0.0005777458,0.000009626313,0.0003203908,0.012251779],"genre_scores_gemma":[0.5707372,0.0010815604,0.42436057,0.00018780888,0.0000391882,0.000133984,0.0002241293,0.000029993553,0.0032055946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959109,0.0019189846,0.00054787705,0.0009405819,0.00034778274,0.00033386203],"domain_scores_gemma":[0.9953726,0.00067520107,0.0004811469,0.0015818635,0.0017451452,0.00014403509],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027896992,0.00033897135,0.0003914582,0.00021873655,0.00046641123,0.0014552776,0.0011464588,0.0002863506,0.000038762595],"category_scores_gemma":[0.00026284254,0.00032990612,0.00010118296,0.0004030128,0.00008782224,0.00039795428,0.0011093655,0.00045435832,0.000004348652],"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.00006321712,0.00073139835,0.003419853,0.00069004885,0.00045699847,0.000023849547,0.019111812,0.3850514,0.00033365737,0.47183353,0.0018317888,0.116452426],"study_design_scores_gemma":[0.00055481517,7.750774e-7,0.00024816033,0.001639708,0.000029408397,0.000022132504,0.000042476848,0.9919377,0.0020410495,0.000780877,0.0023397626,0.0003631256],"about_ca_topic_score_codex":0.0006505328,"about_ca_topic_score_gemma":0.0014722602,"teacher_disagreement_score":0.6068863,"about_ca_system_score_codex":0.00015378487,"about_ca_system_score_gemma":0.00036021575,"threshold_uncertainty_score":0.9999153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015859988,0.0004963501,0.9809134,0.00027482113,0.0012882174,0.00058012235,0.0000035417754,0.0003078563,0.00027567695],"genre_scores_gemma":[0.9908135,0.000015911977,0.00857307,0.000042284035,0.000031594962,0.000088622015,0.000001304333,0.000008390658,0.00042530405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771625,0.00046539295,0.0006336121,0.00043826297,0.00030916478,0.00043733176],"domain_scores_gemma":[0.9984267,0.0005019434,0.00022199783,0.000626157,0.00016469805,0.000058498295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012390165,0.00020257977,0.00034117742,0.0002361489,0.00041894437,0.00022732938,0.00050546415,0.00013436287,0.000008882961],"category_scores_gemma":[0.00006647344,0.00019680611,0.00009270132,0.0009123089,0.00003150135,0.00025245486,0.000015215507,0.00021497488,0.000015764723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024284021,0.00009466288,0.000019011,0.00009043302,0.00013035072,0.0000012804985,0.00024654457,0.88586277,0.0006406525,0.08581619,0.00021836793,0.026855456],"study_design_scores_gemma":[0.00054956094,0.00019816068,0.00009699048,0.00035536854,0.000025385709,0.000041716983,0.00017050539,0.9942946,0.0026858603,0.0013011292,0.000121307734,0.00015943385],"about_ca_topic_score_codex":0.00018467617,"about_ca_topic_score_gemma":0.000012068272,"teacher_disagreement_score":0.97495353,"about_ca_system_score_codex":0.00051932357,"about_ca_system_score_gemma":0.0001936347,"threshold_uncertainty_score":0.802552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022850316,0.00007193251,0.9734223,0.0022923397,0.00015921042,0.00037932486,0.000013900607,0.00017759275,0.0006330965],"genre_scores_gemma":[0.99294955,0.00021298167,0.0062908805,0.00020105693,0.000009681582,0.000146956,0.000011779209,0.0000051489187,0.00017198443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902844,0.0001884143,0.00025852746,0.00027814897,0.000113425696,0.00013306734],"domain_scores_gemma":[0.99877995,0.0002600912,0.00009146616,0.0006444182,0.00016539024,0.000058695303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023300575,0.00013826202,0.00015233483,0.00016908559,0.0008740818,0.00027205062,0.00030732082,0.000085888256,0.000010234045],"category_scores_gemma":[0.0000048427632,0.00011934279,0.000028597833,0.00057167135,0.000103695194,0.00045096458,0.000006374331,0.00025781392,0.0000033925169],"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.0007931971,0.004717775,0.0014067016,0.00037519613,0.0015790703,0.0000042589745,0.019893257,0.06612413,0.023896512,0.5267426,0.0018549603,0.35261238],"study_design_scores_gemma":[0.001480548,0.0002910174,0.0010480372,0.00011203444,0.00006296873,0.000034831843,0.00014349176,0.9895568,0.0021231687,0.001234971,0.0036697027,0.00024244338],"about_ca_topic_score_codex":0.00028466518,"about_ca_topic_score_gemma":0.0016914883,"teacher_disagreement_score":0.9700992,"about_ca_system_score_codex":0.000066609915,"about_ca_system_score_gemma":0.00004750699,"threshold_uncertainty_score":0.6722819},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25664276,0.0021163456,0.64741963,0.0016726855,0.08314969,0.0015612919,0.000001956792,0.000093085226,0.0073425476],"genre_scores_gemma":[0.95614874,0.000057908608,0.03909036,0.00025430397,0.004343294,0.000009368487,0.0000010211169,0.000054675274,0.000040340863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99244404,0.00095263106,0.0035285112,0.0008087749,0.0013665179,0.0008995433],"domain_scores_gemma":[0.9932242,0.0012274026,0.002013307,0.0010962057,0.0018843239,0.00055454596],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0077624964,0.00079806295,0.0017900382,0.00065589056,0.0019650161,0.0033468432,0.003050458,0.00045754088,0.000003067779],"category_scores_gemma":[0.0004859634,0.0006062468,0.0005090231,0.0017350251,0.0002012496,0.00091025594,0.0014159253,0.0015141694,0.00000654413],"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.000119427605,0.001709278,0.00009892188,0.0006319969,0.0003712158,0.000012819296,0.016761795,0.0033152557,0.00019955623,0.957217,0.0012286151,0.018334122],"study_design_scores_gemma":[0.0040378105,0.0018219055,0.00010765389,0.0030072902,0.00032883318,0.00042625074,0.0040177125,0.46708617,0.0002789069,0.51159436,0.006423549,0.00086956465],"about_ca_topic_score_codex":0.00009895461,"about_ca_topic_score_gemma":0.0000031272007,"teacher_disagreement_score":0.699506,"about_ca_system_score_codex":0.000370125,"about_ca_system_score_gemma":0.0006393232,"threshold_uncertainty_score":0.9996389},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001651257,0.00056856044,0.8146923,0.0013885811,0.06559311,0.000530446,5.869297e-7,0.00040781288,0.11516736],"genre_scores_gemma":[0.93686104,0.00015349236,0.00069471344,0.005953216,0.003965721,0.000052748772,0.0000031224563,0.000033219003,0.05228271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945446,0.0007292758,0.0013999096,0.0015354761,0.00044053065,0.0013501664],"domain_scores_gemma":[0.9968683,0.00082763174,0.0003557198,0.0013820863,0.00033034026,0.00023588973],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018260865,0.00069354934,0.0007794964,0.00046455782,0.0011301922,0.0015689476,0.0013800283,0.00062252744,0.00057878875],"category_scores_gemma":[0.00011026525,0.00066029705,0.00051174214,0.0023863334,0.0001160236,0.00075532106,0.00072468247,0.0011288166,0.00039238177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074588745,0.00007644557,0.00010056562,0.000011818996,0.00013703867,0.0000090101685,0.0001403916,0.449245,0.0000025612082,0.38143694,0.10289238,0.06587325],"study_design_scores_gemma":[0.0006650101,0.00080733147,0.00016159346,0.0015275913,0.000037845657,0.000025157877,0.00031804765,0.94497854,0.000046747435,0.0018995833,0.04896315,0.00056939136],"about_ca_topic_score_codex":0.00010454437,"about_ca_topic_score_gemma":0.00016825681,"teacher_disagreement_score":0.9352098,"about_ca_system_score_codex":0.00045490396,"about_ca_system_score_gemma":0.00016174567,"threshold_uncertainty_score":0.99958485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0476578,0.00021333511,0.91980195,0.015337204,0.014865373,0.001422867,0.00003004187,0.00031720943,0.00035419958],"genre_scores_gemma":[0.90173036,0.000020706791,0.0684862,0.025663277,0.0018921567,0.00018630261,0.000013066078,0.000054901157,0.0019530347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534124,0.00025472319,0.0010990734,0.0015934168,0.00043162497,0.0012798994],"domain_scores_gemma":[0.99740064,0.00039218029,0.00031622313,0.0014014406,0.00028545366,0.00020408216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005612874,0.00085778045,0.00086930144,0.00073342776,0.00075467426,0.0009493339,0.0022733721,0.00030006137,0.000007348011],"category_scores_gemma":[0.0000136431,0.0007593901,0.00066926185,0.0010144109,0.00024016011,0.00037652403,0.00035738837,0.0008834648,0.000027774473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015067155,0.000082014354,0.00012481933,0.00040565286,0.00025157796,0.000011589508,0.0021902525,0.7581951,0.0010892355,0.0026173475,0.08526317,0.1496186],"study_design_scores_gemma":[0.0012273041,0.00023983928,0.00024429892,0.0011195848,0.00006759339,0.00005724212,0.0000054303855,0.98605126,0.00054238766,0.00075480225,0.008952518,0.00073770795],"about_ca_topic_score_codex":0.000029868574,"about_ca_topic_score_gemma":0.00004277937,"teacher_disagreement_score":0.8540726,"about_ca_system_score_codex":0.00021941235,"about_ca_system_score_gemma":0.00021404348,"threshold_uncertainty_score":0.99948573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016860034,0.1784554,0.7882339,0.00034049232,0.012252329,0.001938834,0.000012428643,0.0001403448,0.0017662477],"genre_scores_gemma":[0.98667747,0.0035794938,0.0066966177,0.00051891844,0.0011815722,0.00023475969,0.000004849824,0.000047166213,0.0010591602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927887,0.0009971332,0.0024062803,0.0020997098,0.0005672021,0.0011409846],"domain_scores_gemma":[0.99604166,0.001379809,0.00095412304,0.0008814222,0.00048310263,0.00025985812],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026950662,0.00094355305,0.0020172843,0.00067414466,0.0006957519,0.0018592991,0.0010819786,0.00045037665,0.000006837447],"category_scores_gemma":[0.000062490646,0.0008477398,0.00019352291,0.0014931766,0.00039012026,0.0014151585,0.0008648988,0.0007710106,0.0000064652627],"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.00039028277,0.00046538247,0.007347025,0.014065701,0.0006320394,0.00030455968,0.013522736,0.37396416,0.00068372954,0.040125642,0.002723423,0.5457753],"study_design_scores_gemma":[0.0029065246,0.00038725956,0.00016749257,0.007493598,0.000042257423,0.00038644968,0.0006524497,0.9774851,0.00009798499,0.0011246025,0.008370897,0.00088537415],"about_ca_topic_score_codex":0.0005067922,"about_ca_topic_score_gemma":0.00014036696,"teacher_disagreement_score":0.9698174,"about_ca_system_score_codex":0.00015293238,"about_ca_system_score_gemma":0.00018647054,"threshold_uncertainty_score":0.99939734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006445132,0.00058052235,0.9899899,0.0015708763,0.00080976775,0.00041211676,0.00000574487,0.000028778177,0.00015719158],"genre_scores_gemma":[0.6223194,0.0007377513,0.34934098,0.0040050987,0.0015831471,0.0000769259,0.000024244224,0.00008267925,0.021829788],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889445,0.00018158094,0.00046230777,0.00013570863,0.00016222136,0.0001637197],"domain_scores_gemma":[0.9984189,0.0005313503,0.00039840423,0.0002178338,0.00037870006,0.000054756307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141333,0.00011366047,0.00024593546,0.0001314689,0.00027244707,0.0005702834,0.00094179355,0.00006621133,0.000012780372],"category_scores_gemma":[0.00016496792,0.00007549155,0.00008231644,0.00026701964,0.000030413714,0.0006503073,0.00024691716,0.0001492455,0.00000354349],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005965902,0.0001336559,0.0010011431,0.0001845899,0.00040863542,0.000008668374,0.0089072455,0.006321917,0.00013774922,0.0018143365,0.11687734,0.8636081],"study_design_scores_gemma":[0.013687856,0.0024252364,0.00218106,0.0030216305,0.00078399427,0.0027785243,0.0077966563,0.37803125,0.002504142,0.07376595,0.51160634,0.0014173522],"about_ca_topic_score_codex":0.000028556762,"about_ca_topic_score_gemma":0.0000061198884,"teacher_disagreement_score":0.8621908,"about_ca_system_score_codex":0.000039785748,"about_ca_system_score_gemma":0.00006912291,"threshold_uncertainty_score":0.54992557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002253069,0.00017544263,0.9782808,0.0023813753,0.0051117917,0.00051972014,0.0000024356764,0.000044228127,0.013258937],"genre_scores_gemma":[0.9579227,0.00003254981,0.027797678,0.00831955,0.001150186,0.000033143424,9.03765e-7,0.00005003231,0.004693258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971093,0.00009897635,0.0005233697,0.00087453204,0.0009495673,0.0004442765],"domain_scores_gemma":[0.99630564,0.00089438935,0.00040378355,0.0020775492,0.0002479229,0.00007069651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095093646,0.0003847787,0.0003919865,0.00031476293,0.00036730597,0.0005295128,0.004654397,0.00023193954,0.00007487956],"category_scores_gemma":[0.00006604808,0.00019297673,0.00027148178,0.00058021955,0.00088490965,0.0002665845,0.00075011386,0.0007901988,0.000073451796],"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.0000071675436,0.00006233207,0.00006864725,0.000053596883,0.00006093996,0.000014543518,0.0027809972,0.038692646,0.00031635302,0.71952397,0.0038249043,0.23459393],"study_design_scores_gemma":[0.0002446674,0.0003260395,0.00038019527,0.0012588109,0.000012674743,0.0000814906,8.148008e-7,0.5598263,0.0034614047,0.4217479,0.011839738,0.00081993506],"about_ca_topic_score_codex":0.000050972056,"about_ca_topic_score_gemma":0.000071872644,"teacher_disagreement_score":0.9576974,"about_ca_system_score_codex":0.00011078306,"about_ca_system_score_gemma":0.00019583474,"threshold_uncertainty_score":0.8649105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12477569,0.000016428705,0.8686999,0.0008023278,0.0005502097,0.00022692553,6.198769e-7,0.00013539847,0.0047924854],"genre_scores_gemma":[0.7820869,0.0000012200118,0.21755952,0.00024188274,0.00007665011,0.000014120962,3.9980094e-7,0.000011430636,0.000007878979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971008,0.00009639657,0.00057461695,0.0007464028,0.0008002206,0.00068159366],"domain_scores_gemma":[0.99808645,0.00060544815,0.0001777949,0.00080583565,0.00013916542,0.00018527538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024712216,0.00026971952,0.00036193177,0.00035137904,0.00043825354,0.0009127285,0.0019437228,0.000070892034,0.000013939125],"category_scores_gemma":[0.00027321687,0.00021024741,0.00009256655,0.0013186431,0.0010283535,0.0006029977,0.00070170953,0.00030795118,0.00006688873],"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.0000030974677,0.00009389124,0.00001149674,0.000031618067,0.0000031633624,0.000027976903,0.0035563153,0.012638278,0.00032012985,0.9813452,0.000008965728,0.0019598918],"study_design_scores_gemma":[0.0002515595,0.0001997006,0.000029437633,0.0004686864,0.0000017820298,0.000038678765,0.00017238522,0.6754814,0.0010898925,0.32204965,0.0000049362316,0.00021190153],"about_ca_topic_score_codex":0.00001245103,"about_ca_topic_score_gemma":0.000005175366,"teacher_disagreement_score":0.6628431,"about_ca_system_score_codex":0.000149582,"about_ca_system_score_gemma":0.000103506056,"threshold_uncertainty_score":0.8801462},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062420513,0.0018355609,0.25188214,0.00346463,0.025499746,0.00070662185,0.0000043244186,0.00036483342,0.65382165],"genre_scores_gemma":[0.9503495,0.00014064886,0.0019513558,0.0044146855,0.0039397716,0.000012520123,0.0000065530694,0.000022778946,0.0391622],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969988,0.00027279314,0.0006274384,0.00079735037,0.00041903454,0.0008846094],"domain_scores_gemma":[0.99825823,0.00020118468,0.00019214502,0.00096286164,0.00014566023,0.00023994102],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005425292,0.00037089814,0.00042136482,0.000115325725,0.00072603096,0.00026397972,0.000944899,0.0002667169,0.0020538724],"category_scores_gemma":[0.000017947445,0.0003165626,0.00025150363,0.0006493333,0.000112085545,0.00030469045,0.00024115406,0.0004470192,0.0018653208],"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.000036736186,0.00015546796,0.0014492959,0.000019245606,0.00006839323,0.00018674906,0.0014130956,0.00636833,0.00012299334,0.07570254,0.91074204,0.0037351244],"study_design_scores_gemma":[0.0017249183,0.0016820622,0.00845827,0.0006227562,0.000026942516,0.0019009229,0.00017492901,0.41731995,0.0011940447,0.0022768434,0.5627003,0.0019180821],"about_ca_topic_score_codex":0.00019900469,"about_ca_topic_score_gemma":0.00004501168,"teacher_disagreement_score":0.88792896,"about_ca_system_score_codex":0.00008678033,"about_ca_system_score_gemma":0.000111081165,"threshold_uncertainty_score":0.99992865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38343844,0.00017500005,0.5951756,0.0033869743,0.00550112,0.0015565663,0.00007181691,0.00025650248,0.010437969],"genre_scores_gemma":[0.99781895,0.0000088746465,0.0007534451,0.0008959694,0.00013807022,0.000042758587,0.0000041774147,0.000015292231,0.00032247047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837774,0.00006652932,0.0006931003,0.00018211106,0.00034428228,0.0003362384],"domain_scores_gemma":[0.99855995,0.00045210277,0.00023633741,0.00057772524,0.00012053627,0.000053342243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009834248,0.00020269354,0.00021748114,0.00011834819,0.00043374786,0.0006905855,0.00080164045,0.00009203533,0.000008419293],"category_scores_gemma":[0.000097826516,0.00010976768,0.00020715536,0.0003892479,0.000086353415,0.0006939644,0.00031294549,0.00035029557,0.000019098734],"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.000020714762,0.000044170007,0.0015357451,0.00045227207,0.00020109148,0.000003139738,0.029702127,0.0013231288,0.000087807115,0.9433291,0.014240657,0.009060043],"study_design_scores_gemma":[0.000554567,0.00018341382,0.0005842075,0.0011104804,0.000025425592,0.00012091622,0.0021723781,0.9634855,0.00087142095,0.006287847,0.024293952,0.0003099208],"about_ca_topic_score_codex":0.000014816072,"about_ca_topic_score_gemma":0.0000112234475,"teacher_disagreement_score":0.9621623,"about_ca_system_score_codex":0.000037833404,"about_ca_system_score_gemma":0.00004115537,"threshold_uncertainty_score":0.6659332},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001682338,0.00026556765,0.15156375,0.0006184793,0.0009378369,0.00037706608,0.000085712476,0.0038870587,0.84226286],"genre_scores_gemma":[0.0026792968,0.00026961323,0.0013457531,0.000561458,0.0009450923,9.395016e-8,0.00048312434,0.0066626365,0.9870529],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758846,0.00044537854,0.00033757114,0.00074741495,0.0004343323,0.00044687596],"domain_scores_gemma":[0.9979945,0.000025567282,0.00022030128,0.0011737011,0.00042749572,0.00015847472],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060905586,0.000261777,0.0002987374,0.0005945826,0.0010773309,0.0014624835,0.0028085615,0.0002389869,0.01559197],"category_scores_gemma":[0.00024066771,0.00026660197,0.000116350326,0.00075527065,0.000088375804,0.00017404046,0.0019480211,0.00045110076,0.022422863],"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.0000049339046,0.00003603255,1.4898528e-7,0.00006453868,0.00005533209,0.000015690022,0.00015449134,0.000014265163,0.00002271469,0.05893348,0.9015716,0.039126776],"study_design_scores_gemma":[0.00024775488,0.00009161989,0.000006536785,0.00021486472,0.000009153419,0.00007265393,0.000038523227,0.0016798031,0.000018535407,0.00024854287,0.99710536,0.00026662712],"about_ca_topic_score_codex":0.00008462484,"about_ca_topic_score_gemma":0.0000019186102,"teacher_disagreement_score":0.15021801,"about_ca_system_score_codex":0.00015118322,"about_ca_system_score_gemma":0.000010240375,"threshold_uncertainty_score":0.9999786},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019969033,0.00096300495,0.07873429,0.002583407,0.0026692017,0.0004969178,0.00007505836,0.0010712362,0.91338694],"genre_scores_gemma":[0.028722124,0.00014238428,0.00038999965,0.00026707223,0.001727813,6.886629e-8,0.00031927606,0.005297471,0.9631338],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966343,0.0007304863,0.0004763166,0.001025152,0.000489144,0.0006446001],"domain_scores_gemma":[0.99792814,0.00002730539,0.00020202738,0.0009532889,0.0006083345,0.0002808815],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010065448,0.00033810904,0.00034165822,0.0004450564,0.001766974,0.0043704985,0.0024578827,0.00026883007,0.18844706],"category_scores_gemma":[0.00025249756,0.0003667604,0.00018545534,0.00093289255,0.00023516922,0.0003526959,0.0026656296,0.00069321494,0.55933696],"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.0000060796783,0.00006511059,9.5937956e-8,0.00017947862,0.0000859005,0.000050809445,0.001167665,0.00005864213,0.00009135034,0.32514513,0.6292188,0.04393091],"study_design_scores_gemma":[0.0002451897,0.00023340048,0.000009969275,0.00045360418,0.000021469017,0.0005129269,0.00020887502,0.008056934,0.000031381645,0.001057221,0.9887904,0.0003786376],"about_ca_topic_score_codex":0.00015023736,"about_ca_topic_score_gemma":0.0000065582776,"teacher_disagreement_score":0.3708899,"about_ca_system_score_codex":0.00023746258,"about_ca_system_score_gemma":0.000018897443,"threshold_uncertainty_score":0.9998784},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011749064,0.00020245175,0.10893758,0.00025906382,0.00077173655,0.00028153142,0.000047664314,0.0018092459,0.88768953],"genre_scores_gemma":[0.004097404,0.00013859195,0.0007559797,0.0001319701,0.0011705664,4.659367e-8,0.00041817874,0.0061765397,0.98711073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983946,0.00023439503,0.00016882754,0.0005415223,0.00033050723,0.00033012964],"domain_scores_gemma":[0.99802214,0.000008489978,0.00025922913,0.0013481071,0.00022505272,0.0001369562],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004907462,0.00018273531,0.00020647988,0.00029896165,0.0017044066,0.002232299,0.0034766768,0.00016277481,0.0137837855],"category_scores_gemma":[0.0001604948,0.00018181374,0.000077070494,0.00018079851,0.000089185094,0.00019380437,0.001769346,0.00028653754,0.019750541],"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.0000020621005,0.00002050527,8.2917815e-8,0.000033590484,0.000029936415,0.000012881331,0.00012361511,0.0000028466,0.000020066072,0.01716248,0.89380264,0.0887893],"study_design_scores_gemma":[0.00017383922,0.000076786484,0.00000555444,0.00014524793,0.0000042385095,0.00011149779,0.000010186503,0.00095249753,0.0000110617975,0.00011948222,0.9981861,0.00020349675],"about_ca_topic_score_codex":0.000053840453,"about_ca_topic_score_gemma":0.0000019506658,"teacher_disagreement_score":0.108181596,"about_ca_system_score_codex":0.000081239785,"about_ca_system_score_gemma":0.000003594825,"threshold_uncertainty_score":0.9995952},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044054956,0.00037418984,0.0029282647,0.0017048807,0.009043904,0.0005793668,0.9815877,0.00017656638,0.003561054],"genre_scores_gemma":[0.00059494143,0.00047050565,0.0000879462,0.0006463392,0.0024393506,0.00009423382,0.97397953,0.00007070863,0.02161647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99568796,0.00072318094,0.0008854664,0.0010688041,0.0008804583,0.00075410213],"domain_scores_gemma":[0.99646634,0.0007328699,0.0006270077,0.0015091259,0.00038068704,0.00028396567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074812456,0.00059760414,0.00075117365,0.00023156601,0.0003809914,0.0006334328,0.0013956022,0.00064187153,0.00008276431],"category_scores_gemma":[0.00020473512,0.0006137162,0.00025609694,0.0005473505,0.00006380946,0.0006019509,0.00046753016,0.00071424455,0.0006224437],"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.000019357703,0.000042356223,0.00004261915,0.00018317136,0.0001302687,0.000283758,0.00006955449,0.0008971595,0.0000013393916,0.0038534305,0.989455,0.0050219954],"study_design_scores_gemma":[0.00026840423,0.00006751734,0.0067083454,0.00048638298,0.000057664027,0.00010273916,0.00003703861,0.022559816,0.00000513641,0.0001860505,0.96891063,0.00061026873],"about_ca_topic_score_codex":0.9922595,"about_ca_topic_score_gemma":0.9918188,"teacher_disagreement_score":0.021662658,"about_ca_system_score_codex":0.00052439485,"about_ca_system_score_gemma":0.0010583943,"threshold_uncertainty_score":0.9996314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4858456,0.0001055376,0.5098371,0.00041625623,0.0025057485,0.0005987701,0.00008788195,0.00010586008,0.000497239],"genre_scores_gemma":[0.999223,1.7104108e-7,0.0005197833,0.00011828114,0.00009889018,0.000024077173,0.0000024985934,0.0000055621485,0.000007746296],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998366,0.00008693238,0.0006181625,0.00016526673,0.0006008014,0.00016284718],"domain_scores_gemma":[0.9989837,0.00004775372,0.0002609122,0.0004124358,0.00025916955,0.000036059984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084128446,0.00014175085,0.0001681161,0.000052647974,0.00033592407,0.00044589152,0.0003832696,0.000060185284,0.0000029199462],"category_scores_gemma":[0.00001776245,0.00007942348,0.00009544612,0.00028013243,0.00003197919,0.0007089262,0.00020306974,0.00010041531,0.000018022927],"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.000069727226,0.00001345199,0.3732389,0.0018803168,0.0011622162,0.00001141476,0.5317268,0.012761168,0.000098250195,0.0734675,0.0020600616,0.003510219],"study_design_scores_gemma":[0.0005206513,0.000031487467,0.055091307,0.003026669,0.000058839367,0.0000979923,0.0073164017,0.932309,0.00024057036,0.0002806903,0.0007756587,0.00025078817],"about_ca_topic_score_codex":0.0001564917,"about_ca_topic_score_gemma":0.000036219106,"teacher_disagreement_score":0.9195478,"about_ca_system_score_codex":0.00015731403,"about_ca_system_score_gemma":0.00008171339,"threshold_uncertainty_score":0.4299742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98052585,0.000514941,0.003019237,0.000010715829,0.0029184045,0.0015979365,0.00010303262,0.00027452182,0.011035386],"genre_scores_gemma":[0.9952595,0.000018048784,0.00385839,0.000043761564,0.000115446746,0.00036920194,0.00010015273,0.00009726673,0.00013822662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524707,0.00050165906,0.0012847455,0.0012956427,0.0011163405,0.00055452116],"domain_scores_gemma":[0.9967798,0.0003952472,0.0006555647,0.00067856506,0.0012857516,0.00020505769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036083146,0.00059240055,0.00086422835,0.0006183768,0.0009246433,0.00025102694,0.000802059,0.00061878195,0.00000444045],"category_scores_gemma":[0.0007519052,0.0006000217,0.0003449909,0.0004059056,0.00002955677,0.0008752533,0.00012589425,0.0008794894,0.00000889566],"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.0003179987,0.00015992291,0.0000028268348,0.0031081964,0.00027330773,0.000009224902,0.00021060595,0.087152496,0.0076336446,0.5459366,4.4281157e-7,0.35519472],"study_design_scores_gemma":[0.0019645498,0.00030095322,0.00001646504,0.006064773,0.00017421438,0.000052809883,0.000663997,0.9573479,0.010443305,0.022168214,0.000101701844,0.00070107315],"about_ca_topic_score_codex":0.00022016322,"about_ca_topic_score_gemma":0.00051969604,"teacher_disagreement_score":0.87019545,"about_ca_system_score_codex":0.00094573275,"about_ca_system_score_gemma":0.00015285173,"threshold_uncertainty_score":0.9996451},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.843829,0.0005077443,0.00090838905,0.00012207398,0.011773811,0.0026912186,0.0001460779,0.00054572,0.13947597],"genre_scores_gemma":[0.99606365,0.000069377485,0.00041895875,0.000059920094,0.000055047814,0.00016217797,0.00014208788,0.000049716768,0.002979045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962943,0.000397985,0.001142342,0.00096056773,0.0007214526,0.0004833242],"domain_scores_gemma":[0.9966198,0.00018997102,0.0013601672,0.0010750392,0.00061483384,0.00014014434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015434598,0.00045087823,0.00074210844,0.00061141234,0.0005661262,0.00021149789,0.001638467,0.0006993889,0.000018974639],"category_scores_gemma":[0.0005554344,0.00047765145,0.0002644487,0.00043233606,0.00003699938,0.0017088646,0.00014695748,0.00093157846,0.000050430037],"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.00008086957,0.00022976346,0.000029269846,0.0006044815,0.00012028216,0.0000712192,0.000098654426,0.00039556986,0.010981467,0.798707,0.00000771299,0.18867368],"study_design_scores_gemma":[0.011274072,0.0018100796,0.010377142,0.015131535,0.0002715058,0.000392933,0.0013193401,0.33951843,0.39242506,0.16698809,0.0531164,0.0073754294],"about_ca_topic_score_codex":0.00040200504,"about_ca_topic_score_gemma":0.0019757687,"teacher_disagreement_score":0.63171893,"about_ca_system_score_codex":0.00052727386,"about_ca_system_score_gemma":0.0001153578,"threshold_uncertainty_score":0.99976754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000402507,0.000764452,0.7379447,0.00076874025,0.00057288597,0.0052540204,0.000035185567,0.00032745316,0.25393],"genre_scores_gemma":[0.6654766,0.00023521073,0.013197196,0.00011504207,0.0004472559,0.00012171262,0.00009041564,0.00019644917,0.3201201],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99609596,0.0019143686,0.00041345053,0.0005465053,0.00053965027,0.0004900407],"domain_scores_gemma":[0.998255,0.0003722806,0.0004961723,0.0005577138,0.00022400073,0.000094815005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017753504,0.00019031497,0.00037607132,0.0009523328,0.0003496313,0.00016955916,0.0012121879,0.00011934186,0.000017228871],"category_scores_gemma":[0.000021112442,0.00015895872,0.00019691658,0.0011814267,0.000106955515,0.00028952048,0.00020293913,0.0004196877,0.000006902761],"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.00029934593,0.0013455935,0.00043930352,0.005951811,0.0012085121,0.0012983059,0.015822005,0.00019382287,0.000078008365,0.37113366,0.56627315,0.035956483],"study_design_scores_gemma":[0.0022226828,0.0020859733,0.00010453909,0.0025639394,0.000043696244,0.00004932524,0.008315995,0.01806575,0.00008330521,0.0001602529,0.9659052,0.00039935941],"about_ca_topic_score_codex":0.0007216348,"about_ca_topic_score_gemma":0.00017538988,"teacher_disagreement_score":0.72474754,"about_ca_system_score_codex":0.0002387792,"about_ca_system_score_gemma":0.00022786022,"threshold_uncertainty_score":0.6482149},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73379564,0.00033370694,0.26266918,0.00033066087,0.001095613,0.0002651195,0.0000028049492,0.000028361032,0.0014788937],"genre_scores_gemma":[0.99807453,0.00006882101,0.00034913648,0.00005544274,0.000046529432,1.8583506e-7,0.0000032231605,0.000006403328,0.0013957184],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988164,0.00035677926,0.00019333704,0.00012273827,0.00032406655,0.0001866814],"domain_scores_gemma":[0.9979685,0.000621979,0.00034823624,0.00076041545,0.00023922297,0.00006165635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056203385,0.00010674942,0.00021107966,0.00006247038,0.000666722,0.00005779797,0.0014864362,0.00008190236,0.000012240879],"category_scores_gemma":[0.000074467804,0.000082862156,0.00008409713,0.00045935286,0.00019331805,0.0003404407,0.00023297648,0.00029721105,0.00000204467],"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.00045200821,0.0005963344,0.1136467,0.0011793425,0.0018246061,0.000034090175,0.23844257,0.04114861,0.0018709387,0.14133747,0.21788639,0.24158093],"study_design_scores_gemma":[0.0049143066,0.0014599059,0.40049642,0.0027474808,0.0003383854,0.000050353363,0.041281946,0.0877995,0.0016092833,0.0031044285,0.45462793,0.0015700659],"about_ca_topic_score_codex":0.3919808,"about_ca_topic_score_gemma":0.7048183,"teacher_disagreement_score":0.3128375,"about_ca_system_score_codex":0.00006365694,"about_ca_system_score_gemma":0.00021854082,"threshold_uncertainty_score":0.61206806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29316315,0.00047910723,0.6984909,0.0020077534,0.00095789897,0.0019838624,0.00031074873,0.0018291314,0.000777419],"genre_scores_gemma":[0.72611934,0.00026257496,0.2691822,0.0000669671,0.00007594766,0.000007926388,0.0004432996,0.000120377765,0.0037213704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949653,0.0001740472,0.00078287453,0.002189348,0.00063002977,0.0012583742],"domain_scores_gemma":[0.99367017,0.00026626964,0.002577801,0.0020310837,0.0012731553,0.00018155227],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.000569547,0.001072506,0.0022514332,0.0035444119,0.0013599618,0.00006546082,0.004845452,0.0029723803,0.0000353637],"category_scores_gemma":[0.00015497177,0.0012323529,0.00078628666,0.0033869566,0.0010711518,0.0005723603,0.00087548804,0.0014587527,0.000021587784],"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.020309368,0.007915395,0.01652539,0.0072140684,0.019481067,0.003914625,0.011812602,0.0393023,0.009413323,0.5471895,0.040225398,0.276697],"study_design_scores_gemma":[0.04555888,0.015382494,0.0030384273,0.021605875,0.004280518,0.00044514873,0.068265356,0.70415086,0.039770488,0.0055201086,0.08094309,0.011038768],"about_ca_topic_score_codex":0.00075012224,"about_ca_topic_score_gemma":0.003565923,"teacher_disagreement_score":0.66484857,"about_ca_system_score_codex":0.0007741757,"about_ca_system_score_gemma":0.00044109352,"threshold_uncertainty_score":0.99994016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9198759,0.00038764317,0.0788898,0.00014358333,0.00011341329,0.00022525528,0.0000035813498,0.000054612818,0.00030617643],"genre_scores_gemma":[0.99902475,0.000053794356,0.00014666034,0.000009867716,0.00003195245,0.0000031749998,0.0000037619707,0.0000060747366,0.00071994116],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99895525,0.00014636533,0.000090584304,0.00032315255,0.00014215078,0.00034250715],"domain_scores_gemma":[0.99911314,0.0001798133,0.00013332586,0.00024263408,0.000063797954,0.00026727948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014432253,0.00015139392,0.0001765778,0.00008408154,0.0006962783,0.00008759765,0.00017982718,0.00006488832,0.000011396277],"category_scores_gemma":[0.000021428954,0.00013795073,0.00006083214,0.00021580479,0.00015040326,0.0010020452,0.00007802277,0.00016384925,0.0000013472096],"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.0026612605,0.0005749283,0.9428265,0.00012379911,0.00018435252,0.0000796596,0.0033711968,0.00034886788,0.0022335094,0.042452555,0.00013809773,0.005005248],"study_design_scores_gemma":[0.00036728557,0.00016557793,0.97807956,0.000053036478,0.00004211137,0.000012749337,0.00053458405,0.020242214,0.00007458219,0.00018380747,0.00008508605,0.00015943358],"about_ca_topic_score_codex":0.00031861846,"about_ca_topic_score_gemma":0.00011465132,"teacher_disagreement_score":0.079148844,"about_ca_system_score_codex":0.00007762622,"about_ca_system_score_gemma":0.00013045789,"threshold_uncertainty_score":0.56254673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12505837,0.0021614316,0.0035243072,0.004579275,0.01089324,0.00081746606,0.00024096631,0.00009885322,0.8526261],"genre_scores_gemma":[0.91637474,0.00007122149,0.0009545331,0.0016421527,0.00033574124,0.000023155615,0.000060612376,0.000044244767,0.080493584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966746,0.00008404062,0.0005322807,0.00053625915,0.0017254862,0.00044731217],"domain_scores_gemma":[0.9986693,0.00015686128,0.00034072378,0.00052659295,0.0000028386653,0.0003036656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000023118211,0.00037419773,0.00043013095,0.000054350345,0.00027576665,0.00016652276,0.00081008486,0.00013716587,0.00007639845],"category_scores_gemma":[0.0000029749044,0.00033819184,0.00007600363,0.000104895626,0.00003847434,0.0007255682,0.00017569118,0.0004692024,3.3086383e-8],"study_design_candidate":"theoretical_or_conceptual","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.0008460839,0.00012764194,0.009936377,0.0017616122,0.0014942038,0.00073509634,0.0022011108,0.00034955266,0.023924423,0.85951954,0.035406332,0.063697994],"study_design_scores_gemma":[0.0016879966,0.00041541527,0.07836679,0.0019383141,0.000268548,0.00008402432,0.0032897906,0.033904515,0.17588285,0.01240226,0.68845105,0.0033084701],"about_ca_topic_score_codex":0.0067995447,"about_ca_topic_score_gemma":0.233176,"teacher_disagreement_score":0.8471173,"about_ca_system_score_codex":0.000011590978,"about_ca_system_score_gemma":0.0015865122,"threshold_uncertainty_score":0.999907},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004184844,0.0021416054,0.023498531,0.0025735605,0.009340229,0.0013489455,0.00011655454,0.000564877,0.9603738],"genre_scores_gemma":[0.02341506,0.000039692557,0.0012081318,0.000861778,0.00307563,0.00011985481,0.00007871151,0.00031898255,0.9708822],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976661,0.00014338251,0.00037045812,0.0006014313,0.0003531293,0.00086549076],"domain_scores_gemma":[0.9977746,0.000058635986,0.00031005696,0.0011922062,0.000072373834,0.00059214426],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034269987,0.00041553745,0.0004954166,0.00038942028,0.00017527086,0.00022986381,0.0010132423,0.0006976637,0.0029692708],"category_scores_gemma":[0.000038996903,0.00036462938,0.00016653337,0.00038479685,0.000045209857,0.00017171126,0.00022409187,0.00050740055,0.0021752277],"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.0000025431336,0.000027856106,0.00019777233,0.00004668554,0.00007512799,0.000034441935,0.00014963745,0.000002001581,0.0000066129487,0.005453311,0.9913888,0.0026152371],"study_design_scores_gemma":[0.00025314814,0.000036804737,0.00025099528,0.00016512033,0.000018963749,0.00005344055,0.0000045924403,0.00044016703,0.000025738544,0.000054844742,0.998245,0.00045120716],"about_ca_topic_score_codex":0.015732499,"about_ca_topic_score_gemma":0.12694974,"teacher_disagreement_score":0.11121724,"about_ca_system_score_codex":0.0003947075,"about_ca_system_score_gemma":0.0002717706,"threshold_uncertainty_score":0.99988055},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2328651e-7,0.31326917,0.34774944,0.00089461403,0.000767827,0.009291729,0.026136475,0.0009461446,0.30094448],"genre_scores_gemma":[0.00019925124,0.0048476006,0.4331835,0.02561546,0.0024641417,0.026177756,0.09945165,0.0011674144,0.40689325],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934881,0.0052699894,0.0002951532,0.00038846929,0.00017388216,0.0003844038],"domain_scores_gemma":[0.99652135,0.0021325368,0.000185481,0.00089888065,0.00019521649,0.00006655071],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003477306,0.00021083964,0.0005293315,0.00015495376,0.00069665536,0.00021549819,0.0008299614,0.00017707977,0.014032805],"category_scores_gemma":[0.002005531,0.00019485108,0.000113681854,0.00034842908,0.000015462048,0.00011271863,0.00032666043,0.0009223889,0.000052042713],"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.000001457341,0.000012635743,6.007848e-7,0.014137596,0.000031817643,6.951001e-7,0.00008322191,0.0000026589723,4.3572678e-7,0.00033451803,0.97956413,0.005830231],"study_design_scores_gemma":[0.00021467975,0.000027692133,0.0000012320447,0.40614188,0.000010307415,0.0000023451441,0.0000071572185,0.0040746448,0.000026410333,0.00014342998,0.58917767,0.00017255473],"about_ca_topic_score_codex":0.00024597484,"about_ca_topic_score_gemma":0.000072032795,"teacher_disagreement_score":0.39200428,"about_ca_system_score_codex":0.000045355016,"about_ca_system_score_gemma":0.00029687045,"threshold_uncertainty_score":0.9868685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22633508,0.000009115804,0.7697102,0.000044854925,0.000067868576,0.000033573135,9.040695e-8,0.000023477718,0.0037757673],"genre_scores_gemma":[0.992367,0.0000017058369,0.0073144007,0.000104346145,0.000017828079,0.000001292703,6.745403e-7,0.0000013124308,0.00019141134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956155,0.000013974306,0.00015323571,0.00010408328,0.00009263247,0.000074515374],"domain_scores_gemma":[0.99968374,0.000027631304,0.00006342984,0.00012534743,0.000075582015,0.000024270643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003210058,0.000044634668,0.00009133828,0.0003485459,0.000033395158,0.00004074346,0.00006453106,0.0000259758,0.0000071934996],"category_scores_gemma":[0.0000019497686,0.000028445065,0.000037563826,0.00096364383,0.000012823668,0.00028101963,0.000014894288,0.000034593333,9.53417e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001719795,0.00020392043,0.20216724,0.000091234375,0.0016276265,0.000011751299,0.007362093,0.0014342027,0.0108969845,0.6137937,0.0029983378,0.15924095],"study_design_scores_gemma":[0.00087870023,0.0008693213,0.27499956,0.00008047769,0.00021955319,0.00013961623,0.001901443,0.6882096,0.02884428,0.0024750882,0.0009206763,0.0004616591],"about_ca_topic_score_codex":0.00018169053,"about_ca_topic_score_gemma":0.00085354334,"teacher_disagreement_score":0.766032,"about_ca_system_score_codex":0.000008301665,"about_ca_system_score_gemma":0.0000029019936,"threshold_uncertainty_score":0.11599561},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065400586,0.00040364868,0.9871658,0.0002904047,0.0015628147,0.00022364901,0.0000026865087,0.00008966652,0.0037212707],"genre_scores_gemma":[0.9221059,0.000035130233,0.076233245,0.00027483457,0.0008612037,0.0000035853893,0.0000050590565,0.000009541257,0.0004715026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987277,0.00007734717,0.00038052833,0.00035162515,0.00027176712,0.00019108092],"domain_scores_gemma":[0.9991908,0.00023111684,0.00014230552,0.0001591488,0.00018066738,0.000095932155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074657204,0.00015955056,0.00025034617,0.000111284615,0.00014928015,0.00011883602,0.00015405455,0.00007964475,0.000014220655],"category_scores_gemma":[0.0000061935953,0.00013287074,0.000041513285,0.000086255066,0.00015374854,0.00038082886,0.00010594555,0.000091436596,0.000008299045],"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.00009997414,0.000097724434,0.00011866284,0.000058135836,0.000062700536,0.00000878115,0.003305613,0.014666692,0.000065247295,0.90460473,0.00662448,0.07028728],"study_design_scores_gemma":[0.00056316063,0.00020790151,0.0008458074,0.00006951574,0.0000045579795,0.000026864416,0.000203778,0.9196279,0.00015539752,0.07731046,0.00080441305,0.00018022179],"about_ca_topic_score_codex":0.00008434565,"about_ca_topic_score_gemma":0.000036633286,"teacher_disagreement_score":0.91556585,"about_ca_system_score_codex":0.000017193375,"about_ca_system_score_gemma":0.000008925031,"threshold_uncertainty_score":0.5418312},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18096256,0.000042741973,0.80654997,0.00019478206,0.00052379497,0.00015253974,4.614116e-7,0.0003032421,0.01126989],"genre_scores_gemma":[0.97937053,0.0000019001208,0.018727828,0.0005028585,0.0003375683,0.0000050605254,0.000005584015,0.000012116464,0.0010365441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863213,0.000016402175,0.00031225334,0.0003522801,0.00023738576,0.00044954589],"domain_scores_gemma":[0.99917424,0.00010148498,0.00008064247,0.0004149053,0.00009598095,0.00013272617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047866345,0.00016702413,0.00021397608,0.00005488761,0.00017666655,0.000072494964,0.0004536968,0.000068834,0.00004799859],"category_scores_gemma":[0.0000018758622,0.0001135265,0.00006591837,0.00051927875,0.000036478796,0.00027945696,0.000031694388,0.00013893227,0.000028604949],"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.00049808354,0.0003823686,0.22397722,0.00007553331,0.00039876174,0.0006028539,0.004709628,0.03572678,0.0030122583,0.70401156,0.0118869,0.014718073],"study_design_scores_gemma":[0.005306291,0.0025600593,0.33702648,0.0008079656,0.00010179727,0.0012774717,0.0013019388,0.55290085,0.007873231,0.008767825,0.07836193,0.0037141447],"about_ca_topic_score_codex":0.000152562,"about_ca_topic_score_gemma":0.0025575575,"teacher_disagreement_score":0.798408,"about_ca_system_score_codex":0.000030193587,"about_ca_system_score_gemma":0.0000268729,"threshold_uncertainty_score":0.4629476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019445673,0.0000050124772,0.78901315,0.00021608177,0.00033537264,0.000018529141,5.704509e-8,0.00014481439,0.19082129],"genre_scores_gemma":[0.962403,0.0000049263276,0.0034183045,0.00015713763,0.000041723433,6.7555504e-8,7.2960326e-8,8.9974355e-7,0.033973884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997407,0.000016669692,0.0000345634,0.00008940152,0.000050990184,0.000067660636],"domain_scores_gemma":[0.9997788,0.0000117933,0.0000104652545,0.00014894435,0.00002314396,0.000026826725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038408914,0.000024754023,0.0000345596,0.00002368034,0.00010187088,0.00000967509,0.00022277597,0.00001547258,0.000043474047],"category_scores_gemma":[0.0000013904472,0.000021618092,0.000022291897,0.000118119606,0.000010032162,0.00016027881,0.000051749885,0.000024963705,0.00014928047],"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.0000024013418,0.000028431503,0.0023042827,0.0000016926004,0.000010227617,0.00017936902,0.0010256469,0.00024734193,0.00008497295,0.8874468,0.10473015,0.003938687],"study_design_scores_gemma":[0.00028971903,0.000057363413,0.006276216,0.000004579225,8.532591e-7,0.00037123414,0.00009131936,0.14921659,0.00031117414,0.00032000203,0.8428829,0.00017809578],"about_ca_topic_score_codex":0.000058717476,"about_ca_topic_score_gemma":0.000016415488,"teacher_disagreement_score":0.94295734,"about_ca_system_score_codex":0.000009393397,"about_ca_system_score_gemma":0.000013148205,"threshold_uncertainty_score":0.19187483},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3050772,0.0026175596,0.26872754,0.0014086966,0.41514722,0.0014643106,0.000004350964,0.000103338505,0.0054497914],"genre_scores_gemma":[0.99210286,0.00011345661,0.00022847381,0.000161322,0.0072810478,0.0000075484554,3.709734e-7,0.000042727406,0.000062200445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928086,0.0009951828,0.0034029684,0.0005676173,0.0014609324,0.0007647222],"domain_scores_gemma":[0.9897406,0.0038979324,0.003455147,0.0008497343,0.0018003465,0.0002562458],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007231501,0.00073005754,0.0016415063,0.0006568914,0.0017729976,0.0029278651,0.0016702886,0.0004985778,0.0000059322115],"category_scores_gemma":[0.0011072303,0.00053486833,0.0005680006,0.0013976688,0.00019955903,0.00048246986,0.00067924056,0.0019463769,0.000009694361],"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.00016614636,0.0005505425,0.00003110093,0.0004824239,0.00045674472,0.000038443224,0.0022192367,0.0030180728,0.0001975308,0.9863199,0.0009331275,0.0055867163],"study_design_scores_gemma":[0.0047339373,0.0020982968,0.00004989521,0.0072875763,0.00026603008,0.00033174086,0.0015259412,0.7781129,0.0005947246,0.19348383,0.010849936,0.00066520774],"about_ca_topic_score_codex":0.000064530985,"about_ca_topic_score_gemma":0.0000015222643,"teacher_disagreement_score":0.79283607,"about_ca_system_score_codex":0.00037074878,"about_ca_system_score_gemma":0.00039836866,"threshold_uncertainty_score":0.99971026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53937286,0.0017944793,0.2098041,0.006274545,0.03755878,0.012196349,0.00004196434,0.002287103,0.19066982],"genre_scores_gemma":[0.8394505,0.00046878087,0.00021666528,0.00038781224,0.00035064435,0.00046409463,0.00042501706,0.00012243834,0.15811406],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995086,0.0009150701,0.001088025,0.0012378204,0.0008826892,0.000790368],"domain_scores_gemma":[0.9961566,0.000591521,0.000792118,0.0014910161,0.000752702,0.00021607785],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009510315,0.0007899208,0.00083174533,0.00064570515,0.0015116677,0.0011239912,0.0014020258,0.00081355614,0.00026621358],"category_scores_gemma":[0.00007869954,0.0008278083,0.0004721006,0.0016217391,0.000066712426,0.0004972754,0.00006641967,0.0009776526,0.001088722],"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.002241713,0.0007764801,0.000033513777,0.0007936135,0.0013953833,0.00007890002,0.727987,0.1888152,0.003608114,0.0073575163,0.027694346,0.03921821],"study_design_scores_gemma":[0.0029650242,0.0023927996,0.00053551124,0.0027852969,0.0002296354,0.00007780748,0.030019343,0.9277054,0.01899515,0.0010373557,0.010827138,0.0024295335],"about_ca_topic_score_codex":0.0010499046,"about_ca_topic_score_gemma":0.003202402,"teacher_disagreement_score":0.7388902,"about_ca_system_score_codex":0.0012925861,"about_ca_system_score_gemma":0.00082345796,"threshold_uncertainty_score":0.9999129},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03424085,0.0016576683,0.9172065,0.007996502,0.0049379086,0.0058799535,0.000026240741,0.0026341635,0.025420167],"genre_scores_gemma":[0.29904255,0.00050030806,0.64596546,0.0006520243,0.001033288,0.0040469286,0.00045671762,0.00037240586,0.047930304],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957725,0.00006907264,0.00092419534,0.0014510647,0.0006928348,0.0010903695],"domain_scores_gemma":[0.9965887,0.00004270316,0.0008272279,0.0018038685,0.0005695094,0.00016796705],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00029742243,0.0009043681,0.001233351,0.0014796661,0.00041439774,0.0003160253,0.0025219095,0.0015964713,0.00003590175],"category_scores_gemma":[0.00007744702,0.0007560693,0.00032708145,0.002125216,0.00021850687,0.0007603931,0.00026713993,0.0017161142,0.000037973932],"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.0020097152,0.0021435062,0.005311634,0.005337056,0.0050203092,0.0026270265,0.008048729,0.04674803,0.004249147,0.21055378,0.03874011,0.669211],"study_design_scores_gemma":[0.0030788304,0.0025808658,0.0001407669,0.006229833,0.00022310346,0.00084310136,0.0006300165,0.023382684,0.011415929,0.009036332,0.93959826,0.0028402659],"about_ca_topic_score_codex":0.00015434604,"about_ca_topic_score_gemma":0.0012407876,"teacher_disagreement_score":0.90085816,"about_ca_system_score_codex":0.00016069399,"about_ca_system_score_gemma":0.000417311,"threshold_uncertainty_score":0.99969965},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24977644,0.0032823032,0.6344537,0.0026649914,0.011322819,0.004665783,0.0005765425,0.0012926767,0.09196474],"genre_scores_gemma":[0.93561774,0.0072112065,0.0010408014,0.000112164555,0.00039399153,0.000002018669,0.00005299875,0.00014426172,0.055424813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.98953265,0.0016764936,0.0014272238,0.0029703816,0.0017109172,0.002682328],"domain_scores_gemma":[0.9913752,0.0007529884,0.0016321869,0.0031272024,0.0015337003,0.0015786963],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017374123,0.0016005352,0.002045153,0.0010040802,0.0026219657,0.0010072503,0.004084891,0.0010133006,0.0006567714],"category_scores_gemma":[0.00009784524,0.0019572962,0.0011338759,0.0035512764,0.0008690054,0.0062013017,0.0013201882,0.0022551268,0.00049943366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017072048,0.004921524,0.008864287,0.0039135786,0.0037723582,0.037608992,0.05852198,0.46374038,0.00032016129,0.2579214,0.032803018,0.11054027],"study_design_scores_gemma":[0.011133734,0.0016672896,0.007839144,0.01264646,0.00062905526,0.00060747255,0.049983036,0.28190938,0.00021942875,0.00013886654,0.6286069,0.004619242],"about_ca_topic_score_codex":0.014563581,"about_ca_topic_score_gemma":0.029137922,"teacher_disagreement_score":0.6858413,"about_ca_system_score_codex":0.0047217105,"about_ca_system_score_gemma":0.00078457454,"threshold_uncertainty_score":0.99967426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26630068,0.00037007706,0.7252699,0.000021236056,0.0015239547,0.0007682612,0.0000022799134,0.00010297067,0.005640619],"genre_scores_gemma":[0.9928077,0.0000043831815,0.0065896814,0.000017966815,0.00018837328,0.00016757374,0.00003551841,0.000023664285,0.0001651739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800384,0.00011623213,0.00061811507,0.0005517808,0.0004991404,0.00021086234],"domain_scores_gemma":[0.9985976,0.000161335,0.00023762499,0.00028054748,0.00066354766,0.000059335005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015074289,0.00022934332,0.00040829432,0.00029365197,0.00016146756,0.00018504204,0.00031414087,0.00023341236,0.0000023017867],"category_scores_gemma":[0.00012964095,0.00020243626,0.00013342194,0.00014204568,0.000009978605,0.00023674816,0.00003086108,0.00020222922,0.0000015477831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023479457,0.00010433283,0.000008053987,0.004711626,0.00019596837,0.000001966839,0.010839778,0.50101,0.0009895507,0.31187832,0.000019876794,0.17000571],"study_design_scores_gemma":[0.0007808462,0.00012127911,0.000007630817,0.0030007423,0.000045304143,0.000010921355,0.0014530726,0.991123,0.0008325562,0.0024187113,0.000004116659,0.00020180516],"about_ca_topic_score_codex":0.00012661022,"about_ca_topic_score_gemma":0.00026061395,"teacher_disagreement_score":0.726507,"about_ca_system_score_codex":0.00018677668,"about_ca_system_score_gemma":0.00022294378,"threshold_uncertainty_score":0.8255111},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021421194,0.000025260279,0.7655443,0.0021352663,0.00050478446,0.0011783913,0.000009100673,0.00012745999,0.20905425],"genre_scores_gemma":[0.9843781,6.932196e-7,0.015043783,0.00026313783,0.00005244683,0.00004844372,8.592799e-7,0.000011060582,0.00020146434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882096,0.000044567492,0.00034256623,0.00018183136,0.00042326425,0.00018682216],"domain_scores_gemma":[0.99853,0.00016325555,0.00023134991,0.0009359033,0.00008393027,0.00005559064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064662466,0.00013690133,0.00020243975,0.000020733247,0.00012640697,0.000092120004,0.0010841074,0.000045347428,0.000010215433],"category_scores_gemma":[0.000037381622,0.000065241904,0.000086799075,0.0002559548,0.00018126731,0.000052760264,0.00027491356,0.00015395075,0.000042382922],"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.0000022347085,0.00004303724,0.0000046086107,0.000017040482,0.000012652956,2.5870767e-7,0.0027323614,0.00047521704,0.00012299673,0.9913573,0.0049997587,0.00023248045],"study_design_scores_gemma":[0.00025127703,0.00007442417,0.000037191083,0.00012959602,0.000012694483,0.000017752687,0.00133264,0.21043722,0.0014437743,0.78428406,0.0017904803,0.00018888815],"about_ca_topic_score_codex":0.0000103485745,"about_ca_topic_score_gemma":0.0000065768386,"teacher_disagreement_score":0.9629569,"about_ca_system_score_codex":0.000029251138,"about_ca_system_score_gemma":0.00004151774,"threshold_uncertainty_score":0.26604876},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00826526,0.000543277,0.17015241,0.0040982044,0.018620333,0.004169511,0.07793433,0.004757797,0.71145886],"genre_scores_gemma":[0.9928942,4.2274633e-7,0.00017381759,0.0009073458,0.00104385,0.000090649344,0.0031755625,0.000010663339,0.0017035024],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990204,0.00004785807,0.00015818073,0.00031604143,0.00023025057,0.00022728392],"domain_scores_gemma":[0.9992371,0.000046259003,0.000080308,0.00043229168,0.00013348585,0.00007051513],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000073201794,0.00011753949,0.00009822699,0.00007795172,0.00018081737,0.00015953911,0.00045586211,0.00007384218,0.024092538],"category_scores_gemma":[0.00006834707,0.00010136961,0.000058635917,0.0002293552,0.0000040501423,0.0001830925,0.00014312465,0.00010856453,0.009359151],"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.0000055983855,0.000022814162,0.000008914466,0.000018538352,0.000008128691,0.0000067977667,0.00017280728,0.00005025159,0.000008589829,0.002943866,0.9915,0.005253649],"study_design_scores_gemma":[0.0003869034,0.0007047787,0.0012055138,0.0016750904,0.0000021483409,0.000040044604,0.00007778779,0.14433202,0.0024974116,0.00019991149,0.84850734,0.00037105975],"about_ca_topic_score_codex":0.0000044823637,"about_ca_topic_score_gemma":0.000012220647,"teacher_disagreement_score":0.9846289,"about_ca_system_score_codex":0.00006811538,"about_ca_system_score_gemma":0.00002231929,"threshold_uncertainty_score":0.99141216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36695167,0.00007953209,0.62846553,0.00038826335,0.0016944953,0.00011398211,8.41352e-7,0.000025391379,0.002280305],"genre_scores_gemma":[0.98395,0.0000025632735,0.014766032,0.000114372175,0.0009719397,0.00001111726,0.0000013515413,0.000017627952,0.00016499743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830455,0.00023727462,0.00066668674,0.00026593427,0.00015684539,0.00036871157],"domain_scores_gemma":[0.99757487,0.00082945375,0.0009474567,0.00024821365,0.00031688085,0.00008310407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067482784,0.00017962593,0.00046439713,0.0002448513,0.00014386879,0.00009312193,0.00053203665,0.00007445742,0.000020160995],"category_scores_gemma":[0.00013834459,0.0001528671,0.00022738727,0.00037466278,0.00009336827,0.00025928367,0.000058579328,0.00029536348,0.0000036366125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030183494,0.0018410642,0.0762381,0.000086623186,0.0010629671,0.0031104966,0.0014436578,0.48361105,0.0069645494,0.17072524,0.01244976,0.23944815],"study_design_scores_gemma":[0.0036565466,0.015102537,0.019929593,0.00034721484,0.000044534503,0.058772624,0.0010867442,0.8923092,0.0010388807,0.0041246084,0.002757283,0.00083022076],"about_ca_topic_score_codex":0.00015551061,"about_ca_topic_score_gemma":0.0000040204113,"teacher_disagreement_score":0.6169983,"about_ca_system_score_codex":0.000081696344,"about_ca_system_score_gemma":0.000044718465,"threshold_uncertainty_score":0.623374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5186224,0.00008442147,0.00059930776,0.0000868036,0.0026239746,0.00038647078,0.0000016461854,0.00014610258,0.47744888],"genre_scores_gemma":[0.891925,0.000019246718,0.000027054917,0.000006872404,0.00026428883,0.0000048169923,0.000028023123,0.000028016495,0.10769672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9960166,0.00081143866,0.00038727623,0.0010145582,0.0009026846,0.0008674473],"domain_scores_gemma":[0.99808687,0.0004478202,0.00021484355,0.00083312544,0.00024156233,0.00017579619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008010013,0.00031094346,0.00041429565,0.0029449721,0.0006020425,0.00039766266,0.0016310258,0.00041189478,0.000013643675],"category_scores_gemma":[0.000055594468,0.0003515948,0.00023462051,0.0025490683,0.00007566416,0.00042663526,0.00016381868,0.0016470822,0.000060087576],"study_design_candidate":"theoretical_or_conceptual","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.00077175937,0.00058106345,0.020992894,0.00042883604,0.0002061376,0.011660159,0.0018237678,0.0020402467,0.0027685019,0.92623305,0.026369512,0.006124039],"study_design_scores_gemma":[0.010778878,0.007971012,0.44951838,0.009939403,0.00013252562,0.00056654896,0.012712742,0.09838555,0.052308884,0.101008385,0.24752747,0.009150213],"about_ca_topic_score_codex":0.024434231,"about_ca_topic_score_gemma":0.04483405,"teacher_disagreement_score":0.8252247,"about_ca_system_score_codex":0.0009004746,"about_ca_system_score_gemma":0.0005324867,"threshold_uncertainty_score":0.9998936},"labels":[],"label_agreement":null}]}