{"meta":{"query_hash":"3e7c1ef5cd16","filters":{"venue":"Mathematical Foundations of Computer Science"},"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/3e7c1ef5cd16","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+Foundations+of+Computer+Science"},"results":[{"id":"W2397721975","doi":"","title":"Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.","year":2014,"lang":"en","type":"article","venue":"Mathematical Foundations of Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Planar graph; Computer science; Directed graph; Planar; Algorithm; Time complexity; Graph; Polynomial; Combinatorics; Mathematics; Discrete mathematics; Computer graphics (images)","score_opus":0.00982317101792221,"score_gpt":0.24447553559354215,"score_spread":0.23465236457561994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397721975","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.07011542,0.004153946,0.8048536,0.0081059765,0.00071195984,0.0010391593,0.005785078,0.03720345,0.06803143],"genre_scores_gemma":[0.44813004,0.000993775,0.5165547,0.0012585194,0.0003475491,0.0011940275,0.0075942017,0.0018257508,0.022101492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957235,0.0008487286,0.00022851946,0.0013162099,0.0010144529,0.00086862233],"domain_scores_gemma":[0.9891587,0.0062626093,0.000508053,0.0028346626,0.00067574094,0.00056007504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017148971,0.0027452882,0.0022167757,0.001714631,0.0018528317,0.00358567,0.0068773166,0.0026566908,0.039795406],"category_scores_gemma":[0.010383251,0.000846479,0.002157539,0.0037077353,0.0022259578,0.009312718,0.0046222857,0.0043908833,0.00894795],"study_design_candidate":"theoretical_or_conceptual","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.0045216875,0.0020088397,0.0038197266,0.003040427,0.0005731989,0.00043387606,0.0008289389,0.1026241,0.029916717,0.10122806,0.1309864,0.620018],"study_design_scores_gemma":[0.0019999456,0.0005960087,0.0027226429,0.00020124918,0.000581736,0.00096132373,0.00060927164,0.63982093,0.017195411,0.30258378,0.03255875,0.00016888297],"about_ca_topic_score_codex":0.008568107,"about_ca_topic_score_gemma":0.022533549,"teacher_disagreement_score":0.039795406,"about_ca_system_score_codex":0.0058699446,"about_ca_system_score_gemma":0.0076945033,"threshold_uncertainty_score":0.13312888},"labels":[],"label_agreement":null}]}