{"meta":{"query_hash":"0fbf3d8f5d3e","filters":{"venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/0fbf3d8f5d3e","api":"https://metacan.xera.ac/api/v1/cohort?venue=Conference+on+Object-Oriented+Programming+Systems%2C+Languages%2C+and+Applications"},"results":[{"id":"W3161581138","doi":"","title":"A Model for Reasoning about JavaScript Promises","year":2017,"lang":"en","type":"article","venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"","keywords":"Computer science; JavaScript; Debugging; Correctness; Programming language; Asynchrony (computer programming); Web application; Asynchronous communication; Unobtrusive JavaScript; Callback; Graph; Theoretical computer science; Event (particle physics); Software engineering; World Wide Web; Rich Internet application","score_opus":0.04423248080763079,"score_gpt":0.31538752098164813,"score_spread":0.2711550401740173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161581138","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.005116303,0.0001382683,0.9860504,0.0010944939,0.00006471463,0.00010914716,0.00036017722,0.0018131717,0.0052533383],"genre_scores_gemma":[0.264555,0.0007686702,0.7189058,0.0010584042,0.00038338618,0.0006487272,0.0014672447,0.0010739194,0.011138809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596894,0.0011505132,0.00036168823,0.00065743405,0.0013125754,0.00054892234],"domain_scores_gemma":[0.99351716,0.003816812,0.00045396315,0.0009923456,0.00091495004,0.00030478052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051901387,0.0010186969,0.00085130316,0.0024035492,0.002776306,0.005219544,0.004376902,0.0030646154,0.00532247],"category_scores_gemma":[0.010778729,0.0018103031,0.004592283,0.0024398712,0.0053817923,0.01594826,0.0054586222,0.0049508763,0.0016129944],"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.00004707175,0.000025940608,0.00023113558,0.00008814555,0.000017931252,0.000266644,0.0006041651,0.014178207,0.0010506387,0.9748947,0.0016177536,0.0069777663],"study_design_scores_gemma":[0.000053404503,0.000039623777,0.000099738594,0.00005842515,0.00005219396,0.00017333582,0.00021123906,0.12181246,0.0024573838,0.8471466,0.027848512,0.000047214737],"about_ca_topic_score_codex":0.013333162,"about_ca_topic_score_gemma":0.009556533,"teacher_disagreement_score":0.013333162,"about_ca_system_score_codex":0.0037416092,"about_ca_system_score_gemma":0.0034664513,"threshold_uncertainty_score":0.027448356},"labels":[],"label_agreement":null},{"id":"W3163215105","doi":"","title":"IDEal: Efficient and Precise Alias-Aware Dataflow Analysis","year":2017,"lang":"en","type":"article","venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"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 Alberta","funders":"","keywords":"Alias; Computer science; Dataflow; Aliasing; Ideal (ethics); Programming language; Static analysis; Theoretical computer science; Parallel computing; Algorithm; Data mining; Artificial intelligence","score_opus":0.024022456787395396,"score_gpt":0.31973205233373947,"score_spread":0.2957095955463441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163215105","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.012897029,0.00048430482,0.90507597,0.00037953985,0.00007938179,0.00012968396,0.0009143208,0.07672689,0.0033129384],"genre_scores_gemma":[0.17628549,0.0004628529,0.81040907,0.00046976932,0.00010098367,0.00020751987,0.0027657433,0.006394407,0.0029042058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936098,0.0008566426,0.00043180995,0.00089245016,0.0036807128,0.00052857393],"domain_scores_gemma":[0.99304116,0.0022999493,0.000579473,0.0025807694,0.0012614497,0.00023721429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004372999,0.0012508912,0.0010074999,0.0023693272,0.0009749109,0.003115725,0.003919661,0.0010559547,0.0033852628],"category_scores_gemma":[0.013003613,0.0011676947,0.0020288175,0.0015517524,0.002322357,0.007456623,0.003925375,0.0028248888,0.0016518986],"study_design_candidate":"simulation_or_modeling","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.0016846982,0.00047145208,0.019004168,0.001421799,0.0002919364,0.00028190052,0.0012220375,0.08573496,0.048003536,0.11346511,0.06786419,0.66055423],"study_design_scores_gemma":[0.00021393468,0.00023903268,0.0024343044,0.00018567267,0.00018283348,0.0003130716,0.00023655944,0.76383567,0.07716659,0.07570786,0.079311185,0.00017336346],"about_ca_topic_score_codex":0.005928815,"about_ca_topic_score_gemma":0.007866551,"teacher_disagreement_score":0.005928815,"about_ca_system_score_codex":0.0020656716,"about_ca_system_score_gemma":0.00557475,"threshold_uncertainty_score":0.0231269},"labels":[],"label_agreement":null},{"id":"W3163223842","doi":"","title":"The VM Already Knew That: Leveraging Compile-Time Knowledge to Optimize Gradual Typing","year":2017,"lang":"en","type":"article","venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"","keywords":"Computer science; Compile time; Programmer; Programming language; JavaScript; Compiler; Code (set theory); Just-in-time compilation; Object (grammar); Artificial intelligence","score_opus":0.04608562986757483,"score_gpt":0.3130508497861182,"score_spread":0.2669652199185434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163223842","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.11587307,0.0006149336,0.82918453,0.0016464081,0.00035225265,0.0001679325,0.00019278066,0.03782539,0.014142772],"genre_scores_gemma":[0.51375645,0.0005495753,0.45618933,0.001327614,0.000121499994,0.00015059224,0.00053038856,0.014647863,0.012726587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973693,0.0005557506,0.00021176758,0.0005319132,0.00091725664,0.0004139495],"domain_scores_gemma":[0.9892713,0.0021868837,0.00066049246,0.006462739,0.0011031403,0.00031549166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028083178,0.0009708817,0.0005288112,0.0004921347,0.00087536423,0.002897369,0.0024388072,0.0009811644,0.0035093601],"category_scores_gemma":[0.016526952,0.0011229016,0.0009988563,0.0005217566,0.0023185506,0.0072500203,0.002963281,0.0038343281,0.0026046962],"study_design_candidate":"simulation_or_modeling","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.0017506616,0.00048309533,0.03211618,0.0007778975,0.00020319606,0.0008291648,0.0042458135,0.056158878,0.21105818,0.15892693,0.021402687,0.51204723],"study_design_scores_gemma":[0.00018405804,0.0007027791,0.0064341603,0.0005315636,0.0003687899,0.001003326,0.00059834763,0.35875675,0.3106806,0.13714106,0.18323383,0.00036469536],"about_ca_topic_score_codex":0.0030969149,"about_ca_topic_score_gemma":0.003980336,"teacher_disagreement_score":0.0035093601,"about_ca_system_score_codex":0.0010686824,"about_ca_system_score_gemma":0.0033756,"threshold_uncertainty_score":0.014851987},"labels":[],"label_agreement":null}]}