{"meta":{"query_hash":"c3650ef899f0","filters":{"venue":"International Conference on Computational Intelligence"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/c3650ef899f0","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Computational+Intelligence"},"results":[{"id":"W36570737","doi":"10.1093/conphys/coac071","title":"Evaluation Methodology for Rule Scheduling in Active Database Systems.","year":2004,"lang":"en","type":"article","venue":"International Conference on Computational Intelligence","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Active database; Database; Scheduling (production processes); Data mining; Mathematical optimization; Mathematics","score_opus":0.28275152046420693,"score_gpt":0.4406739859647228,"score_spread":0.15792246550051586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36570737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043777674,0.00008233897,0.99033034,0.0013721981,0.0014836777,0.0006316327,0.00017114962,0.00006764855,0.0014832236],"genre_scores_gemma":[0.59553534,0.000016334236,0.4037204,0.00015822137,0.00009063742,0.00024656582,0.00020199719,0.000007969817,0.00002250508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974681,0.00021707788,0.00053724705,0.0006426637,0.000880302,0.00025457412],"domain_scores_gemma":[0.9971335,0.00071081024,0.0002473529,0.0002977297,0.0015351471,0.00007547432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015880356,0.00020149117,0.00022932932,0.0003582685,0.000106876476,0.0001195351,0.00072157243,0.00006992569,0.00004036733],"category_scores_gemma":[0.00090187835,0.00020319846,0.00006199727,0.00027185882,0.00007418392,0.0010191025,0.00015776209,0.00019565635,0.000070591086],"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.000028052347,0.00005046705,0.000006646514,0.0000070322317,0.000017691767,0.000003852071,0.00018170434,0.44415304,0.00019590609,0.54023814,0.0000043973546,0.015113059],"study_design_scores_gemma":[0.0003863915,0.00008016897,0.00013932186,0.00018791851,0.0000049912455,0.000022493186,0.0003399565,0.73739415,0.0022809482,0.25865352,0.00031936582,0.0001907802],"about_ca_topic_score_codex":0.00020913233,"about_ca_topic_score_gemma":0.00007247277,"teacher_disagreement_score":0.5911576,"about_ca_system_score_codex":0.00044309726,"about_ca_system_score_gemma":0.0006033883,"threshold_uncertainty_score":0.8286193},"labels":[],"label_agreement":null},{"id":"W92682349","doi":"","title":"A New Branch and Bound Method for Incremental Satisfiability Problem.","year":2004,"lang":"en","type":"article","venue":"International Conference on Computational Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Regina","funders":"","keywords":"Branch and bound; Satisfiability; Boolean satisfiability problem; Scheduling (production processes); Conjunctive normal form; Computer science; Routing (electronic design automation); Mathematical optimization; Upper and lower bounds; Theoretical computer science; Mathematics","score_opus":0.08678413591221729,"score_gpt":0.3965719329139487,"score_spread":0.3097877970017314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92682349","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.0015849036,0.000021243837,0.98972106,0.004125725,0.00055158744,0.0005187063,0.000024476074,0.00011042864,0.0033418837],"genre_scores_gemma":[0.3695343,0.000008350787,0.6298085,0.00043035296,0.00006665749,0.000053072792,0.000019781051,0.0000069987927,0.00007201003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798524,0.00008320021,0.00047744976,0.00065096276,0.0005755836,0.0002275758],"domain_scores_gemma":[0.9984845,0.00037379118,0.00019754913,0.00026112306,0.0005386475,0.00014438525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570294,0.00020919878,0.00017705305,0.00017932279,0.00015931511,0.00039209993,0.00094789284,0.0000762699,0.00008011408],"category_scores_gemma":[0.0002395903,0.00021403511,0.00006951121,0.00021653711,0.00009090627,0.00072623853,0.00018951287,0.0001760456,0.00004477045],"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.000037183363,0.000054678207,0.00005690093,0.000010861177,0.000024119963,6.952417e-7,0.00036283425,0.03149872,0.00043450447,0.8268421,0.000051364725,0.14062601],"study_design_scores_gemma":[0.0002435811,0.00017122128,0.00095925893,0.000043349075,0.0000031946702,0.000020348074,0.000025683034,0.34940737,0.005203458,0.64344865,0.00030615172,0.00016774643],"about_ca_topic_score_codex":0.00019802067,"about_ca_topic_score_gemma":0.000026393625,"teacher_disagreement_score":0.36794943,"about_ca_system_score_codex":0.00022570154,"about_ca_system_score_gemma":0.00041023106,"threshold_uncertainty_score":0.8728099},"labels":[],"label_agreement":null}]}