{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9fb28bedb8d9","filters":{"venue":"Facta universitatis - series Electronics and Energetics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"N. M. Nayeem","is_ca":true},{"name":"Jacqueline Rice","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01331522693076435,"gpt":0.1878663167960759,"spread":0.1745510898653115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003387338,0.0004574899,0.0004640195,0.0003998505,0.000530551,0.0007256987,0.001236185,0.0004556598,0.004528696],"category_scores_gemma":[0.0005186272,0.0002562563,0.0006856491,0.0006033573,0.000926173,0.001341354,0.001194602,0.00111086,0.0007305921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007030215,"about_ca_system_score_gemma":0.0008383452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000663469,"about_ca_topic_score_gemma":0.001878353,"domain_scores_codex":[0.9996172,0.00006348077,0.00002587482,0.00005589425,0.0001888665,0.00004863787],"domain_scores_gemma":[0.9996854,0.00007078831,0.00002355879,0.000126816,0.00007970733,0.00001370024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001839736,0.0001140279,0.0002499041,0.0004282143,0.00006504383,0.0004113103,0.0002231107,0.2372784,0.1186631,0.4237423,0.002757417,0.2158832],"study_design_scores_gemma":[0.00004391705,0.0002593334,0.0001771636,0.00004500312,0.00004607759,0.0003185041,0.0001098382,0.5170264,0.2692532,0.1642603,0.04841114,0.00004902601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02336273,0.000313429,0.9566488,0.0002417835,0.00007577101,0.0001081794,0.0001377583,0.0005530692,0.01855849],"genre_scores_gemma":[0.4055522,0.0007249161,0.5785743,0.0001848628,0.00005112038,0.0002916264,0.000341891,0.0001915323,0.01408759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004528696,"threshold_uncertainty_score":0.01515001,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nasreddine Belbachir","is_ca":false},{"name":"Mohamed Zellagui","is_ca":true},{"name":"Benaissa Bekkouche","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005527805151867661,"gpt":0.1781984483132296,"spread":0.172670643161362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005916525,0.0008026096,0.0007211153,0.0007533116,0.0002986604,0.0007362019,0.0006632604,0.0008485092,0.001131224],"category_scores_gemma":[0.001256967,0.0004808898,0.0006728098,0.000675283,0.0003784408,0.000509904,0.0003863883,0.0004597457,0.0001514654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008742707,"about_ca_system_score_gemma":0.001084322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006350399,"about_ca_topic_score_gemma":0.007320838,"domain_scores_codex":[0.9998102,0.00008744991,0.000008648983,0.00003551667,0.00003312978,0.00002509085],"domain_scores_gemma":[0.99967,0.0002066565,0.00005132264,0.00001430808,0.00004340474,0.00001430762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002105025,0.00001529866,0.0002001265,0.00001468056,0.00001380544,0.00001137395,0.000009191862,0.9872934,0.0004276083,0.0008277561,0.0001241962,0.01104158],"study_design_scores_gemma":[0.000005118887,0.00001212695,0.00003659865,0.000002253313,0.000002825411,0.000002657387,0.000003814336,0.9993402,0.0001234863,0.0003873236,0.00008266084,9.978876e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.10118,0.0004949702,0.8930081,0.0001998364,0.00003965216,0.0001133399,0.00007395089,0.0002508755,0.004639271],"genre_scores_gemma":[0.7099778,0.0002238728,0.2871217,0.00006990605,0.00002435884,0.0002232158,0.000104805,0.00005464799,0.002199614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006350399,"threshold_uncertainty_score":0.01262689,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prathap Siddavaatam","is_ca":true},{"name":"Reza Sedaghat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01631886362695479,"gpt":0.2440353214889099,"spread":0.2277164578619551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388789,0.0003897733,0.0003569475,0.0004678872,0.0003592866,0.000736571,0.000687118,0.0003763497,0.002609685],"category_scores_gemma":[0.0002638034,0.0001972076,0.0003501686,0.0002859167,0.0003268017,0.001347787,0.0005344304,0.0005910585,0.000831053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004928906,"about_ca_system_score_gemma":0.0004441288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003233874,"about_ca_topic_score_gemma":0.0005237455,"domain_scores_codex":[0.9998537,0.00001799339,0.00001372952,0.00003471692,0.00004931569,0.00003049535],"domain_scores_gemma":[0.9998645,0.00002011478,0.00002494719,0.00003958126,0.00003626867,0.00001472682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006304536,0.0001716496,0.0009848103,0.0004053349,0.00008071136,0.0006513098,0.0002235361,0.03621243,0.5986577,0.1747462,0.008740452,0.1784954],"study_design_scores_gemma":[0.0002007791,0.001504538,0.001065988,0.0001128945,0.0001794271,0.001462727,0.00006860473,0.5143504,0.3545423,0.04082888,0.08558491,0.00009855367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1475927,0.001362391,0.8232052,0.0006052076,0.0003642007,0.0002146977,0.0002204903,0.003595093,0.02283996],"genre_scores_gemma":[0.7761701,0.0006616823,0.2122955,0.0002811287,0.0001281893,0.0001635848,0.0002087451,0.0001095421,0.0099817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002609685,"threshold_uncertainty_score":0.008730233,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Humber Polytechnic","funders":"","keywords":"Blockchain; Computer science; Computer security","authors":[{"name":"Jelena Bačević","is_ca":false},{"name":"Petar Kočović","is_ca":false},{"name":"Predrag Ivković","is_ca":true},{"name":"Srecko Stankovic","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004435539729968455,"gpt":0.200535787151416,"spread":0.1961002474214476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001939381,0.0004764157,0.0003347512,0.0006731491,0.001212007,0.003736966,0.0006168813,0.001945833,0.007247083],"category_scores_gemma":[0.005201148,0.0002129056,0.0003256726,0.0008454073,0.002257248,0.006184584,0.004046415,0.001429077,0.001128356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001558918,"about_ca_system_score_gemma":0.00141801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001639558,"about_ca_topic_score_gemma":0.001235765,"domain_scores_codex":[0.9972965,0.00105359,0.00005945277,0.0002630364,0.0009003074,0.0004271095],"domain_scores_gemma":[0.9940082,0.003571232,0.0005892415,0.0004933188,0.0009699883,0.0003680488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0002367808,0.0001293309,0.005336242,0.0009449256,0.0001081999,0.001687051,0.0006330007,0.079689,0.007366464,0.7373706,0.01020037,0.1562981],"study_design_scores_gemma":[0.00003683518,0.0004507319,0.004158188,0.0007515749,0.0000665895,0.0008308694,0.001291417,0.03763165,0.009691404,0.7322835,0.2126906,0.000116743],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2521701,0.04383108,0.106947,0.04670384,0.00206617,0.0001595768,0.000868255,0.0004811723,0.5467728],"genre_scores_gemma":[0.9634872,0.01565116,0.004935907,0.001453078,0.0004138355,0.0000669544,0.0001115252,0.00007486696,0.01380547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007247083,"threshold_uncertainty_score":0.02424395,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Reza Sedaghat","is_ca":true},{"name":"Anirban Sengupta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02154278603533908,"gpt":0.2178617500844266,"spread":0.1963189640490876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025362,0.0007248869,0.0004476262,0.0008623555,0.000303907,0.0005792417,0.0004331617,0.0002852741,0.001479301],"category_scores_gemma":[0.001969482,0.0003390048,0.0005890201,0.000393843,0.0003003751,0.0007317694,0.0006510117,0.0004906417,0.0001468033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003951924,"about_ca_system_score_gemma":0.0007304535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006867219,"about_ca_topic_score_gemma":0.001378359,"domain_scores_codex":[0.9995807,0.0001641965,0.00001221636,0.00002701554,0.000173515,0.00004234856],"domain_scores_gemma":[0.9991628,0.0006140883,0.00006456298,0.0000439701,0.00009200566,0.00002267381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001364726,0.0001309715,0.002769097,0.0002349761,0.00006022675,0.0001574768,0.0002103624,0.737666,0.05604658,0.02704538,0.0005400818,0.1750024],"study_design_scores_gemma":[0.00001015934,0.0001548638,0.0006267929,0.00001366077,0.00001699927,0.00005271945,0.00003537975,0.9825444,0.007844448,0.007359587,0.001330399,0.00001062646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1870349,0.0006416793,0.8032778,0.0001525783,0.00002058994,0.00007138383,0.00004019298,0.0002502683,0.008510612],"genre_scores_gemma":[0.6898017,0.0004031472,0.307482,0.00004333918,0.00001639879,0.000100623,0.00005690725,0.00007068011,0.00202525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001479301,"threshold_uncertainty_score":0.005422711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics education; Computer science; Logic synthesis; Logic gate; Mathematics; Algorithm","authors":[{"name":"Svetlana Yanushkevich","is_ca":true},{"name":"V.P. Shmerko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006539755581221574,"gpt":0.2080512536174167,"spread":0.2015114980361952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122862,0.00114286,0.0005096078,0.0007330274,0.0008159171,0.001709341,0.001133728,0.0009309106,0.02881063],"category_scores_gemma":[0.003769784,0.0004342729,0.0005343425,0.0007926672,0.001022924,0.002375467,0.001989073,0.001888877,0.01046585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009252562,"about_ca_system_score_gemma":0.001058438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003075366,"about_ca_topic_score_gemma":0.0009644001,"domain_scores_codex":[0.999281,0.0001680732,0.00004478574,0.000152217,0.0002443322,0.0001095673],"domain_scores_gemma":[0.9985673,0.0007990338,0.0001071946,0.0001511423,0.0001941423,0.0001809987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001491827,0.001062851,0.001686929,0.0006796529,0.00001621016,0.0005631673,0.006057738,0.005014174,0.05292068,0.1807335,0.05592413,0.6951919],"study_design_scores_gemma":[0.0001268537,0.00111165,0.002834452,0.0007203118,0.00004050094,0.002949858,0.002093639,0.01218198,0.06384487,0.2242611,0.689732,0.00010278],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05532558,0.002242176,0.775855,0.002860022,0.000944867,0.0005091173,0.0002013558,0.004661526,0.1574004],"genre_scores_gemma":[0.1788647,0.004099276,0.7166762,0.001258262,0.0004021382,0.0004467106,0.0004084959,0.0008508065,0.09699348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02881063,"threshold_uncertainty_score":0.09638113,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Svetlana Yanushkevich","is_ca":true},{"name":"Hong Tran","is_ca":true},{"name":"G. Tangim","is_ca":true},{"name":"V.P. Shmerko","is_ca":true},{"name":"Elena Zaitseva","is_ca":false},{"name":"Vitaly Levashenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01717574363038071,"gpt":0.2187310536975037,"spread":0.201555310067123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627372,0.0005733909,0.0006543027,0.0006639675,0.001290118,0.001748953,0.001163417,0.002591858,0.004684661],"category_scores_gemma":[0.006175298,0.0001990903,0.0008820843,0.001174992,0.002058672,0.002512393,0.001755726,0.001527341,0.0003418796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001504899,"about_ca_system_score_gemma":0.0007704297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003360859,"about_ca_topic_score_gemma":0.002382048,"domain_scores_codex":[0.9987564,0.0003851068,0.00005648642,0.0001580112,0.0004157946,0.0002283173],"domain_scores_gemma":[0.9959685,0.003066523,0.0002364625,0.0002901571,0.0002874253,0.0001509105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005609244,0.0002692198,0.003225517,0.0003581551,0.0001247311,0.01781603,0.000687807,0.3287897,0.004913846,0.5835125,0.008011827,0.05172971],"study_design_scores_gemma":[0.0001181915,0.0003980136,0.0008865226,0.00004265771,0.00009122791,0.003382698,0.0004544333,0.7337672,0.008753232,0.2336442,0.01838615,0.00007556022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5768909,0.004755187,0.2812267,0.008050843,0.0003062826,0.0003054714,0.001057041,0.0008018936,0.1266057],"genre_scores_gemma":[0.9749868,0.000759898,0.01700122,0.0001901975,0.00006602981,0.00006248274,0.00008659282,0.00004119229,0.006805751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004684661,"threshold_uncertainty_score":0.01567173,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Anirban Sengupta","is_ca":false},{"name":"Reza Sedaghat","is_ca":true},{"name":"Vipul Kumar Mishra","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01870255359216738,"gpt":0.2252286630239944,"spread":0.206526109431827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605578,0.000410617,0.0002928799,0.0004880264,0.0002064103,0.0004495811,0.0005061564,0.0003376411,0.0009926959],"category_scores_gemma":[0.001175454,0.0001696026,0.0002393806,0.0004318912,0.0002743592,0.0004817903,0.0003438595,0.0003041316,0.0001348574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005433959,"about_ca_system_score_gemma":0.001087544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001821761,"about_ca_topic_score_gemma":0.003166438,"domain_scores_codex":[0.9996887,0.0001068444,0.00001208228,0.00003799205,0.00009836746,0.00005603638],"domain_scores_gemma":[0.9995723,0.0002319845,0.00005969754,0.00004820955,0.00006925234,0.0000185045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003099545,0.0001235276,0.002121202,0.00009259537,0.0000323455,0.00007149016,0.0001313499,0.7376036,0.0540962,0.004515149,0.0004645279,0.200438],"study_design_scores_gemma":[0.00002917795,0.000319781,0.0006995135,0.000009416308,0.00001953061,0.0000506189,0.00003969778,0.9717723,0.02460124,0.00153627,0.0009144321,0.000007985835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.420093,0.0004404969,0.5730684,0.0001348916,0.00002173517,0.00008100016,0.00005324719,0.0009813744,0.005125841],"genre_scores_gemma":[0.8291477,0.0001014116,0.1689007,0.00004007408,0.000006910936,0.00004963679,0.00005839153,0.00008712725,0.00160809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001821761,"threshold_uncertainty_score":0.003942668,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Milton District Hospital","funders":"","keywords":"Conductor; Curvature; Bandwidth (computing); Simple (philosophy); Computer science; Mathematics; Mathematical optimization; Geometry; Telecommunications","authors":[{"name":"Graeme Innes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007378954185320457,"gpt":0.1862405445890008,"spread":0.1788615904036804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005454071,0.0006733637,0.0005576448,0.00037056,0.0002569305,0.0007636201,0.0004123844,0.0004593961,0.003037145],"category_scores_gemma":[0.001798594,0.0003483559,0.0005214181,0.0004176785,0.0003779448,0.0005434533,0.0003953015,0.0006573263,0.0006307125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005862055,"about_ca_system_score_gemma":0.0007073343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009516675,"about_ca_topic_score_gemma":0.002084812,"domain_scores_codex":[0.9997917,0.00005128294,0.00001218374,0.00002304636,0.00008897512,0.00003284347],"domain_scores_gemma":[0.9995211,0.0002354393,0.00008087322,0.00007476476,0.00007519308,0.0000125343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003566151,0.00003186405,0.0005210014,0.00009406998,0.00001431392,0.00004925374,0.00005418004,0.9283052,0.0194412,0.03507365,0.000517231,0.01586233],"study_design_scores_gemma":[0.00001399329,0.00005933181,0.0004298247,0.00001794377,0.000009057306,0.00003501532,0.00002814459,0.9807245,0.008566911,0.006640677,0.003458631,0.00001593894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1114458,0.0003465118,0.8649755,0.000192,0.00005506435,0.00007641604,0.0001909997,0.0002786556,0.02243911],"genre_scores_gemma":[0.688598,0.0004833679,0.3026672,0.0001074497,0.00003243246,0.0003578422,0.0003062279,0.0004810919,0.006966369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003037145,"threshold_uncertainty_score":0.01016027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}