{"meta":{"query_hash":"2365652a4b5c","filters":{"venue":"Scientific Annals of Computer Science"},"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/2365652a4b5c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Scientific+Annals+of+Computer+Science"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09237339288894514,"score_gpt":0.32186944973573484,"score_spread":0.2294960568467897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573846983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18806762,0.00021313076,0.8102749,0.00054005015,0.0006586585,0.00011544064,0.0000036899823,0.00011279927,0.0000137399375],"genre_scores_gemma":[0.5127522,0.000007583309,0.48716983,0.000019387797,0.000024074783,0.0000016429193,1.0388442e-7,0.0000036413408,0.000021561062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973774,0.0000605472,0.0003499347,0.0009511684,0.00079916546,0.00046181734],"domain_scores_gemma":[0.99747705,0.00023287196,0.00020986189,0.0010131755,0.0009359524,0.00013108765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055606,0.00019141396,0.00030619497,0.00044922397,0.00020265044,0.0001374902,0.0018951361,0.00003062039,0.0000012715603],"category_scores_gemma":[0.000397748,0.000111497335,0.00004283606,0.0014453217,0.0020865612,0.0015038913,0.0007921598,0.000073259325,9.668805e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000028999548,0.000058764374,0.0005274501,0.000113266266,0.000019645895,0.0000065796407,0.0012459315,0.6280427,0.07074923,0.07355927,0.000078805584,0.22556937],"study_design_scores_gemma":[0.0003119267,0.00035647754,0.0027431517,0.00022832149,0.00000462214,0.000047514648,0.000019175004,0.63186425,0.21074057,0.15318236,0.00006512555,0.00043653307],"about_ca_topic_score_codex":0.0000037664854,"about_ca_topic_score_gemma":9.91717e-7,"teacher_disagreement_score":0.32468456,"about_ca_system_score_codex":0.000010336161,"about_ca_system_score_gemma":0.00022214036,"threshold_uncertainty_score":0.76880217},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; History; Programming language","score_opus":0.06472090157000439,"score_gpt":0.3354733992565607,"score_spread":0.27075249768655635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892627562","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.40908825,0.00023595968,0.58856833,0.0002945792,0.0014891275,0.00016009028,0.000008848625,0.000035478137,0.000119326636],"genre_scores_gemma":[0.9750988,0.000013354605,0.02469544,0.0000300595,0.00005522046,0.0000046367036,8.19566e-7,0.0000040014365,0.00009766448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997507,0.00010028684,0.00039148936,0.00075648515,0.00081579643,0.0004289826],"domain_scores_gemma":[0.9969396,0.00014871269,0.0003190162,0.0008634696,0.0015476451,0.00018156879],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031938178,0.00014727282,0.00025183713,0.000581863,0.00044123907,0.00033928608,0.0021010123,0.000030420682,0.000008430334],"category_scores_gemma":[0.000111706286,0.000116559815,0.00005909036,0.0021222623,0.0070049497,0.0019458674,0.0008325417,0.00008430193,0.0000054202364],"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.000025692741,0.00017275286,0.0005003971,0.000069108195,0.00001180686,9.610399e-7,0.014955041,0.00001875266,0.10253932,0.12239634,0.0006378289,0.758672],"study_design_scores_gemma":[0.00034816662,0.0009824369,0.011949177,0.00015829994,0.000002702982,0.000016710215,0.00014697066,0.21411702,0.73251027,0.029956874,0.009425871,0.00038549988],"about_ca_topic_score_codex":0.0000037421441,"about_ca_topic_score_gemma":0.000003550046,"teacher_disagreement_score":0.7582865,"about_ca_system_score_codex":0.000016974347,"about_ca_system_score_gemma":0.00028857743,"threshold_uncertainty_score":0.99569744},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04369925376803686,"score_gpt":0.28322512489695034,"score_spread":0.2395258711289135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378713939","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.5444541,0.000085453656,0.44904077,0.0016777196,0.0031701368,0.00013347475,0.000008256751,0.0004158539,0.0010142381],"genre_scores_gemma":[0.9658093,0.000013140221,0.03330355,0.00019477712,0.000067083034,0.0000016263588,0.0000022064098,0.0000056908575,0.0006026146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973501,0.000048759233,0.00025420287,0.0008622172,0.00089052605,0.00059418665],"domain_scores_gemma":[0.9984203,0.00007895956,0.00012799894,0.0008347719,0.00030835957,0.00022959584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027703901,0.00013922462,0.0001822476,0.00072552805,0.00057881046,0.00091197947,0.002401652,0.000033272354,0.000011206109],"category_scores_gemma":[0.000034592635,0.00012570366,0.000070780654,0.00386183,0.0021528052,0.0017015552,0.0017379792,0.00007986364,0.000085467684],"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.00001279154,0.00010769238,0.00043364355,0.000050100967,0.00001707607,0.00006931075,0.0030972788,0.00055361824,0.02136389,0.5526019,0.018970096,0.40272266],"study_design_scores_gemma":[0.00031715145,0.0001901735,0.019011494,0.00006904269,0.0000036131116,0.000044346354,0.0000761007,0.8887175,0.023783384,0.060139615,0.0072571696,0.00039041482],"about_ca_topic_score_codex":0.000007625453,"about_ca_topic_score_gemma":8.90758e-7,"teacher_disagreement_score":0.88816386,"about_ca_system_score_codex":0.000009438568,"about_ca_system_score_gemma":0.00023144847,"threshold_uncertainty_score":0.8794239},"labels":[],"label_agreement":null}]}