{"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":"2365652a4b5c","filters":{"venue":"Scientific Annals of Computer Science"}},"results":[{"id":"W4378713939","doi":"10.7561/sacs.2023.1.53","title":"Maximal Existential and Universal Width","year":2023,"lang":"en","type":"article","venue":"Scientific Annals of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Mathematics; Computation; Exponential function; Automaton; Finite-state machine; Polynomial; Tree (set theory); Discrete mathematics; Existentialism; Combinatorics; Algorithm; Mathematical analysis; Computer science","authors":[{"name":"Casey Keeler","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04369925376803686,"gpt":0.2832251248969503,"spread":0.2395258711289135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002513107,0.0007626615,0.0008365401,0.00130904,0.001032648,0.00324493,0.001677208,0.001053033,0.004465462],"category_scores_gemma":[0.01731294,0.0009348026,0.001708293,0.00115473,0.003511845,0.009381048,0.003897486,0.001952232,0.0007677733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074089,"about_ca_system_score_gemma":0.001158182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007085669,"about_ca_topic_score_gemma":0.0006146104,"domain_scores_codex":[0.9954275,0.0004828697,0.0006225985,0.0018021,0.0008015653,0.0008633091],"domain_scores_gemma":[0.9850092,0.008757539,0.00127371,0.002640703,0.001439605,0.0008793342],"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.0006694091,0.0001171697,0.01172662,0.0005751199,0.0001139926,0.0004410701,0.002104639,0.02579726,0.04072072,0.8469048,0.001822923,0.06900621],"study_design_scores_gemma":[0.00004292643,0.0001746296,0.003549836,0.0001563568,0.0001584955,0.001206533,0.0004899689,0.07562333,0.04806343,0.8584048,0.01202345,0.0001062038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3546587,0.001023867,0.6177697,0.0007454645,0.00009967325,0.0001204172,0.001579619,0.002135113,0.02186738],"genre_scores_gemma":[0.8864389,0.0003827756,0.1086373,0.0001731885,0.00007908231,0.0002346052,0.0006613715,0.0004187781,0.002974152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004465462,"threshold_uncertainty_score":0.01493847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573846983","doi":"10.7561/sacs.2016.1.69","title":"Faithful Modeling of Product Lines with Kripke Structures and Modal Logic","year":2016,"lang":"en","type":"article","venue":"Scientific Annals of Computer Science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kripke structure; Modal logic; Normal modal logic; Kripke semantics; Modal; Modal μ-calculus; Accessibility relation; Multimodal logic; Product (mathematics); Computer science; Mathematics; Algorithm; Programming language; Materials science; Model checking; Geometry; Description logic","authors":[{"name":"Zinovy Diskin","is_ca":true},{"name":"Aliakbar Safilian","is_ca":true},{"name":"Tom Maibaum","is_ca":true},{"name":"Shoham Ben-David","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09237339288894514,"gpt":0.3218694497357348,"spread":0.2294960568467897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001836263,0.0008051041,0.0005097564,0.001209735,0.000813762,0.002618125,0.002381629,0.001300979,0.002534786],"category_scores_gemma":[0.003724991,0.0007543874,0.00190881,0.0009541738,0.003786513,0.006047233,0.002237284,0.002503663,0.0005527886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002253836,"about_ca_system_score_gemma":0.001422041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003833405,"about_ca_topic_score_gemma":0.00402758,"domain_scores_codex":[0.9984188,0.0005164105,0.0001187697,0.000259328,0.0005327103,0.0001539727],"domain_scores_gemma":[0.9979745,0.000841971,0.0002854622,0.0006078818,0.0002106304,0.00007974031],"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.00002883992,0.00002888248,0.0001780774,0.00004872377,0.0000161913,0.0001179863,0.0003593579,0.06391889,0.001972144,0.9245356,0.0003118793,0.008483403],"study_design_scores_gemma":[0.00002823511,0.00003504291,0.0000857062,0.00003023603,0.00002249052,0.00006195846,0.0000641057,0.2617477,0.002834878,0.7284358,0.006633583,0.00002019705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008762929,0.00009667111,0.9868352,0.0001996191,0.00001323017,0.00003710594,0.00008313361,0.0004603448,0.003511823],"genre_scores_gemma":[0.4406863,0.0003997649,0.5532244,0.0001414196,0.00006381043,0.0002841099,0.000278342,0.0001989586,0.00472284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003833405,"threshold_uncertainty_score":0.01635277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2892627562","doi":"10.7561/sacs.2018.2.237","title":"A Precise Characterisation of Step Traces and Their Concurrent Histories","year":2018,"lang":"en","type":"article","venue":"Scientific Annals of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; History; Programming language","authors":[{"name":"Ryszard Janicki","is_ca":true},{"name":"Jetty Kleijn","is_ca":false},{"name":"Łukasz Mikulski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06472090157000439,"gpt":0.3354733992565607,"spread":0.2707524976865563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752616,0.0007100712,0.0006409679,0.002229573,0.00117511,0.002853179,0.001659848,0.001066092,0.005807317],"category_scores_gemma":[0.01132437,0.000732664,0.001008694,0.001728201,0.003406968,0.007472078,0.002355953,0.002562822,0.0009010298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001048157,"about_ca_system_score_gemma":0.001292825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002067252,"about_ca_topic_score_gemma":0.001530054,"domain_scores_codex":[0.9978908,0.000293807,0.0002097508,0.0005534175,0.0007853783,0.0002669618],"domain_scores_gemma":[0.9928227,0.002610868,0.000980233,0.001951261,0.001199338,0.0004356146],"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.00004440781,0.00002626122,0.0009719156,0.00008107685,0.00001490285,0.0002233241,0.0005811853,0.004257821,0.002915271,0.9776268,0.0003846452,0.01287236],"study_design_scores_gemma":[0.00002094341,0.00007143507,0.0008957693,0.00009224403,0.000040005,0.0004895718,0.0002389987,0.03656428,0.006126737,0.9344869,0.02093087,0.00004229894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06775242,0.0006830497,0.9110645,0.0003140006,0.0001042115,0.0002216748,0.0007711781,0.00084287,0.01824605],"genre_scores_gemma":[0.7494298,0.0007676951,0.229565,0.000235031,0.000219486,0.0005187711,0.001076265,0.0005006675,0.01768725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005807317,"threshold_uncertainty_score":0.01942736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}