{"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":"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.020720175,0.00079887686,0.9718161,0.00026537443,0.00009126197,0.00018674556,0.000081644896,0.0006318781,0.0054078694],"genre_scores_gemma":[0.23399265,0.00047794476,0.7614166,0.00014837035,0.000045462435,0.00034843435,0.00028461812,0.00008896828,0.003196916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999556,0.00012935337,0.000020271566,0.000060879607,0.00019368858,0.000039861065],"domain_scores_gemma":[0.99952614,0.00024407939,0.000062908024,0.000052499607,0.00008765782,0.00002670332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044219865,0.0005727515,0.0009796713,0.0009795374,0.0005108865,0.00061382574,0.0012707727,0.001073806,0.0011349239],"category_scores_gemma":[0.0017201942,0.00032939157,0.0005548064,0.0011221734,0.00036038161,0.00067163614,0.00058966107,0.0007355977,0.00030555043],"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.000099245335,0.00012682201,0.0010448856,0.00016425924,0.000099205776,0.00018682705,0.00009651146,0.72977525,0.009040869,0.016754577,0.0042313104,0.23838024],"study_design_scores_gemma":[0.000022303424,0.000045893154,0.00014668606,0.000010529967,0.000012377623,0.00010880955,0.00001197223,0.9921984,0.0010308878,0.0035999937,0.0028060786,0.000006190384],"about_ca_topic_score_codex":0.0030843986,"about_ca_topic_score_gemma":0.003515841,"teacher_disagreement_score":0.0030843986,"about_ca_system_score_codex":0.0005034728,"about_ca_system_score_gemma":0.0009083447,"threshold_uncertainty_score":0.0061329007},"labels":[],"label_agreement":null}]}