{"meta":{"query_hash":"9fb28bedb8d9","filters":{"venue":"Facta universitatis - series Electronics and Energetics"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/9fb28bedb8d9","api":"https://metacan.xera.ac/api/v1/cohort?venue=Facta+universitatis+-+series+Electronics+and+Energetics"},"results":[{"id":"W2028594193","doi":"10.2298/fuee0703331y","title":"Teaching Reed-Muller techniques in introductory classes on logic design","year":2007,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Experimental Learning in Engineering","field":"Engineering","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 Calgary","funders":"","keywords":"Mathematics education; Computer science; Logic synthesis; Logic gate; Mathematics; Algorithm","score_opus":0.006539755581221574,"score_gpt":0.20805125361741675,"score_spread":0.20151149803619517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028594193","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.8532874,0.0040767808,0.12064175,0.0003559274,0.0005086405,0.00035153184,0.0000070800143,0.0012794985,0.01949136],"genre_scores_gemma":[0.9608919,0.001120721,0.037420314,0.000038173705,0.000057691064,0.0000021591468,0.000011098998,0.000050927883,0.00040699242],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990593,0.000033298948,0.00015876844,0.0001977465,0.000117519405,0.00043331852],"domain_scores_gemma":[0.99963856,0.0001077607,0.000024400726,0.00014620702,0.00001657947,0.00006650497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023397371,0.00020646505,0.00016866287,0.00024159023,0.00009253379,0.00002669608,0.00012480565,0.000116060466,0.0000132225405],"category_scores_gemma":[0.000027943614,0.00023538465,0.00002414545,0.00013942004,0.00004474914,0.00019089629,0.000039308925,0.0004900973,0.0000023514592],"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.00022436945,0.000111022455,0.00082312274,0.00016024373,0.00016165605,0.00016580167,0.0048017697,0.327316,0.47302118,0.16583405,0.0032800885,0.024100715],"study_design_scores_gemma":[0.0010832773,0.0027412472,0.0019516778,0.00023632775,0.000058291258,0.00007456784,0.005887631,0.034041494,0.5014552,0.003118812,0.44724143,0.002110068],"about_ca_topic_score_codex":0.00001387136,"about_ca_topic_score_gemma":0.0000492454,"teacher_disagreement_score":0.44396135,"about_ca_system_score_codex":0.00036712445,"about_ca_system_score_gemma":0.000016287771,"threshold_uncertainty_score":0.95987076},"labels":[],"label_agreement":null},{"id":"W2032865003","doi":"10.2298/fuee1103451y","title":"The EXOR gate under uncertainty: A case study","year":2011,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Computer science; Probabilistic CTL; Probabilistic logic network; Theoretical computer science; Probabilistic argumentation; Subjective logic; Notation; Probabilistic analysis of algorithms; Artificial intelligence; Mathematics; Description logic; Arithmetic; Multimodal logic","score_opus":0.017175743630380706,"score_gpt":0.21873105369750367,"score_spread":0.20155531006712296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032865003","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.99753636,0.0009494605,0.0003481241,0.00010893732,0.00007548718,0.000109531786,0.0000061361184,0.000015064714,0.0008509124],"genre_scores_gemma":[0.9973255,0.0011802496,0.00030990122,0.00008636125,0.00003441745,0.0000022659456,0.000016848748,0.000010813863,0.0010336518],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991386,0.00008312597,0.0001193445,0.0002595895,0.00006680618,0.00033251185],"domain_scores_gemma":[0.9995675,0.000025572324,0.00005636262,0.0002052456,0.00006861269,0.000076696815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012604383,0.00014999491,0.00010515466,0.000018137693,0.00048526042,0.000038396236,0.00016074518,0.00008247214,0.000009433499],"category_scores_gemma":[0.00001902612,0.000105525236,0.00004211669,0.00007764654,0.00013747424,0.0000063830557,0.00019073444,0.00010555284,0.0000010329112],"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.0071115466,0.0037848945,0.051325437,0.00016685424,0.0069773793,0.009216632,0.031848483,0.007057476,0.35231057,0.27996692,0.014337353,0.23589644],"study_design_scores_gemma":[0.006113979,0.036655437,0.008547787,0.000034233286,0.00078526046,0.004895909,0.24409613,0.003097097,0.03544697,0.016392874,0.6403729,0.003561433],"about_ca_topic_score_codex":0.00014976895,"about_ca_topic_score_gemma":0.0013493721,"teacher_disagreement_score":0.6260356,"about_ca_system_score_codex":0.000018293478,"about_ca_system_score_gemma":0.000053623444,"threshold_uncertainty_score":0.43031943},"labels":[],"label_agreement":null},{"id":"W2044204081","doi":"10.2298/fuee1403317s","title":"Rapid exploration of cost-performance tradeoffs using dominance effect during design of hardware accelerators","year":2014,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Embedded Systems Design Techniques","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":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; CMC Microsystems; Ontario Innovation Trust","keywords":"Very-large-scale integration; Computer science; Modular design; Design space exploration; Parametric statistics; Process (computing); High-level synthesis; Computer architecture; Embedded system; Reliability engineering; Computer hardware; Computer engineering; Field-programmable gate array; Engineering; Mathematics","score_opus":0.021542786035339077,"score_gpt":0.21786175008442663,"score_spread":0.19631896404908755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044204081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44439107,0.00035960285,0.5548366,0.000026496777,0.000058706697,0.00020839472,0.0000031458692,0.000052187115,0.00006379184],"genre_scores_gemma":[0.9476735,0.0013965694,0.050853293,0.000006256817,0.0000113274455,0.0000046501427,0.0000030827994,0.000014078829,0.000037218175],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987754,0.00021004486,0.0002730069,0.00025883853,0.00020209057,0.0002805808],"domain_scores_gemma":[0.999066,0.00014338843,0.0002763456,0.0003285906,0.00013192144,0.000053738375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003230499,0.00018124179,0.00032772726,0.00016061169,0.00014464279,0.0000371939,0.0003820381,0.000093265,0.0000019249032],"category_scores_gemma":[0.000034965076,0.00018727979,0.000041333737,0.0003258737,0.00008239096,0.0013882412,0.00009472738,0.00010888983,2.3010047e-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.00043024466,0.00009009835,0.0012932412,0.0012485564,0.00018888668,0.000010588249,0.0076584388,0.029861785,0.818252,0.09170725,0.00027101862,0.048987865],"study_design_scores_gemma":[0.0004896427,0.0014309648,0.0002015051,0.00011919004,0.00002778827,0.000012971049,0.0001020942,0.094309136,0.9016421,0.00052733585,0.0008858706,0.0002514284],"about_ca_topic_score_codex":0.000012538873,"about_ca_topic_score_gemma":0.00000421342,"teacher_disagreement_score":0.5039833,"about_ca_system_score_codex":0.000094624185,"about_ca_system_score_gemma":0.00008275371,"threshold_uncertainty_score":0.7637048},"labels":[],"label_agreement":null},{"id":"W2050520617","doi":"10.2298/fuee1103385n","title":"A shared-cube approach to ESOP-based synthesis of reversible logic","year":2011,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toffoli gate; Reversible computing; Computer science; Logic gate; Cube (algebra); Function (biology); Quantum; Logic synthesis; Gate count; Quantum logic; Quantum computer; Theoretical computer science; Algorithm; Quantum gate; Mathematics; Embedded system; Physics; Quantum mechanics","score_opus":0.013315226930764354,"score_gpt":0.18786631679607588,"score_spread":0.17455108986531154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050520617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12848377,0.0008234835,0.85712737,0.0015005576,0.00020539094,0.00027386486,0.000063556974,0.00023839928,0.011283624],"genre_scores_gemma":[0.60732657,0.000081260376,0.3922501,0.00016752827,0.0000108365875,0.0000020837128,0.0000057870766,0.000011666664,0.00014413775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885625,0.000056679597,0.0001604145,0.00037600347,0.00017940377,0.00037126627],"domain_scores_gemma":[0.99922395,0.00007882224,0.0000951215,0.00036463584,0.00009640568,0.0001410459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012223638,0.00018404337,0.0002413074,0.00018160578,0.00017652084,0.00004464498,0.0006214933,0.0000755632,0.0000098516475],"category_scores_gemma":[0.000033905933,0.00017806899,0.000065018496,0.0004580215,0.00007206143,0.00019906776,0.00025238816,0.00013790643,0.0000020200118],"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.00016148355,0.00045905498,0.00041798115,0.00024476775,0.00021153227,0.000046201105,0.008967303,0.020691678,0.0025736843,0.9256768,0.0031178603,0.03743163],"study_design_scores_gemma":[0.0013599063,0.0043745907,0.0030864044,0.0002203419,0.00021218721,0.00009628409,0.0018726301,0.8451796,0.06512205,0.041857384,0.034496043,0.0021225878],"about_ca_topic_score_codex":0.00006005958,"about_ca_topic_score_gemma":0.000011237008,"teacher_disagreement_score":0.88381946,"about_ca_system_score_codex":0.000043116466,"about_ca_system_score_gemma":0.00012328735,"threshold_uncertainty_score":0.72614425},"labels":[],"label_agreement":null},{"id":"W2071237670","doi":"10.2298/fuee1402235s","title":"Execution time - area tradeoff in gausing residual load decoder: Integrated exploration of chaining based schedule and allocation in HLS for hardware accelerators","year":2014,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Embedded Systems Design Techniques","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":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; CMC Microsystems; Ontario Innovation Trust","keywords":"Chaining; Design space exploration; Computer science; High-level synthesis; Schedule; Heuristics; Multiplexer; Scheduling (production processes); Residual; Latency (audio); Execution time; Genetic algorithm; Parallel computing; Field-programmable gate array; Embedded system; Computer engineering; Real-time computing; Multiplexing; Mathematical optimization; Algorithm; Mathematics","score_opus":0.018702553592167385,"score_gpt":0.2252286630239944,"score_spread":0.20652610943182703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071237670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33609653,0.00020186203,0.66288465,0.00042699216,0.000025758934,0.00022554821,0.000007261923,0.000056255885,0.00007513788],"genre_scores_gemma":[0.9385913,0.00015400161,0.06111757,0.00002688426,0.0000060587254,0.000009382827,0.00004983723,0.000010680955,0.000034256736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898297,0.00012704503,0.00025086445,0.0002744425,0.00013560266,0.0002290974],"domain_scores_gemma":[0.9993738,0.0001420191,0.00014026107,0.00015824576,0.00014560492,0.000040095347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043420526,0.00013836315,0.00021365291,0.00026399075,0.00007978209,0.00006952801,0.00015454653,0.00011258514,0.0000011387112],"category_scores_gemma":[0.00009616785,0.00015594304,0.000017329041,0.00033219668,0.00004080572,0.00103892,0.000039483508,0.000103252445,9.1790334e-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.0006286325,0.00028628722,0.0031201646,0.00060058915,0.00010122854,0.0000143503385,0.030115345,0.022911698,0.37595418,0.5091191,0.0015181486,0.055630304],"study_design_scores_gemma":[0.001172731,0.0010495521,0.00031786997,0.00024193396,0.000016510125,0.0000040852296,0.0013357771,0.8350247,0.1508196,0.007592679,0.002049212,0.00037534916],"about_ca_topic_score_codex":0.00006785979,"about_ca_topic_score_gemma":0.00054480665,"teacher_disagreement_score":0.812113,"about_ca_system_score_codex":0.00020833076,"about_ca_system_score_gemma":0.00019724881,"threshold_uncertainty_score":0.63591725},"labels":[],"label_agreement":null},{"id":"W2735625861","doi":"10.2298/fuee1704459s","title":"A novel architecture with scalable security having expandable computational complexity for stream ciphers","year":2017,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Cryptographic Implementations and Security","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":"Stream cipher; Modulo; Computer science; Probabilistic logic; Theoretical computer science; Cryptography; Scalability; Polynomial; Cipher; S-box; Advanced Encryption Standard; Cryptanalysis; Keystream; Algorithm; Mathematics; Encryption; Discrete mathematics; Block cipher","score_opus":0.016318863626954786,"score_gpt":0.2440353214889099,"score_spread":0.22771645786195513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735625861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24289323,0.00010077661,0.7541472,0.0017400787,0.00007239882,0.00022369905,0.00018093252,0.00005915312,0.0005825727],"genre_scores_gemma":[0.7998188,0.000083038496,0.19982925,0.000059865317,0.000015948935,0.0000061344035,0.00008912306,0.000010346424,0.00008747713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988716,0.00001844526,0.00013511292,0.0003557364,0.00019925309,0.00041982773],"domain_scores_gemma":[0.99910545,0.0000750089,0.00015827635,0.00036968337,0.00017635025,0.00011522439],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00011257535,0.0001821449,0.00019129457,0.00008510941,0.0016566898,0.00048850424,0.0004953801,0.000054213488,0.000012755332],"category_scores_gemma":[0.00001531267,0.00017597062,0.000051577197,0.00011641015,0.00025422388,0.0006898298,0.00020474404,0.00013947922,2.2242428e-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.00009103406,0.00010614735,0.0014446067,0.000043865,0.00012973258,0.000004920941,0.0032629662,0.0038195252,0.00037634393,0.985751,0.0006431779,0.0043266932],"study_design_scores_gemma":[0.009359088,0.0039226506,0.017500203,0.00011722385,0.0002367361,0.0001876097,0.0066331564,0.28923514,0.0021844974,0.5458426,0.12267001,0.0021110915],"about_ca_topic_score_codex":0.00027553784,"about_ca_topic_score_gemma":0.002788725,"teacher_disagreement_score":0.5569256,"about_ca_system_score_codex":0.000060384293,"about_ca_system_score_gemma":0.00017084231,"threshold_uncertainty_score":0.999643},"labels":[],"label_agreement":null},{"id":"W3106721919","doi":"10.2298/fuee2004531i","title":"Higher-order structural constraints for improved optimization of nonuniform helical antennas","year":2020,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Milton District Hospital","funders":"","keywords":"Conductor; Curvature; Bandwidth (computing); Simple (philosophy); Computer science; Mathematics; Mathematical optimization; Geometry; Telecommunications","score_opus":0.007378954185320457,"score_gpt":0.18624054458900083,"score_spread":0.17886159040368038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106721919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058952514,0.001015611,0.93712246,0.0017449749,0.00011649626,0.00020875751,0.00026707735,0.00015242309,0.00041967205],"genre_scores_gemma":[0.971439,0.0016117934,0.02649838,0.00009756688,0.000029570529,0.0000011615882,0.00013939584,0.00002438603,0.00015872027],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999423,0.000007695934,0.00014967813,0.00013263374,0.000058674214,0.00022831823],"domain_scores_gemma":[0.999663,0.00002460636,0.000041542662,0.00006574763,0.00011193616,0.00009318362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001999531,0.00013807042,0.00021277898,0.000044279328,0.00007109558,0.000019804118,0.00008537598,0.000076510085,0.00007259875],"category_scores_gemma":[0.000012542018,0.00014090509,0.000054374937,0.00018357746,0.00010377304,0.00015274821,0.000020849671,0.00008216187,2.9466185e-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.0007852373,0.00005208375,0.00039817052,0.00088604604,0.0020229467,0.000016152262,0.003963082,0.28509656,0.53091574,0.15599671,0.0025003564,0.017366901],"study_design_scores_gemma":[0.00056041765,0.0003312371,0.00003345142,0.0000072531543,0.00010542481,0.0000019194656,0.000588823,0.9927613,0.0021566967,0.00036234365,0.0028765388,0.0002145664],"about_ca_topic_score_codex":0.000004040913,"about_ca_topic_score_gemma":0.000010207221,"teacher_disagreement_score":0.9124865,"about_ca_system_score_codex":0.000030124815,"about_ca_system_score_gemma":0.00003166531,"threshold_uncertainty_score":0.5745943},"labels":[],"label_agreement":null},{"id":"W4285231860","doi":"10.2298/fuee2202229b","title":"Optimal location and sizing of multiple distributed generators in radial distribution network using metaheuristic optimization algorithms","year":2022,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Optimal Power Flow Distribution","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Sizing; Overcurrent; Computer science; Mathematical optimization; Particle swarm optimization; Voltage; Robustness (evolution); Algorithm; Electric power system; Engineering; Power (physics); Mathematics; Electrical engineering","score_opus":0.005527805151867661,"score_gpt":0.17819844831322962,"score_spread":0.17267064316136196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285231860","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.5980154,0.0016047608,0.39954662,0.000020526228,0.00013594668,0.00010635631,0.000525275,0.000039982242,0.000005073204],"genre_scores_gemma":[0.98330224,0.0009689662,0.013315151,0.0000026943694,0.0000236381,0.000003986643,0.0023600762,0.000020373336,0.0000028608272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990531,0.00006492557,0.0002335462,0.00018723444,0.00014357448,0.00031762148],"domain_scores_gemma":[0.9996557,0.000045628625,0.00007585093,0.00009345319,0.00006802712,0.00006133204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001307859,0.00016171687,0.00020450278,0.00007408357,0.00023599443,0.00002882287,0.000072962976,0.00006434309,0.000010526604],"category_scores_gemma":[0.000030058296,0.00021592481,0.000023910605,0.00052948366,0.00006017953,0.00025315495,0.00008416551,0.00018040228,6.046298e-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.000046693527,0.000017619495,0.00078131596,0.000031563977,0.000039056424,0.000003920019,0.00014607249,0.9957491,0.001014302,0.0016805255,0.00007648791,0.00041329744],"study_design_scores_gemma":[0.0004943965,0.00018318112,0.0007338503,0.000009980784,0.00006499654,0.000011410211,0.00045358675,0.9958729,0.00085727737,0.00006257247,0.0010433862,0.0002124646],"about_ca_topic_score_codex":0.000051761093,"about_ca_topic_score_gemma":0.00003732332,"teacher_disagreement_score":0.38623148,"about_ca_system_score_codex":0.00045075273,"about_ca_system_score_gemma":0.000056661553,"threshold_uncertainty_score":0.8805158},"labels":[],"label_agreement":null},{"id":"W4404193885","doi":"10.2298/fuee2401195b","title":"The impact of blockchain technology on the environment","year":2024,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Blockchain Technology Applications and Security","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":"Humber Polytechnic","funders":"","keywords":"Blockchain; Computer science; Computer security","score_opus":0.004435539729968455,"score_gpt":0.20053578715141604,"score_spread":0.19610024742144758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404193885","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.9110583,0.010580568,0.033840526,0.042658854,0.00009709721,0.00027353907,0.000027400883,0.00026792445,0.0011957806],"genre_scores_gemma":[0.9953412,0.0034414271,0.0008940487,0.000018920342,0.0000047527437,0.0000065939466,0.0000013235043,0.0000060171087,0.00028574312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932665,0.000028272756,0.000103443635,0.00020567584,0.00009467964,0.00024130255],"domain_scores_gemma":[0.99927765,0.0001714029,0.00004132583,0.00046180276,0.000022065738,0.000025764271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013838257,0.00011209497,0.00009173559,0.00009659224,0.00036202007,0.00005281732,0.00059083285,0.00009594106,0.000007133463],"category_scores_gemma":[0.000011133774,0.000065557695,0.000051733503,0.0003678686,0.00031373644,0.000040079005,0.00021527284,0.0002478702,0.000003445519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030105414,0.000014308346,0.000023174236,0.0000024282294,0.00006378363,0.0000025275797,0.00021919892,0.0002909784,0.0009159065,0.9815004,0.00073671306,0.016227609],"study_design_scores_gemma":[0.00019742972,0.0018977023,0.00033053165,0.000025730555,0.000040689734,0.000045468943,0.0010690442,0.12131014,0.017520437,0.642346,0.2148534,0.00036338833],"about_ca_topic_score_codex":0.000014466715,"about_ca_topic_score_gemma":0.000015275942,"teacher_disagreement_score":0.33915433,"about_ca_system_score_codex":0.00007701629,"about_ca_system_score_gemma":0.00007368645,"threshold_uncertainty_score":0.27844024},"labels":[],"label_agreement":null}]}