{"meta":{"query_hash":"551466161c30","filters":{"venue":"Acta Universitatis Sapientiae Informatica"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/551466161c30","api":"https://metacan.xera.ac/api/v1/cohort?venue=Acta+Universitatis+Sapientiae+Informatica"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science; Grammar; USable; Programming language; Theoretical computer science; Linguistics","score_opus":0.02517941558516766,"score_gpt":0.21599213534783668,"score_spread":0.190812719762669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576274719","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.8120158,0.00028974953,0.18292636,0.0010007359,0.00005986018,0.0008489867,0.00029635933,0.00007577715,0.002486429],"genre_scores_gemma":[0.968807,0.00008270698,0.030393165,0.0001854519,0.000016404842,0.000016666323,0.00032014755,0.0000152953,0.00016315174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886405,0.000089010944,0.0003442795,0.0002014502,0.0001527546,0.0003484347],"domain_scores_gemma":[0.99816334,0.00018171436,0.00039319377,0.0009313755,0.00022246108,0.000107924374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023966967,0.00020315209,0.00024602783,0.00005684813,0.00042191727,0.00006735337,0.001035055,0.000117466065,0.0000043683926],"category_scores_gemma":[0.00011399523,0.00014029225,0.000087435794,0.000069562644,0.00020475415,0.000053247353,0.0006804021,0.00009256966,0.000007004945],"study_design_candidate":"bench_or_experimental","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.007277423,0.0014701653,0.0397315,0.0023895286,0.0046046926,0.00002468847,0.009725607,0.020444933,0.701584,0.07773979,0.08159173,0.05341597],"study_design_scores_gemma":[0.048808187,0.0050151064,0.022167314,0.0057366686,0.0008370808,0.0002275644,0.035537988,0.61417174,0.008955971,0.0047519305,0.24793087,0.0058595785],"about_ca_topic_score_codex":0.000027760578,"about_ca_topic_score_gemma":0.00004252541,"teacher_disagreement_score":0.692628,"about_ca_system_score_codex":0.000042260537,"about_ca_system_score_gemma":0.00002718568,"threshold_uncertainty_score":0.5720952},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031590578671340415,"score_gpt":0.23983180174683097,"score_spread":0.20824122307549056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909715706","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.2214323,0.000018245568,0.73273784,0.0006931033,0.00025306703,0.00024664283,0.000014460244,0.00041873098,0.044185612],"genre_scores_gemma":[0.86837274,0.000006901805,0.13122633,0.0002978251,0.000015402084,0.0000025584898,0.0000059474396,0.0000064350247,0.000065886925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987724,0.000045404453,0.0002124392,0.00024253335,0.0003199769,0.0004072645],"domain_scores_gemma":[0.99867624,0.00014933365,0.00015758809,0.00064400636,0.0002099339,0.00016287816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022266162,0.00018124646,0.00015870592,0.00036177583,0.0004911207,0.00023930604,0.0011499551,0.00005120944,0.00014298901],"category_scores_gemma":[0.000026758442,0.00016156088,0.000079484664,0.001125324,0.00036263306,0.0028111935,0.00031589295,0.00013762513,0.000206671],"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.00012926498,0.000080435464,0.001598508,0.000070231305,0.00026175583,0.00004512933,0.029452575,0.000025795458,0.0010769734,0.8973248,0.0046689324,0.06526557],"study_design_scores_gemma":[0.010668652,0.010255246,0.03673896,0.0021812317,0.0007127472,0.0010961253,0.021094043,0.096451156,0.010126937,0.35723165,0.4467082,0.0067350464],"about_ca_topic_score_codex":0.000013908851,"about_ca_topic_score_gemma":0.00002575502,"teacher_disagreement_score":0.6469404,"about_ca_system_score_codex":0.00003444731,"about_ca_system_score_gemma":0.000070682094,"threshold_uncertainty_score":0.6588262},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018374543408248848,"score_gpt":0.2376563787256511,"score_spread":0.21928183531740225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135862234","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.38983163,0.000114334354,0.5845743,0.014916415,0.0008872704,0.0007252357,0.00009314829,0.00060270994,0.008254972],"genre_scores_gemma":[0.9313429,0.000028680126,0.06732006,0.0011729827,0.000027915523,0.000002653821,0.000019127096,0.000008713947,0.000076991615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998515,0.000042712894,0.00045043093,0.00029321967,0.00028061244,0.00041800507],"domain_scores_gemma":[0.99875885,0.0003154159,0.00017972864,0.00042916337,0.00011016072,0.00020666426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103835264,0.00019603084,0.00024216017,0.0001884056,0.00009471795,0.00014823819,0.0013577985,0.00007955117,0.00018094605],"category_scores_gemma":[0.00034148557,0.00020128462,0.00007577147,0.00075042597,0.00010281336,0.002678927,0.000528516,0.00025463413,0.0003040983],"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.00037053524,0.0012096084,0.020559898,0.0006523283,0.00044201146,0.00048740252,0.3574978,0.00613475,0.024280872,0.065533265,0.08582834,0.43700317],"study_design_scores_gemma":[0.00050229824,0.0001672638,0.0025534625,0.00006201168,0.000010346789,0.0000063066027,0.005981295,0.9716187,0.0033129016,0.00039028778,0.014986235,0.00040888326],"about_ca_topic_score_codex":0.000060710117,"about_ca_topic_score_gemma":0.000071853254,"teacher_disagreement_score":0.96548396,"about_ca_system_score_codex":0.00007528155,"about_ca_system_score_gemma":0.000087250795,"threshold_uncertainty_score":0.8208149},"labels":[],"label_agreement":null}]}