{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"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":"fab992e30a56","filters":{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Theoretical computer science","authors":[{"name":"Mark Burgin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01155675572829767,"gpt":0.224193344343871,"spread":0.2126365886155733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004142302,0.0006988625,0.001136982,0.001682803,0.001502542,0.003020448,0.001704953,0.001769919,0.01015],"category_scores_gemma":[0.01592881,0.0005881002,0.00122264,0.001358643,0.002763,0.005722851,0.003335647,0.002789982,0.000602448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002724409,"about_ca_system_score_gemma":0.001433165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00209935,"about_ca_topic_score_gemma":0.005666315,"domain_scores_codex":[0.9963062,0.00161506,0.0002475532,0.000474591,0.0009498526,0.0004069049],"domain_scores_gemma":[0.9844918,0.01232139,0.0008044061,0.001007246,0.0006859289,0.0006893192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005389793,0.00005424487,0.0009893711,0.0003087561,0.00007771679,0.0001031664,0.0005549814,0.0256723,0.0004616322,0.9349383,0.005020288,0.0317653],"study_design_scores_gemma":[0.00002884625,0.00002103176,0.0003134113,0.00002970978,0.00001428703,0.00008367072,0.0000891355,0.0954861,0.000114104,0.8984439,0.005367007,0.000008957099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1352164,0.009213793,0.7629804,0.009043109,0.0002842214,0.0003032604,0.0007520154,0.0007451448,0.08146163],"genre_scores_gemma":[0.7571873,0.002501349,0.2087976,0.0009651154,0.0005439206,0.0005050921,0.001073524,0.0001977868,0.02822829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01015,"threshold_uncertainty_score":0.0339551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}