{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058075152,0.000008561251,0.9920061,0.0006877918,0.0002021104,0.0003189955,0.000006304068,0.00019392997,0.0007686478],"genre_scores_gemma":[0.056446765,0.0000010370026,0.9433044,0.00007867289,0.00005658689,0.00002457809,0.0000024170472,0.0000070104697,0.00007849838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825937,0.00008349414,0.00037192376,0.0005609098,0.00037528278,0.00034904882],"domain_scores_gemma":[0.99759805,0.0010518963,0.0001349357,0.0007704081,0.0002584297,0.0001862989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830734,0.00016585832,0.0003056077,0.00030578766,0.00042624908,0.00030289913,0.0012491741,0.000045588953,0.0000083752175],"category_scores_gemma":[0.00027146208,0.00014316507,0.00008739376,0.00096839166,0.0010112092,0.00075267704,0.00028115857,0.00007735888,0.000021319802],"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.0000020588518,0.00014220209,0.000008428121,0.000036527526,0.000010387201,2.4015384e-7,0.00047836732,0.00002024306,0.0014820823,0.77845484,0.00012951429,0.2192351],"study_design_scores_gemma":[0.00019263019,0.00013894805,0.00018395693,0.000025789415,0.000006148222,0.000013025969,0.0000035361602,0.63124883,0.0011277882,0.36665496,0.00027891123,0.00012546612],"about_ca_topic_score_codex":0.0000035904698,"about_ca_topic_score_gemma":2.9100784e-7,"teacher_disagreement_score":0.6312286,"about_ca_system_score_codex":0.000017969804,"about_ca_system_score_gemma":0.000075688695,"threshold_uncertainty_score":0.58381027},"labels":[],"label_agreement":null}]}