{"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":"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.2278194,0.00026448094,0.74896127,0.0011932186,0.00010756976,0.00018143357,0.00047991856,0.0026290282,0.018363664],"genre_scores_gemma":[0.8415752,0.0002121921,0.14762755,0.00038522432,0.00012036647,0.00040949136,0.0006013304,0.00047414115,0.008594439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650013,0.001074372,0.00028032498,0.0008261755,0.00082082616,0.00049813784],"domain_scores_gemma":[0.98291117,0.010812105,0.0008791641,0.0032733984,0.0015720412,0.0005521622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002817043,0.0006317637,0.0013061751,0.0010216185,0.0018612816,0.0030660785,0.0014130836,0.0015105739,0.003965887],"category_scores_gemma":[0.012838396,0.00089094165,0.0024092533,0.0009079147,0.0050382856,0.0050265794,0.0036290248,0.0032347052,0.00083476247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00013265476,0.000061617226,0.0006209147,0.00017676533,0.00006615943,0.0004248206,0.0009502346,0.057788346,0.005988775,0.9197891,0.0017981486,0.012202511],"study_design_scores_gemma":[0.00007243261,0.00003640435,0.000214693,0.000025249426,0.000042971005,0.00015964355,0.00010076133,0.09977495,0.008023853,0.8860448,0.0054609547,0.00004333509],"about_ca_topic_score_codex":0.0024300804,"about_ca_topic_score_gemma":0.0016390176,"teacher_disagreement_score":0.003965887,"about_ca_system_score_codex":0.0016638332,"about_ca_system_score_gemma":0.0027405927,"threshold_uncertainty_score":0.014898181},"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":"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.77828604,0.00012005133,0.21355343,0.00060223433,0.000056721867,0.00025106993,0.0013336493,0.0012915342,0.0045053554],"genre_scores_gemma":[0.9431497,0.000043018375,0.05267317,0.00012060569,0.000032628148,0.00012522006,0.0015754426,0.000112730464,0.0021674798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989605,0.0004902516,0.000036064885,0.00021117394,0.00015677708,0.00014520573],"domain_scores_gemma":[0.9944003,0.0037054918,0.00023880343,0.0009400656,0.00039012547,0.00032512378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086747203,0.0005061904,0.0006866202,0.00078410155,0.0006359111,0.00078752823,0.0011870628,0.0009949167,0.0030040173],"category_scores_gemma":[0.008100719,0.00048199328,0.00070388627,0.0009016568,0.00074505596,0.0010009535,0.0009448513,0.0007612022,0.00058375567],"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.0031436898,0.00044496203,0.015757263,0.00029930798,0.00019171445,0.00050151383,0.00044488523,0.8576481,0.026517624,0.037296157,0.007885599,0.04986915],"study_design_scores_gemma":[0.00008937698,0.00005466158,0.0008835387,0.00000570029,0.000015876418,0.000040958024,0.00005361634,0.9791955,0.003374651,0.015791925,0.00048524002,0.000009034471],"about_ca_topic_score_codex":0.0025876078,"about_ca_topic_score_gemma":0.00478127,"teacher_disagreement_score":0.0030040173,"about_ca_system_score_codex":0.00081299536,"about_ca_system_score_gemma":0.0006321902,"threshold_uncertainty_score":0.010049403},"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":"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.9566932,0.0002984141,0.028800378,0.00016878398,0.00010616746,0.00027527296,0.00061861915,0.0017394865,0.011299658],"genre_scores_gemma":[0.98471457,0.000049380385,0.011520523,0.00003967882,0.000018381761,0.000079559104,0.00083093083,0.00007664137,0.0026703775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976514,0.0007318066,0.00015829795,0.00038978315,0.000848866,0.00021978877],"domain_scores_gemma":[0.99702954,0.0011542719,0.0002876031,0.0001953135,0.00085809006,0.00047513066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021295534,0.0008711108,0.00081864937,0.0021275796,0.00055020605,0.0016438586,0.00077195605,0.00049192604,0.003999797],"category_scores_gemma":[0.009324814,0.00023257948,0.000280779,0.0008699131,0.00028944275,0.0016740025,0.0014087503,0.00046170465,0.0009546339],"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.01089676,0.005181541,0.120963864,0.0006653269,0.00048315333,0.00051097636,0.0022451915,0.06312709,0.044619612,0.0056834584,0.01667603,0.72894704],"study_design_scores_gemma":[0.0004547324,0.004759582,0.16676089,0.000087894,0.00018547048,0.00041741805,0.0013728176,0.781177,0.02403614,0.0071589276,0.013412656,0.00017658132],"about_ca_topic_score_codex":0.0038009696,"about_ca_topic_score_gemma":0.0034536796,"teacher_disagreement_score":0.003999797,"about_ca_system_score_codex":0.0007879588,"about_ca_system_score_gemma":0.00028247834,"threshold_uncertainty_score":0.013380647},"labels":[],"label_agreement":null}]}