{"meta":{"query_hash":"fab992e30a56","filters":{"venue":"FCS"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/fab992e30a56","api":"https://metacan.xera.ac/api/v1/cohort?venue=FCS"},"results":[{"id":"W22370945","doi":"10.4238/2012.february.17.4","title":"Superrecursive Hierarchies of Algorithmic Problems.","year":2005,"lang":"en","type":"article","venue":"FCS","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.011556755728297674,"score_gpt":0.22419334434387098,"score_spread":0.2126365886155733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22370945","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.108988024,0.0011436467,0.87494534,0.004123545,0.00096404843,0.00071040145,0.000013730963,0.0004835886,0.008627678],"genre_scores_gemma":[0.64508027,0.000034995704,0.35393447,0.00020279374,0.00032501644,0.00002750404,0.000003815221,0.000013808869,0.0003773406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984906,0.000086409294,0.00032445564,0.0004167109,0.00034435082,0.00033749672],"domain_scores_gemma":[0.9988182,0.00015634921,0.000088613044,0.00069776626,0.00014313881,0.00009591901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929963,0.00016096674,0.00024220449,0.00014105535,0.000071811606,0.000055618424,0.001108451,0.00006180324,0.00004341286],"category_scores_gemma":[0.000044530825,0.00014757448,0.00010070266,0.00046190966,0.0001348632,0.000404806,0.0004683102,0.00016752233,0.00009146474],"study_design_candidate":"design_other","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.0000074439517,0.00047499329,0.0018984806,0.0000997519,0.000056715373,0.000014908171,0.01339301,0.0067120986,0.0012742986,0.06046577,0.0033173275,0.9122852],"study_design_scores_gemma":[0.0016634066,0.0010169486,0.022011254,0.00011949099,0.000028091132,0.0001626805,0.0002149335,0.7636438,0.026469603,0.06702001,0.116415754,0.0012340352],"about_ca_topic_score_codex":0.00005588158,"about_ca_topic_score_gemma":0.000031169002,"teacher_disagreement_score":0.91105115,"about_ca_system_score_codex":0.000090009395,"about_ca_system_score_gemma":0.00011993441,"threshold_uncertainty_score":0.60179126},"labels":[],"label_agreement":null}]}