{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05532558,0.0022421763,0.775855,0.0028600225,0.000944867,0.0005091173,0.00020135584,0.004661526,0.15740038],"genre_scores_gemma":[0.17886469,0.0040992764,0.7166762,0.0012582615,0.00040213825,0.0004467106,0.00040849592,0.0008508065,0.096993476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999281,0.00016807321,0.000044785742,0.00015221702,0.00024433224,0.00010956734],"domain_scores_gemma":[0.99856734,0.00079903385,0.000107194595,0.00015114235,0.00019414228,0.00018099866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012286203,0.0011428604,0.0005096078,0.0007330274,0.0008159171,0.0017093413,0.0011337277,0.0009309106,0.028810633],"category_scores_gemma":[0.003769784,0.00043427292,0.00053434254,0.00079266715,0.0010229241,0.0023754667,0.0019890734,0.0018888768,0.010465851],"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.00014918266,0.0010628514,0.0016869294,0.0006796529,0.000016210164,0.0005631673,0.0060577383,0.0050141737,0.052920684,0.18073355,0.05592413,0.69519186],"study_design_scores_gemma":[0.00012685372,0.0011116505,0.002834452,0.0007203118,0.00004050094,0.0029498579,0.0020936385,0.012181977,0.06384487,0.22426113,0.68973196,0.000102780024],"about_ca_topic_score_codex":0.00030753657,"about_ca_topic_score_gemma":0.00096440007,"teacher_disagreement_score":0.028810633,"about_ca_system_score_codex":0.0009252562,"about_ca_system_score_gemma":0.0010584384,"threshold_uncertainty_score":0.09638113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57689095,0.004755187,0.28122666,0.008050843,0.0003062826,0.00030547136,0.0010570413,0.0008018936,0.12660566],"genre_scores_gemma":[0.9749868,0.00075989804,0.017001223,0.00019019749,0.00006602981,0.000062482744,0.000086592816,0.00004119229,0.0068057505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987564,0.0003851068,0.00005648642,0.00015801119,0.00041579458,0.00022831732],"domain_scores_gemma":[0.99596846,0.0030665228,0.00023646248,0.00029015707,0.00028742527,0.00015091054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016273722,0.00057339086,0.0006543027,0.00066396745,0.0012901175,0.0017489535,0.0011634169,0.0025918582,0.0046846606],"category_scores_gemma":[0.0061752982,0.00019909027,0.0008820843,0.0011749918,0.002058672,0.0025123928,0.0017557264,0.001527341,0.00034187958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056092435,0.0002692198,0.0032255168,0.0003581551,0.00012473112,0.017816026,0.00068780704,0.32878974,0.0049138456,0.58351254,0.008011827,0.051729705],"study_design_scores_gemma":[0.00011819151,0.00039801362,0.0008865226,0.000042657706,0.00009122791,0.0033826982,0.00045443335,0.73376715,0.008753232,0.2336442,0.01838615,0.00007556022],"about_ca_topic_score_codex":0.0033608594,"about_ca_topic_score_gemma":0.002382048,"teacher_disagreement_score":0.0046846606,"about_ca_system_score_codex":0.0015048992,"about_ca_system_score_gemma":0.00077042973,"threshold_uncertainty_score":0.01567173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18703492,0.0006416793,0.8032778,0.00015257827,0.000020589936,0.00007138383,0.000040192983,0.00025026835,0.008510612],"genre_scores_gemma":[0.6898017,0.0004031472,0.30748197,0.000043339183,0.000016398792,0.00010062296,0.000056907247,0.000070680115,0.00202525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995807,0.00016419646,0.00001221636,0.000027015543,0.00017351504,0.00004234856],"domain_scores_gemma":[0.9991628,0.0006140883,0.00006456298,0.000043970096,0.00009200566,0.00002267381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010253618,0.0007248869,0.00044762617,0.00086235546,0.00030390697,0.0005792417,0.00043316174,0.00028527415,0.001479301],"category_scores_gemma":[0.0019694816,0.00033900482,0.00058902014,0.000393843,0.00030037513,0.00073176937,0.00065101165,0.00049064175,0.00014680332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013647262,0.0001309715,0.0027690965,0.0002349761,0.000060226746,0.0001574768,0.00021036241,0.737666,0.056046583,0.027045384,0.00054008176,0.1750024],"study_design_scores_gemma":[0.000010159338,0.00015486377,0.0006267929,0.000013660769,0.00001699927,0.000052719446,0.00003537975,0.98254436,0.007844448,0.0073595867,0.0013303994,0.000010626464],"about_ca_topic_score_codex":0.00068672193,"about_ca_topic_score_gemma":0.0013783586,"teacher_disagreement_score":0.001479301,"about_ca_system_score_codex":0.0003951924,"about_ca_system_score_gemma":0.0007304535,"threshold_uncertainty_score":0.0054227114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023362732,0.000313429,0.95664877,0.00024178352,0.00007577101,0.00010817941,0.00013775831,0.00055306917,0.018558493],"genre_scores_gemma":[0.40555218,0.00072491606,0.5785743,0.00018486285,0.000051120383,0.00029162638,0.000341891,0.00019153232,0.0140875885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996172,0.00006348077,0.000025874822,0.000055894252,0.0001888665,0.000048637874],"domain_scores_gemma":[0.9996854,0.00007078831,0.000023558789,0.00012681597,0.00007970733,0.00001370024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033873378,0.0004574899,0.0004640195,0.00039985048,0.00053055095,0.00072569866,0.0012361847,0.00045565979,0.004528696],"category_scores_gemma":[0.0005186272,0.00025625626,0.0006856491,0.00060335733,0.000926173,0.0013413542,0.001194602,0.0011108605,0.0007305921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018397364,0.000114027855,0.00024990411,0.00042821432,0.00006504383,0.00041131026,0.00022311074,0.23727843,0.118663095,0.42374232,0.0027574173,0.21588321],"study_design_scores_gemma":[0.00004391705,0.00025933344,0.00017716362,0.000045003122,0.000046077592,0.00031850408,0.000109838234,0.5170264,0.26925322,0.16426027,0.048411142,0.000049026006],"about_ca_topic_score_codex":0.000663469,"about_ca_topic_score_gemma":0.0018783531,"teacher_disagreement_score":0.004528696,"about_ca_system_score_codex":0.0007030215,"about_ca_system_score_gemma":0.0008383452,"threshold_uncertainty_score":0.015150011},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42009297,0.0004404969,0.57306844,0.00013489157,0.00002173517,0.00008100016,0.000053247186,0.0009813744,0.0051258407],"genre_scores_gemma":[0.8291477,0.00010141165,0.16890068,0.00004007408,0.0000069109365,0.000049636794,0.00005839153,0.00008712725,0.0016080904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968874,0.0001068444,0.000012082275,0.000037992053,0.00009836746,0.000056036384],"domain_scores_gemma":[0.99957234,0.00023198452,0.000059697537,0.00004820955,0.00006925234,0.000018504497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605578,0.00041061698,0.00029287988,0.00048802645,0.00020641027,0.00044958107,0.00050615636,0.0003376411,0.0009926959],"category_scores_gemma":[0.0011754541,0.0001696026,0.0002393806,0.0004318912,0.00027435916,0.00048179025,0.00034385946,0.0003041316,0.00013485743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030995446,0.00012352757,0.0021212017,0.00009259537,0.000032345495,0.00007149016,0.00013134991,0.7376036,0.0540962,0.004515149,0.00046452793,0.20043801],"study_design_scores_gemma":[0.000029177945,0.000319781,0.0006995135,0.000009416308,0.000019530611,0.000050618903,0.000039697785,0.9717723,0.02460124,0.0015362697,0.00091443205,0.000007985835],"about_ca_topic_score_codex":0.0018217614,"about_ca_topic_score_gemma":0.0031664378,"teacher_disagreement_score":0.0018217614,"about_ca_system_score_codex":0.0005433959,"about_ca_system_score_gemma":0.0010875444,"threshold_uncertainty_score":0.0039426684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1475927,0.0013623906,0.82320523,0.0006052076,0.0003642007,0.00021469766,0.00022049026,0.0035950928,0.02283996],"genre_scores_gemma":[0.7761701,0.0006616823,0.21229549,0.00028112874,0.00012818926,0.00016358483,0.00020874507,0.000109542096,0.0099817],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985373,0.00001799339,0.000013729519,0.000034716923,0.00004931569,0.00003049535],"domain_scores_gemma":[0.99986446,0.000020114781,0.000024947189,0.00003958126,0.000036268673,0.000014726817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013887891,0.00038977325,0.0003569475,0.00046788718,0.0003592866,0.00073657103,0.000687118,0.0003763497,0.0026096846],"category_scores_gemma":[0.00026380338,0.00019720758,0.0003501686,0.00028591673,0.00032680167,0.0013477871,0.00053443044,0.00059105846,0.00083105295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006304536,0.00017164958,0.0009848103,0.00040533493,0.00008071136,0.00065130985,0.00022353607,0.036212433,0.59865767,0.17474623,0.008740452,0.17849539],"study_design_scores_gemma":[0.00020077912,0.001504538,0.0010659876,0.00011289454,0.00017942712,0.0014627267,0.00006860473,0.51435035,0.3545423,0.040828884,0.08558491,0.00009855367],"about_ca_topic_score_codex":0.00032338744,"about_ca_topic_score_gemma":0.0005237455,"teacher_disagreement_score":0.0026096846,"about_ca_system_score_codex":0.0004928906,"about_ca_system_score_gemma":0.00044412885,"threshold_uncertainty_score":0.008730233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11144582,0.00034651184,0.86497545,0.00019199999,0.000055064345,0.000076416036,0.00019099972,0.0002786556,0.022439113],"genre_scores_gemma":[0.68859804,0.00048336788,0.30266723,0.00010744967,0.000032432465,0.00035784225,0.00030622788,0.00048109193,0.0069663688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997917,0.00005128294,0.00001218374,0.000023046356,0.000088975125,0.000032843465],"domain_scores_gemma":[0.99952114,0.00023543926,0.00008087322,0.000074764765,0.00007519308,0.000012534296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005454071,0.00067336374,0.0005576448,0.00037056,0.00025693048,0.0007636201,0.00041238437,0.0004593961,0.003037145],"category_scores_gemma":[0.0017985941,0.00034835594,0.00052141806,0.00041767853,0.00037794476,0.0005434533,0.0003953015,0.00065732625,0.0006307125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035661513,0.00003186405,0.0005210014,0.00009406998,0.000014313917,0.000049253737,0.00005418004,0.9283052,0.019441202,0.03507365,0.000517231,0.015862333],"study_design_scores_gemma":[0.00001399329,0.00005933181,0.0004298247,0.000017943767,0.000009057306,0.00003501532,0.000028144588,0.98072445,0.008566911,0.006640677,0.0034586312,0.000015938936],"about_ca_topic_score_codex":0.00095166755,"about_ca_topic_score_gemma":0.0020848121,"teacher_disagreement_score":0.003037145,"about_ca_system_score_codex":0.0005862055,"about_ca_system_score_gemma":0.00070733426,"threshold_uncertainty_score":0.010160267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10118004,0.0004949702,0.89300805,0.00019983636,0.000039652165,0.00011333995,0.00007395089,0.0002508755,0.0046392707],"genre_scores_gemma":[0.7099778,0.00022387285,0.28712174,0.00006990605,0.000024358838,0.00022321581,0.00010480498,0.000054647993,0.0021996137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981016,0.00008744991,0.000008648983,0.00003551667,0.00003312978,0.00002509085],"domain_scores_gemma":[0.99967,0.00020665654,0.000051322637,0.00001430808,0.000043404736,0.000014307616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005916525,0.0008026096,0.00072111527,0.00075331156,0.00029866036,0.00073620194,0.0006632604,0.0008485092,0.0011312239],"category_scores_gemma":[0.001256967,0.0004808898,0.00067280984,0.000675283,0.00037844083,0.000509904,0.00038638833,0.0004597457,0.00015146537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021050255,0.000015298663,0.00020012651,0.000014680556,0.0000138054365,0.000011373947,0.000009191862,0.98729336,0.00042760826,0.00082775607,0.0001241962,0.011041575],"study_design_scores_gemma":[0.000005118887,0.000012126954,0.000036598653,0.0000022533127,0.0000028254115,0.0000026573866,0.0000038143364,0.99934024,0.00012348632,0.00038732364,0.000082660845,9.978876e-7],"about_ca_topic_score_codex":0.0063503995,"about_ca_topic_score_gemma":0.0073208376,"teacher_disagreement_score":0.0063503995,"about_ca_system_score_codex":0.0008742707,"about_ca_system_score_gemma":0.0010843219,"threshold_uncertainty_score":0.012626886},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25217015,0.04383108,0.106947,0.04670384,0.0020661696,0.0001595768,0.00086825504,0.00048117232,0.5467728],"genre_scores_gemma":[0.9634872,0.015651157,0.004935907,0.0014530785,0.00041383554,0.000066954395,0.00011152518,0.00007486696,0.013805469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9972965,0.0010535904,0.00005945277,0.0002630364,0.00090030744,0.00042710945],"domain_scores_gemma":[0.9940082,0.003571232,0.0005892415,0.0004933188,0.0009699883,0.00036804876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019393807,0.00047641573,0.0003347512,0.00067314913,0.0012120075,0.0037369658,0.0006168813,0.0019458326,0.007247083],"category_scores_gemma":[0.005201148,0.00021290561,0.00032567265,0.0008454073,0.002257248,0.0061845845,0.0040464145,0.0014290771,0.0011283557],"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.00023678085,0.00012933086,0.005336242,0.00094492565,0.00010819991,0.0016870508,0.0006330007,0.079688996,0.0073664645,0.73737055,0.010200371,0.15629807],"study_design_scores_gemma":[0.00003683518,0.00045073187,0.004158188,0.0007515749,0.0000665895,0.00083086937,0.0012914172,0.037631646,0.009691404,0.7322835,0.21269056,0.000116742995],"about_ca_topic_score_codex":0.0016395585,"about_ca_topic_score_gemma":0.001235765,"teacher_disagreement_score":0.007247083,"about_ca_system_score_codex":0.0015589183,"about_ca_system_score_gemma":0.0014180102,"threshold_uncertainty_score":0.02424395},"labels":[],"label_agreement":null}]}