{"meta":{"query_hash":"f97d7b77db1e","filters":{"venue":"IJCCI"},"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/f97d7b77db1e","api":"https://metacan.xera.ac/api/v1/cohort?venue=IJCCI"},"results":[{"id":"W2550943709","doi":"","title":"A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem.","year":2009,"lang":"en","type":"article","venue":"IJCCI","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Waterloo","funders":"","keywords":"Vertex cover; Tree traversal; Graph traversal; Algorithm; Vertex (graph theory); Feedback vertex set; Edge cover; Pruning; Mathematics; Cardinality (data modeling); Ant colony optimization algorithms; Reachability; Computer science; Graph; Combinatorics; Mathematical optimization; Approximation algorithm; Data mining","score_opus":0.013454539917893494,"score_gpt":0.2624972349315403,"score_spread":0.24904269501364681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550943709","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.0036762762,0.00008775286,0.9916936,0.00020846502,0.00022366001,0.00043567494,0.000018880964,0.00050319737,0.0031524755],"genre_scores_gemma":[0.09848016,0.000004801682,0.90047127,0.00038812094,0.00009151673,0.00004131348,0.000023314773,0.000044644723,0.0004548818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.000030895142,0.00020587027,0.00016716664,0.00011743793,0.0002896732],"domain_scores_gemma":[0.99951047,0.00014760172,0.00003394102,0.00017589757,0.00006089832,0.00007117456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027919226,0.00013778523,0.00017056364,0.0000735704,0.00006646933,0.000042498617,0.00011480532,0.00009198431,0.00004958548],"category_scores_gemma":[0.00006991327,0.0001483507,0.000058751237,0.00019392905,0.000011102284,0.00008937692,0.000007785311,0.00009830289,0.000021327776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000017479239,0.000066729655,0.0000965804,0.00007005538,0.00003445619,0.00000806182,0.00030764585,0.7496878,0.00836464,0.0001888349,0.014211288,0.22694647],"study_design_scores_gemma":[0.0008250199,0.0000947206,0.00028364419,0.00003965729,0.000016338372,0.0000027057495,0.000008644794,0.9805043,0.0043460373,0.00018180514,0.013509276,0.00018786105],"about_ca_topic_score_codex":0.0000018157102,"about_ca_topic_score_gemma":4.4323093e-7,"teacher_disagreement_score":0.23081653,"about_ca_system_score_codex":0.00007477283,"about_ca_system_score_gemma":0.000034886336,"threshold_uncertainty_score":0.60495657},"labels":[],"label_agreement":null}]}