{"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"},"query_hash":"3e7c1ef5cd16","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.00982317101792221,"gpt":0.2444755355935422,"spread":0.2346523645756199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001883073,0.0001658583,0.0003056077,0.0003057877,0.0004262491,0.0003028991,0.001249174,0.00004558895,0.000008375217],"category_scores_gemma":[0.0002714621,0.0001431651,0.00008739376,0.0009683917,0.001011209,0.000752677,0.0002811586,0.00007735888,0.0000213198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000179698,"about_ca_system_score_gemma":0.00007568869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000359047,"about_ca_topic_score_gemma":2.910078e-7,"domain_scores_codex":[0.9982594,0.00008349414,0.0003719238,0.0005609098,0.0003752828,0.0003490488],"domain_scores_gemma":[0.9975981,0.001051896,0.0001349357,0.0007704081,0.0002584297,0.0001862989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002058852,0.0001422021,0.000008428121,0.00003652753,0.0000103872,2.401538e-7,0.0004783673,0.00002024306,0.001482082,0.7784548,0.0001295143,0.2192351],"study_design_scores_gemma":[0.0001926302,0.000138948,0.0001839569,0.00002578942,0.000006148222,0.00001302597,0.00000353616,0.6312488,0.001127788,0.366655,0.0002789112,0.0001254661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005807515,0.000008561251,0.9920061,0.0006877918,0.0002021104,0.0003189955,0.000006304068,0.00019393,0.0007686478],"genre_scores_gemma":[0.05644676,0.000001037003,0.9433044,0.00007867289,0.00005658689,0.00002457809,0.000002417047,0.00000701047,0.00007849838],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6312286,"threshold_uncertainty_score":0.5838103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}