{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001038353,0.0001960308,0.0002421602,0.0001884056,0.00009471795,0.0001482382,0.001357798,0.00007955117,0.0001809461],"category_scores_gemma":[0.0003414856,0.0002012846,0.00007577147,0.000750426,0.0001028134,0.002678927,0.000528516,0.0002546341,0.0003040983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007528155,"about_ca_system_score_gemma":0.0000872508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006071012,"about_ca_topic_score_gemma":0.00007185325,"domain_scores_codex":[0.998515,0.00004271289,0.0004504309,0.0002932197,0.0002806124,0.0004180051],"domain_scores_gemma":[0.9987589,0.0003154159,0.0001797286,0.0004291634,0.0001101607,0.0002066643],"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.0003705352,0.001209608,0.0205599,0.0006523283,0.0004420115,0.0004874025,0.3574978,0.00613475,0.02428087,0.06553327,0.08582834,0.4370032],"study_design_scores_gemma":[0.0005022982,0.0001672638,0.002553463,0.00006201168,0.00001034679,0.000006306603,0.005981295,0.9716187,0.003312902,0.0003902878,0.01498623,0.0004088833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3898316,0.0001143344,0.5845743,0.01491642,0.0008872704,0.0007252357,0.00009314829,0.0006027099,0.008254972],"genre_scores_gemma":[0.9313429,0.00002868013,0.06732006,0.001172983,0.00002791552,0.000002653821,0.0000191271,0.000008713947,0.00007699162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.965484,"threshold_uncertainty_score":0.8208149,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002396697,0.0002031521,0.0002460278,0.00005684813,0.0004219173,0.00006735337,0.001035055,0.0001174661,0.000004368393],"category_scores_gemma":[0.0001139952,0.0001402922,0.00008743579,0.00006956264,0.0002047541,0.00005324735,0.0006804021,0.00009256966,0.000007004945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004226054,"about_ca_system_score_gemma":0.00002718568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002776058,"about_ca_topic_score_gemma":0.00004252541,"domain_scores_codex":[0.9988641,0.00008901094,0.0003442795,0.0002014502,0.0001527546,0.0003484347],"domain_scores_gemma":[0.9981633,0.0001817144,0.0003931938,0.0009313755,0.0002224611,0.0001079244],"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.007277423,0.001470165,0.0397315,0.002389529,0.004604693,0.00002468847,0.009725607,0.02044493,0.701584,0.07773979,0.08159173,0.05341597],"study_design_scores_gemma":[0.04880819,0.005015106,0.02216731,0.005736669,0.0008370808,0.0002275644,0.03553799,0.6141717,0.008955971,0.00475193,0.2479309,0.005859578],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8120158,0.0002897495,0.1829264,0.001000736,0.00005986018,0.0008489867,0.0002963593,0.00007577715,0.002486429],"genre_scores_gemma":[0.968807,0.00008270698,0.03039316,0.0001854519,0.00001640484,0.00001666632,0.0003201475,0.0000152953,0.0001631517],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.692628,"threshold_uncertainty_score":0.5720952,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226616,0.0001812465,0.0001587059,0.0003617758,0.0004911207,0.000239306,0.001149955,0.00005120944,0.000142989],"category_scores_gemma":[0.00002675844,0.0001615609,0.00007948466,0.001125324,0.0003626331,0.002811193,0.0003158929,0.0001376251,0.000206671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003444731,"about_ca_system_score_gemma":0.00007068209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001390885,"about_ca_topic_score_gemma":0.00002575502,"domain_scores_codex":[0.9987724,0.00004540445,0.0002124392,0.0002425334,0.0003199769,0.0004072645],"domain_scores_gemma":[0.9986762,0.0001493336,0.0001575881,0.0006440064,0.0002099339,0.0001628782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000129265,0.00008043546,0.001598508,0.0000702313,0.0002617558,0.00004512933,0.02945258,0.00002579546,0.001076973,0.8973248,0.004668932,0.06526557],"study_design_scores_gemma":[0.01066865,0.01025525,0.03673896,0.002181232,0.0007127472,0.001096125,0.02109404,0.09645116,0.01012694,0.3572316,0.4467082,0.006735046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2214323,0.00001824557,0.7327378,0.0006931033,0.000253067,0.0002466428,0.00001446024,0.000418731,0.04418561],"genre_scores_gemma":[0.8683727,0.000006901805,0.1312263,0.0002978251,0.00001540208,0.00000255849,0.00000594744,0.000006435025,0.00006588692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6469404,"threshold_uncertainty_score":0.6588262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}