{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05814878,0.00024130524,0.9305855,0.0006340826,0.00046509443,0.0011849017,0.000019623416,0.00060411106,0.008116602],"genre_scores_gemma":[0.3560362,0.000007950538,0.64334,0.00003599138,0.00014588053,0.00014966945,0.0000025164943,0.000016269878,0.00026555907],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847305,0.00010291236,0.00036230718,0.00042916148,0.00027934252,0.00035323767],"domain_scores_gemma":[0.9983107,0.00032756082,0.00024948415,0.0008086139,0.00022782978,0.000075805896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094216794,0.00017835565,0.00023378782,0.00016612286,0.00011964843,0.00009826653,0.0009518171,0.00009669908,0.0000072334533],"category_scores_gemma":[0.0006011565,0.00015573273,0.00011036484,0.00028083418,0.0001964751,0.00023782482,0.00014462235,0.000089136265,0.000020449492],"study_design_candidate":"bench_or_experimental","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.000055619275,0.00025586173,0.00026777797,0.0002657507,0.000058613077,0.000003570812,0.0012631713,0.00016270287,0.019448584,0.46202195,0.00003132077,0.5161651],"study_design_scores_gemma":[0.0003552026,0.0017773187,0.0011552562,0.00020149008,0.000042945758,0.000014079585,0.00041190462,0.038467877,0.9251086,0.0006733564,0.031353224,0.00043871254],"about_ca_topic_score_codex":0.00002216912,"about_ca_topic_score_gemma":0.0000073365163,"teacher_disagreement_score":0.90566003,"about_ca_system_score_codex":0.000035912082,"about_ca_system_score_gemma":0.000062743704,"threshold_uncertainty_score":0.63505965},"labels":[],"label_agreement":null}]}