{"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":"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.0048605753,0.00041863273,0.9837918,0.00021202026,0.00012966027,0.00066051574,0.0009035518,0.0068574,0.0021659234],"genre_scores_gemma":[0.147043,0.00032086275,0.845729,0.00020743461,0.000121242614,0.0012578071,0.0029862965,0.0006823784,0.0016520679],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98468125,0.006241037,0.0020225367,0.0018439587,0.004511803,0.00069937535],"domain_scores_gemma":[0.9651967,0.022190034,0.0014677886,0.0044710045,0.0059097637,0.000764611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018585455,0.0019558726,0.0015740994,0.002787876,0.00089608,0.0044815657,0.004283723,0.0013847102,0.012700697],"category_scores_gemma":[0.05672211,0.0009861985,0.0019060115,0.0022013865,0.0009232136,0.005607866,0.0025003762,0.001746565,0.0028608236],"study_design_candidate":"theoretical_or_conceptual","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.0011038963,0.00047517935,0.0044546435,0.0012888622,0.00037599212,0.00021879407,0.00029897992,0.1917147,0.0035918793,0.05671976,0.018100804,0.7216565],"study_design_scores_gemma":[0.00011702865,0.00018167979,0.00036126858,0.00010213827,0.000064757936,0.00009450904,0.00008597182,0.94989693,0.0024287887,0.04081267,0.0058343345,0.00001994642],"about_ca_topic_score_codex":0.0041658506,"about_ca_topic_score_gemma":0.0039526224,"teacher_disagreement_score":0.018585455,"about_ca_system_score_codex":0.0017046414,"about_ca_system_score_gemma":0.0038604175,"threshold_uncertainty_score":0.0982905},"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":"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.0008794121,0.0004444888,0.99401265,0.00024699158,0.00008379625,0.00010624931,0.000102796286,0.0009137714,0.003209766],"genre_scores_gemma":[0.029428324,0.00048252568,0.96443975,0.0002911847,0.000111109046,0.0005103228,0.00059348164,0.00058372505,0.0035595659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973853,0.00065043196,0.00014691165,0.00046313764,0.0011372712,0.00021688335],"domain_scores_gemma":[0.9964133,0.0024559621,0.00016247772,0.0004290932,0.00041227887,0.00012691315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023594531,0.001414686,0.0014446946,0.002543191,0.0012299423,0.0024270918,0.0033156814,0.0016376551,0.0116171],"category_scores_gemma":[0.008544403,0.0009855852,0.0017145306,0.0026459517,0.0015617239,0.004513125,0.0028429395,0.0047221417,0.0030476856],"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.00027401157,0.0002380269,0.00073254644,0.0009553989,0.0002174004,0.00026972688,0.00035196316,0.10683977,0.009305414,0.22343251,0.03591253,0.6214707],"study_design_scores_gemma":[0.00019755491,0.00012801046,0.00027694277,0.00017427378,0.00016062954,0.000394352,0.00007792749,0.72936225,0.008364447,0.1955619,0.06522321,0.00007845379],"about_ca_topic_score_codex":0.0039039184,"about_ca_topic_score_gemma":0.004611555,"teacher_disagreement_score":0.0116171,"about_ca_system_score_codex":0.0017278222,"about_ca_system_score_gemma":0.0027819301,"threshold_uncertainty_score":0.038863063},"labels":[],"label_agreement":null}]}