{"meta":{"query_hash":"d91f73a8c034","filters":{"venue":"Symposium on Principles of Programming Languages"},"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/d91f73a8c034","api":"https://metacan.xera.ac/api/v1/cohort?venue=Symposium+on+Principles+of+Programming+Languages"},"results":[{"id":"W2898631824","doi":"","title":"Strategy Synthesis for Linear Arithmetic Games","year":2018,"lang":"en","type":"article","venue":"Symposium on Principles of Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reachability; Computer science; Satisfiability; Combinatorial game theory; Dimension (graph theory); Game theory; Game tree; Theoretical computer science; Repeated game; Sequential game; Mathematical economics; Mathematics; Combinatorics","score_opus":0.04412962643162666,"score_gpt":0.33670801020447344,"score_spread":0.2925783837728468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898631824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023832656,0.00038801372,0.9550806,0.00051403855,0.00007516069,0.0003759517,0.00016192914,0.00088518084,0.018686434],"genre_scores_gemma":[0.3745209,0.000601756,0.6115898,0.00042502076,0.000067361914,0.0008647071,0.0005272215,0.00031638978,0.011086896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783057,0.00069496187,0.00019143612,0.0004589864,0.0005383633,0.00028568137],"domain_scores_gemma":[0.9978296,0.0017061246,0.00011966418,0.00012744639,0.00014658667,0.0000706317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016327469,0.001289324,0.0009653719,0.00093020475,0.0007949133,0.0023015782,0.001239447,0.0010943484,0.00783824],"category_scores_gemma":[0.0061098156,0.00064358715,0.0020775709,0.0006941808,0.0026647549,0.0026270922,0.0019956706,0.0022584456,0.0010681455],"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.00014355677,0.00013582612,0.0004068371,0.0005254467,0.00006315369,0.00018312261,0.0006336886,0.10673156,0.005970328,0.8211102,0.0016939829,0.06240223],"study_design_scores_gemma":[0.00013156193,0.00011946496,0.000103234015,0.0001055831,0.000057242778,0.00007901206,0.00017437935,0.24038,0.005765288,0.7442479,0.00880336,0.000032915712],"about_ca_topic_score_codex":0.0023029286,"about_ca_topic_score_gemma":0.0028682537,"teacher_disagreement_score":0.00783824,"about_ca_system_score_codex":0.0024177525,"about_ca_system_score_gemma":0.0019538463,"threshold_uncertainty_score":0.026221573},"labels":[],"label_agreement":null}]}