{"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":"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.1352164,0.009213793,0.7629804,0.009043109,0.00028422137,0.0003032604,0.0007520154,0.00074514485,0.08146163],"genre_scores_gemma":[0.7571873,0.0025013487,0.20879762,0.0009651154,0.0005439206,0.00050509215,0.0010735241,0.00019778677,0.02822829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963062,0.0016150597,0.0002475532,0.00047459104,0.00094985263,0.00040690493],"domain_scores_gemma":[0.98449177,0.012321388,0.00080440607,0.0010072457,0.00068592886,0.00068931916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004142302,0.0006988625,0.0011369815,0.0016828032,0.0015025416,0.0030204481,0.001704953,0.001769919,0.010149998],"category_scores_gemma":[0.015928807,0.00058810017,0.0012226402,0.001358643,0.002763,0.005722851,0.0033356466,0.002789982,0.000602448],"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.00005389793,0.000054244865,0.0009893711,0.0003087561,0.00007771679,0.00010316638,0.00055498135,0.025672296,0.00046163224,0.9349383,0.0050202883,0.031765305],"study_design_scores_gemma":[0.000028846252,0.000021031756,0.00031341126,0.000029709776,0.000014287027,0.00008367072,0.0000891355,0.0954861,0.00011410405,0.8984439,0.005367007,0.000008957099],"about_ca_topic_score_codex":0.0020993503,"about_ca_topic_score_gemma":0.005666315,"teacher_disagreement_score":0.010149998,"about_ca_system_score_codex":0.0027244086,"about_ca_system_score_gemma":0.001433165,"threshold_uncertainty_score":0.033955097},"labels":[],"label_agreement":null}]}