{"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":"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.008762929,0.00009667111,0.9868352,0.00019961914,0.000013230175,0.000037105936,0.00008313361,0.00046034483,0.003511823],"genre_scores_gemma":[0.44068632,0.00039976492,0.5532244,0.00014141957,0.00006381043,0.0002841099,0.00027834196,0.00019895865,0.00472284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984188,0.00051641045,0.00011876975,0.00025932796,0.00053271034,0.00015397265],"domain_scores_gemma":[0.99797446,0.00084197096,0.00028546219,0.00060788175,0.0002106304,0.00007974031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018362629,0.0008051041,0.00050975644,0.0012097348,0.00081376196,0.0026181254,0.0023816288,0.0013009792,0.0025347858],"category_scores_gemma":[0.0037249913,0.00075438735,0.00190881,0.0009541738,0.003786513,0.0060472325,0.0022372836,0.0025036633,0.0005527886],"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.00002883992,0.000028882476,0.00017807737,0.000048723774,0.000016191298,0.00011798629,0.0003593579,0.06391889,0.0019721438,0.9245356,0.00031187927,0.008483403],"study_design_scores_gemma":[0.000028235107,0.000035042907,0.000085706204,0.000030236028,0.000022490516,0.00006195846,0.0000641057,0.26174766,0.002834878,0.7284358,0.0066335835,0.000020197047],"about_ca_topic_score_codex":0.0038334045,"about_ca_topic_score_gemma":0.0040275804,"teacher_disagreement_score":0.0038334045,"about_ca_system_score_codex":0.0022538365,"about_ca_system_score_gemma":0.0014220413,"threshold_uncertainty_score":0.016352773},"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":"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.06775242,0.0006830497,0.9110645,0.00031400064,0.00010421146,0.0002216748,0.0007711781,0.00084287,0.018246045],"genre_scores_gemma":[0.7494298,0.00076769514,0.22956496,0.00023503102,0.000219486,0.00051877106,0.0010762654,0.0005006675,0.01768725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978908,0.00029380698,0.00020975081,0.0005534175,0.00078537833,0.00026696178],"domain_scores_gemma":[0.9928227,0.0026108678,0.000980233,0.001951261,0.0011993384,0.00043561464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752616,0.00071007124,0.00064096786,0.0022295732,0.0011751105,0.0028531787,0.0016598476,0.0010660919,0.0058073173],"category_scores_gemma":[0.0113243675,0.00073266396,0.0010086937,0.0017282013,0.0034069684,0.0074720783,0.0023559525,0.0025628216,0.0009010298],"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.00004440781,0.000026261221,0.0009719156,0.00008107685,0.000014902853,0.00022332407,0.0005811853,0.0042578215,0.002915271,0.9776268,0.0003846452,0.012872358],"study_design_scores_gemma":[0.00002094341,0.00007143507,0.0008957693,0.00009224403,0.000040005,0.0004895718,0.0002389987,0.036564276,0.006126737,0.93448687,0.020930871,0.00004229894],"about_ca_topic_score_codex":0.0020672518,"about_ca_topic_score_gemma":0.0015300544,"teacher_disagreement_score":0.0058073173,"about_ca_system_score_codex":0.0010481566,"about_ca_system_score_gemma":0.0012928249,"threshold_uncertainty_score":0.01942736},"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":"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.3546587,0.0010238673,0.6177697,0.0007454645,0.00009967325,0.000120417186,0.0015796187,0.0021351133,0.021867383],"genre_scores_gemma":[0.8864389,0.0003827756,0.10863729,0.00017318854,0.00007908231,0.00023460518,0.0006613715,0.0004187781,0.0029741516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954275,0.00048286965,0.0006225985,0.0018021001,0.0008015653,0.0008633091],"domain_scores_gemma":[0.9850092,0.008757539,0.0012737102,0.0026407035,0.0014396049,0.00087933417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025131067,0.0007626615,0.00083654013,0.0013090395,0.0010326476,0.00324493,0.0016772082,0.0010530334,0.004465462],"category_scores_gemma":[0.01731294,0.00093480264,0.0017082935,0.0011547299,0.0035118454,0.009381048,0.0038974856,0.0019522319,0.0007677733],"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.00066940906,0.00011716969,0.0117266225,0.00057511986,0.0001139926,0.00044107006,0.002104639,0.025797255,0.040720716,0.8469048,0.0018229226,0.06900621],"study_design_scores_gemma":[0.000042926433,0.00017462956,0.0035498356,0.00015635684,0.00015849546,0.0012065326,0.00048996886,0.07562333,0.048063435,0.8584048,0.012023452,0.00010620382],"about_ca_topic_score_codex":0.00070856686,"about_ca_topic_score_gemma":0.00061461044,"teacher_disagreement_score":0.004465462,"about_ca_system_score_codex":0.0010740887,"about_ca_system_score_gemma":0.0011581823,"threshold_uncertainty_score":0.014938474},"labels":[],"label_agreement":null}]}