{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00277039,0.0001392246,0.0001822476,0.0007255281,0.0005788105,0.0009119795,0.002401652,0.00003327235,0.00001120611],"category_scores_gemma":[0.00003459263,0.0001257037,0.00007078065,0.00386183,0.002152805,0.001701555,0.001737979,0.00007986364,0.00008546768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009438568,"about_ca_system_score_gemma":0.0002314485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007625453,"about_ca_topic_score_gemma":8.90758e-7,"domain_scores_codex":[0.9973501,0.00004875923,0.0002542029,0.0008622172,0.000890526,0.0005941867],"domain_scores_gemma":[0.9984203,0.00007895956,0.0001279989,0.0008347719,0.0003083596,0.0002295958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001279154,0.0001076924,0.0004336436,0.00005010097,0.00001707607,0.00006931075,0.003097279,0.0005536182,0.02136389,0.5526019,0.0189701,0.4027227],"study_design_scores_gemma":[0.0003171515,0.0001901735,0.01901149,0.00006904269,0.000003613112,0.00004434635,0.0000761007,0.8887175,0.02378338,0.06013962,0.00725717,0.0003904148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5444541,0.00008545366,0.4490408,0.00167772,0.003170137,0.0001334748,0.000008256751,0.0004158539,0.001014238],"genre_scores_gemma":[0.9658093,0.00001314022,0.03330355,0.0001947771,0.00006708303,0.000001626359,0.00000220641,0.000005690858,0.0006026146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8881639,"threshold_uncertainty_score":0.8794239,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055606,0.000191414,0.000306195,0.000449224,0.0002026504,0.0001374902,0.001895136,0.00003062039,0.00000127156],"category_scores_gemma":[0.000397748,0.0001114973,0.00004283606,0.001445322,0.002086561,0.001503891,0.0007921598,0.00007325933,9.668805e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001033616,"about_ca_system_score_gemma":0.0002221404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003766485,"about_ca_topic_score_gemma":9.91717e-7,"domain_scores_codex":[0.9973774,0.0000605472,0.0003499347,0.0009511684,0.0007991655,0.0004618173],"domain_scores_gemma":[0.9974771,0.000232872,0.0002098619,0.001013175,0.0009359524,0.0001310877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002899955,0.00005876437,0.0005274501,0.0001132663,0.0000196459,0.000006579641,0.001245931,0.6280427,0.07074923,0.07355927,0.00007880558,0.2255694],"study_design_scores_gemma":[0.0003119267,0.0003564775,0.002743152,0.0002283215,0.00000462214,0.00004751465,0.000019175,0.6318642,0.2107406,0.1531824,0.00006512555,0.0004365331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1880676,0.0002131308,0.8102749,0.0005400502,0.0006586585,0.0001154406,0.000003689982,0.0001127993,0.00001373994],"genre_scores_gemma":[0.5127522,0.000007583309,0.4871698,0.0000193878,0.00002407478,0.000001642919,1.038844e-7,0.000003641341,0.00002156106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3246846,"threshold_uncertainty_score":0.7688022,"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003193818,0.0001472728,0.0002518371,0.000581863,0.0004412391,0.0003392861,0.002101012,0.00003042068,0.000008430334],"category_scores_gemma":[0.0001117063,0.0001165598,0.00005909036,0.002122262,0.00700495,0.001945867,0.0008325417,0.00008430193,0.000005420236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001697435,"about_ca_system_score_gemma":0.0002885774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003742144,"about_ca_topic_score_gemma":0.000003550046,"domain_scores_codex":[0.997507,0.0001002868,0.0003914894,0.0007564852,0.0008157964,0.0004289826],"domain_scores_gemma":[0.9969396,0.0001487127,0.0003190162,0.0008634696,0.001547645,0.0001815688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002569274,0.0001727529,0.0005003971,0.0000691082,0.00001180686,9.610399e-7,0.01495504,0.00001875266,0.1025393,0.1223963,0.0006378289,0.758672],"study_design_scores_gemma":[0.0003481666,0.0009824369,0.01194918,0.0001582999,0.000002702982,0.00001671022,0.0001469707,0.214117,0.7325103,0.02995687,0.009425871,0.0003854999],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4090883,0.0002359597,0.5885683,0.0002945792,0.001489128,0.0001600903,0.000008848625,0.00003547814,0.0001193266],"genre_scores_gemma":[0.9750988,0.0000133546,0.02469544,0.0000300595,0.00005522046,0.000004636704,8.19566e-7,0.000004001437,0.00009766448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7582865,"threshold_uncertainty_score":0.9956974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}