{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"551466161c30","filters":{"venue":"Acta Universitatis Sapientiae Informatica"}},"results":[{"id":"W3135862234","doi":"10.2478/ausi-2020-0011","title":"Improved balance in multiplayer online battle arena games","year":2020,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Informatica","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bishop's University","funders":"","keywords":"Battle; Computer science; Balance (ability); Big data; Virtuous circle and vicious circle; Matching (statistics); Competition (biology); Sample (material); Artificial intelligence; Computer security; Multimedia; Data mining; Psychology; Statistics; Mathematics","authors":[{"name":"Chailong Huang","is_ca":true},{"name":"Stefan D. Bruda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01837454340824885,"gpt":0.2376563787256511,"spread":0.2192818353174023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002129553,0.0008711108,0.0008186494,0.00212758,0.0005502061,0.001643859,0.0007719561,0.000491926,0.003999797],"category_scores_gemma":[0.009324814,0.0002325795,0.000280779,0.0008699131,0.0002894427,0.001674003,0.00140875,0.0004617047,0.0009546339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007879588,"about_ca_system_score_gemma":0.0002824783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00380097,"about_ca_topic_score_gemma":0.00345368,"domain_scores_codex":[0.9976514,0.0007318066,0.0001582979,0.0003897831,0.000848866,0.0002197888],"domain_scores_gemma":[0.9970295,0.001154272,0.0002876031,0.0001953135,0.0008580901,0.0004751307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01089676,0.005181541,0.1209639,0.0006653269,0.0004831533,0.0005109764,0.002245191,0.06312709,0.04461961,0.005683458,0.01667603,0.728947],"study_design_scores_gemma":[0.0004547324,0.004759582,0.1667609,0.000087894,0.0001854705,0.0004174181,0.001372818,0.781177,0.02403614,0.007158928,0.01341266,0.0001765813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9566932,0.0002984141,0.02880038,0.000168784,0.0001061675,0.000275273,0.0006186191,0.001739486,0.01129966],"genre_scores_gemma":[0.9847146,0.00004938039,0.01152052,0.00003967882,0.00001838176,0.0000795591,0.0008309308,0.00007664137,0.002670377],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003999797,"threshold_uncertainty_score":0.01338065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576274719","doi":"10.1515/ausi-2016-0007","title":"Parallel communicating grammar systems with context-free components are Turing complete for any communication model","year":2016,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Informatica","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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science; Grammar; USable; Programming language; Theoretical computer science; Linguistics","authors":[{"name":"Mary Sarah Ruth Wilkin","is_ca":true},{"name":"Stefan D. Bruda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02517941558516766,"gpt":0.2159921353478367,"spread":0.190812719762669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002817043,0.0006317637,0.001306175,0.001021618,0.001861282,0.003066079,0.001413084,0.001510574,0.003965887],"category_scores_gemma":[0.0128384,0.0008909417,0.002409253,0.0009079147,0.005038286,0.005026579,0.003629025,0.003234705,0.0008347625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001663833,"about_ca_system_score_gemma":0.002740593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00243008,"about_ca_topic_score_gemma":0.001639018,"domain_scores_codex":[0.9965001,0.001074372,0.000280325,0.0008261755,0.0008208262,0.0004981378],"domain_scores_gemma":[0.9829112,0.0108121,0.0008791641,0.003273398,0.001572041,0.0005521622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001326548,0.00006161723,0.0006209147,0.0001767653,0.00006615943,0.0004248206,0.0009502346,0.05778835,0.005988775,0.9197891,0.001798149,0.01220251],"study_design_scores_gemma":[0.00007243261,0.00003640435,0.000214693,0.00002524943,0.00004297101,0.0001596435,0.0001007613,0.09977495,0.008023853,0.8860448,0.005460955,0.00004333509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2278194,0.0002644809,0.7489613,0.001193219,0.0001075698,0.0001814336,0.0004799186,0.002629028,0.01836366],"genre_scores_gemma":[0.8415752,0.0002121921,0.1476275,0.0003852243,0.0001203665,0.0004094914,0.0006013304,0.0004741412,0.008594439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003965887,"threshold_uncertainty_score":0.01489818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2909715706","doi":"10.2478/ausi-2018-0010","title":"Sampling k-partite graphs with a given degree sequence","year":2018,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Informatica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bipartite graph; Combinatorics; Degree (music); Mathematics; Simple (philosophy); Simple graph; Graph; Sequence (biology); Complete bipartite graph; Discrete mathematics; Physics","authors":[{"name":"Koko K. Kayibi","is_ca":false},{"name":"U. Samee","is_ca":false},{"name":"S. Pirzada","is_ca":false},{"name":"Muhammad Ali Khan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03159057867134041,"gpt":0.239831801746831,"spread":0.2082412230754906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000867472,0.0005061904,0.0006866202,0.0007841015,0.0006359111,0.0007875282,0.001187063,0.0009949167,0.003004017],"category_scores_gemma":[0.008100719,0.0004819933,0.0007038863,0.0009016568,0.000745056,0.001000953,0.0009448513,0.0007612022,0.0005837557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008129954,"about_ca_system_score_gemma":0.0006321902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002587608,"about_ca_topic_score_gemma":0.00478127,"domain_scores_codex":[0.9989605,0.0004902516,0.00003606488,0.0002111739,0.0001567771,0.0001452057],"domain_scores_gemma":[0.9944003,0.003705492,0.0002388034,0.0009400656,0.0003901255,0.0003251238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00314369,0.000444962,0.01575726,0.000299308,0.0001917145,0.0005015138,0.0004448852,0.8576481,0.02651762,0.03729616,0.007885599,0.04986915],"study_design_scores_gemma":[0.00008937698,0.00005466158,0.0008835387,0.00000570029,0.00001587642,0.00004095802,0.00005361634,0.9791955,0.003374651,0.01579192,0.00048524,0.000009034471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.778286,0.0001200513,0.2135534,0.0006022343,0.00005672187,0.0002510699,0.001333649,0.001291534,0.004505355],"genre_scores_gemma":[0.9431497,0.00004301838,0.05267317,0.0001206057,0.00003262815,0.0001252201,0.001575443,0.0001127305,0.00216748],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003004017,"threshold_uncertainty_score":0.0100494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}